- Approximation Algorithms and Semidefinite Programming2012 | Faculty of Mathematics and Physics
- Cubical coloring - fractional covering by cuts and semidefinite programming2015 | Faculty of Mathematics and Physics
- Three-Monotone Interpolation2015 | Faculty of Mathematics and Physics
- Tight bounds on the radius of nonsingularity2016 | Faculty of Mathematics and Physics
- Relaxations of graph isomorphism Leibniz International Proceedings in Informatics2017 | Faculty of Mathematics and Physics
- Vector coloring the categorical product of graphs2020 | Faculty of Mathematics and Physics
- Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings2017 | Faculty of Mathematics and Physics
- Coarse-convex-compactification approach to numerical solution of nonconvex variational problems2010 | Faculty of Mathematics and Physics
- The determinant bound for discrepancy is almost tight2013 | Faculty of Mathematics and Physics
- Graph homomorphisms via vector colorings2019 | Faculty of Mathematics and Physics
- Regularity radius: Properties, approximation and a not a priori exponential algorithm2018 | Faculty of Mathematics and Physics