- Sparse Kneser graphs are Hamiltonian2021 | Faculty of Mathematics and Physics
- Kneser Graphs Are Hamiltonian2023 | Faculty of Mathematics and Physics
- Optimal real number graph labelings of a subfamily of Kneser graphs2009 | Faculty of Mathematics and Physics
- Kneser ranks of random graphs and minimum difference representations2017 | Faculty of Mathematics and Physics
- KNESER RANKS OF RANDOM GRAPHS AND MINIMUM DIFFERENCE REPRESENTATIONS2018 | Faculty of Mathematics and Physics
- Graph Cores via Universal Completability2015 | Faculty of Mathematics and Physics
- Graph homomorphisms via vector colorings2019 | Faculty of Mathematics and Physics
- Matroid invariants and counting graph homomorphisms2015 | Faculty of Mathematics and Physics
- Cubical coloring - fractional covering by cuts and semidefinite programming2015 | Faculty of Mathematics and Physics
- Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings2017 | Faculty of Mathematics and Physics