- Noncrossing Hamiltonian paths in geometric graphs2007 | Faculty of Mathematics and Physics
- Hamiltonian paths with prescribed edges in hypercubes2007 | Faculty of Mathematics and Physics
- Noncrossing Hamiltonian Paths in Geometric Graphs2004 | Faculty of Mathematics and Physics
- Paths with no small angles2009 | Faculty of Mathematics and Physics
- On the mutually independent Hamiltonian cycles in faulty hypercubes2013 | Faculty of Mathematics and Physics
- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs2013 | Faculty of Mathematics and Physics
- Paired 2-disjoint path covers of burnt pancake graphs with faulty elements2024 | Faculty of Mathematics and Physics
- Generalized Gray codes with prescribed ends2017 | Faculty of Mathematics and Physics
- Gray codes with bounded weights2012 | Faculty of Mathematics and Physics
- Hamiltonian fault-tolerance of hypercubes2007 | Faculty of Mathematics and Physics
- Subgraphs of Hypercubes - Embeddings with Restrictions or Prescriptions +1Publication without faculty affiliation
- Extending perfect matchings to Gray codes with prescribed ends2018 | Faculty of Mathematics and Physics
- Partitions of faulty hypercubes into paths with prescribed endvertices2008 | Faculty of Mathematics and Physics
- Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs2016 | Faculty of Mathematics and Physics
- Kernelization of Graph Hamiltonicity: Proper H-Graphs2019 | Faculty of Mathematics and Physics
- Kernelization of Graph Hamiltonicity: Proper H-Graphs2021 | Faculty of Mathematics and Physics, Central Library of Charles University