- On the structure and clique-width of (4K1,C4,C6,C7)-free graphs2022 | Faculty of Mathematics and Physics
- Clique-width: Harnessing the power of atoms2023 | Faculty of Mathematics and Physics
- Homothetic polygons and beyond: Maximal cliques in intersection graphs2018 | Faculty of Mathematics and Physics
- Beyond homothetic polygons: recognition and maximum clique2012 | Faculty of Mathematics and Physics
- Clique-Width: Harnessing the Power of Atoms2020 | Faculty of Mathematics and Physics
- Solving difficult SAT instances using greedy clique decomposition2007 | Faculty of Mathematics and Physics
- Solving Difficult SAT Instances Using Greedy Clique Decomposition2007 | Faculty of Mathematics and Physics
- Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem2020 | Faculty of Mathematics and Physics
- On the clique-width of (4K(1), C-4, C-5, C-7)-free graphs2020 | Faculty of Mathematics and Physics
- On monotone circuits with local oracles and clique lower bounds2019 | Faculty of Mathematics and Physics
- Max-Tolerance graphs as intersection graphs: Cliques, cycles and recognition +22006 | Faculty of Mathematics and Physics
- Bicoloring clique hypergraphs2000 | Faculty of Mathematics and Physics
- Busygin, Stanislav; Pasechnik, Dmitrii V.: On NP-hardness of the clique partition -- independence number gap recognition and related problems2006 | Faculty of Mathematics and Physics
- On the complexity of bicoloring clique hypergraphs of graphs2002 | Publication without faculty affiliation
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms2010 | Faculty of Mathematics and Physics
- Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width2012 | Faculty of Mathematics and Physics
- Covering minimal separators and potential maximal cliques in P-t-free graphs2021 | Faculty of Mathematics and Physics
- Combinatorial problems on H-graphs2017 | Faculty of Mathematics and Physics
- Coloring (4K1,C4,C6)-free graphs2023 | Faculty of Mathematics and Physics
- 5-Coloring Graphs with 4 Crossings2011 | Faculty of Mathematics and Physics
- On three parameters of invisibility graphs2010 | Faculty of Mathematics and Physics
- Kneser ranks of random graphs and minimum difference representations2017 | Faculty of Mathematics and Physics
- Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs2022 | Faculty of Mathematics and Physics
- SHRUB-DEPTH: CAPTURING HEIGHT OF DENSE GRAPHS2019 | Faculty of Mathematics and Physics
- KNESER RANKS OF RANDOM GRAPHS AND MINIMUM DIFFERENCE REPRESENTATIONS2018 | Faculty of Mathematics and Physics
- Classes of graphs with low complexity: The case of classes with bounded linear rankwidth2021 | Faculty of Mathematics and Physics
- PROXIMITY GRAPHS: E, delta, Delta, chi AND omega2012 | Faculty of Mathematics and Physics
- Classes of graphs with small rank decompositions are chi-bounded2012 | Faculty of Mathematics and Physics