- Polynomial-time algorithm for fixed points of nontrivial morphisms2009 | Faculty of Mathematics and Physics
- Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs2019 | Faculty of Mathematics and Physics
- Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs2022 | Faculty of Mathematics and Physics
- A polynomial time algorithm for single machine multislot just-in-time scheduling problem.2003 | Faculty of Mathematics and Physics
- Cubic plane graphs on a given point set2015 | Faculty of Mathematics and Physics
- The k-in-a-Path Problem for Claw-free Graphs2012 | Faculty of Mathematics and Physics
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus2017 | Faculty of Mathematics and Physics
- Graph isomorphism restricted by lists2021 | Faculty of Mathematics and Physics
- It is tough to be a plumber2004 | Faculty of Mathematics and Physics, Central Library of Charles University
- An Algorithm for Cyclic Edge Connectivity of Cubic Graphs2004 | Faculty of Mathematics and Physics
- Clustered Planarity: Small Clusters in Eulerian Graphs +12008 | Faculty of Mathematics and Physics
- Coloring triangle-free graphs on surfaces +12007 | Faculty of Mathematics and Physics
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters (Extended Abstract)2009 | Faculty of Mathematics and Physics
- Computing the branchwidth of interval graphs +12005 | Faculty of Mathematics and Physics
- On Complexity of Colouring Mixed Hypertrees2001 | Faculty of Mathematics and Physics
- The Subchromatic Index of Graphs2007 | Faculty of Mathematics and Physics
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs2009 | Faculty of Mathematics and Physics
- On the complexity of bicoloring clique hypergraphs of graphs2002 | Publication without faculty affiliation
- Extending Partial Representations of Circle Graphs2013 | Faculty of Mathematics and Physics
- On the Complexity of the Balanced Vertex Ordering Problem2007 | Faculty of Mathematics and Physics
- Cubic Plane Graphs on a Given Point Set2012 | Faculty of Mathematics and Physics
- Comparing universal covers in polynomial time +12008 | Faculty of Mathematics and Physics
- Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes2018 | Faculty of Mathematics and Physics
- On the computation of the hull number of a graph2009 | Faculty of Mathematics and Physics
- Additive non-approximability of chromatic number in proper minor-closed classes2023 | Faculty of Mathematics and Physics
- Computing the Norm $\|A\|_{\infty,1}$ is NP-Hard2000 | Faculty of Mathematics and Physics