- Algorithmic complexity of list colorings1994 | Publication without faculty affiliation
- Algorithms III - Complexity2007 | Faculty of Mathematics and Physics
- Preface2013 | Faculty of Mathematics and Physics
- On H-Topological Intersection Graphs2017 | Faculty of Mathematics and Physics
- Properties of Switch-List Representations of Boolean Functions2020 | Faculty of Mathematics and Physics
- Can They Cross? And How? (The Hitchhiker''s Guide to the Universe of Geometric Intersection Graphs)2011 | Faculty of Mathematics and Physics
- TEACHING EFFICIENCY OF ALGORITHMS ON CZECH GRAMMAR SCHOOLS2013 | Faculty of Mathematics and Physics
- Apollonian de Casteljau-type algorithms for complex rational Bézier curves2023 | Faculty of Mathematics and Physics
- HOMONOLO'03 - Workshop on graph homomorphisms and related topicsPublication without faculty affiliation
- HOMONOLO'07 - Workshop on graph homomorphisms and related topicsPublication without faculty affiliation
- HOMONOLO'05 - Workshop on graph homomorphisms and related topicsPublication without faculty affiliation
- Tractability conditions for classes of CNFs and their influence on the complexity of CNF minimization2014 | Faculty of Mathematics and Physics
- Structural sparsity2016 | Faculty of Mathematics and Physics
- Computer Memory: Why We Should Care What Is Under The Hood2012 | Faculty of Mathematics and Physics
- Letting future programmers experience performance-related tasks2021 | Faculty of Mathematics and Physics