- Treewidth of graphs with balanced separations2019 | Faculty of Mathematics and Physics
- Extension Complexity, MSO Logic, and Treewidth +12020 | Faculty of Mathematics and Physics
- Distance constrained labelings of graphs of bounded treewidth +22005 | Faculty of Mathematics and Physics
- SIMPLIFIED ALGORITHMIC METATHEOREMS BEYOND MSO: TREEWIDTH AND NEIGHBORHOOD DIVERSITY2017 | Faculty of Mathematics and Physics
- Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth2015 | Faculty of Mathematics and Physics
- Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity2019 | Faculty of Mathematics and Physics
- Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs2021 | Faculty of Mathematics and Physics
- On Algorithms Employing Treewidth for L-bounded Cut Problems2018 | Faculty of Mathematics and Physics
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree2015 | Faculty of Mathematics and Physics
- Parameterized complexity of coloring problems: Treewidth versus vertex cover2011 | Faculty of Mathematics and Physics
- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Extended abstract)2009 | Faculty of Mathematics and Physics
- Graph Burning and Non-uniform k-Centers for Small Treewidth2022 | Faculty of Mathematics and Physics
- Treewidth of Grid Subsets2018 | Faculty of Mathematics and Physics
- A (1+epsilon)-EMBEDDING OF LOW HIGHWAY DIMENSION GRAPHS INTO BOUNDED TREEWIDTH GRAPHS2018 | Faculty of Mathematics and Physics
- Graph burning and non-uniform $k$-centers for small treewidth2022 | Faculty of Mathematics and Physics
- Locally constrained homomorphisms on graphs of bounded degree and bounded treewidth2013 | Faculty of Mathematics and Physics
- Packing Directed Cycles Quarter- and Half-Integrally2022 | Faculty of Mathematics and Physics
- Combinatorial problems on H-graphs2017 | Faculty of Mathematics and Physics
- Approximating max-cut under graph-MSO constraints2018 | Faculty of Mathematics and Physics
- L(2,1,1)-Labeling Is NP-Complete for Trees2010 | Faculty of Mathematics and Physics
- Parameterized shifted combinatorial optimization2019 | Faculty of Mathematics and Physics
- LARGE INDEPENDENT SETS IN TRIANGLE-FREE PLANAR GRAPHS2017 | Faculty of Mathematics and Physics
- On Comparable Box Dimension2022 | Faculty of Mathematics and Physics
- Graph isomorphism restricted by lists2021 | Faculty of Mathematics and Physics
- The Subchromatic Index of Graphs2007 | Faculty of Mathematics and Physics
- Compressing permutation groups into grammars and polytopes. A graph embedding approach2020 | Faculty of Mathematics and Physics
- Packing directed circuits quarter-integrally2019 | Faculty of Mathematics and Physics