Euler cycles in the complete graph K2m+1. - Tomás Dvorák; Ivan Havel; Petr Liebl (Discret. Math., 1997)

Spanning caterpillars of a hypercube. - Tomás Dvorák; Ivan Havel; Jean-Marie Laborde; Michel Mollard (J. Graph Theory, 1997)

Euler Cycles in K2m Plus Perfect Matching. - Tomás Dvorák; Ivan Havel; Petr Liebl (Eur. J. Comb., 1999)

Chromatic Index of Hypergraphs and Shannon's Theorem. - Tomás Dvorák (Eur. J. Comb., 2000)

On paths and cycles dominating hypercubes. - Tomás Dvorák; Ivan Havel; Michel Mollard (Discret. Math., 2003)

Hamiltonian Cycles with Prescribed Edges in Hypercubes. - Tomás Dvorák (SIAM J. Discret. Math., 2005)

Dense sets and embedding binary trees into hypercubes. - Tomás Dvorák (Discret. Appl. Math., 2007)

Hamiltonian paths with prescribed edges in hypercubes. - Tomás Dvorák; Petr Gregor (Discret. Math., 2007)

Hamiltonian fault-tolerance of hypercubes. - Tomás Dvorák; Petr Gregor (Electron. Notes Discret. Math., 2007)

Sliding CDAWG Perfection. - Martin Senft; Tomás Dvorák (SPIRE, 2008)

Path partitions of hypercubes. - Petr Gregor; Tomás Dvorák (Inf. Process. Lett., 2008)

Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices. - Tomás Dvorák; Petr Gregor (SIAM J. Discret. Math., 2008)

Gray Code Compression. - Darko Dimitrov; Tomás Dvorák; Petr Gregor; Riste Skrekovski (IWOCA, 2009)

Gray Codes Avoiding Matchings. - Darko Dimitrov; Tomás Dvorák; Petr Gregor; Riste Skrekovski (Discret. Math. Theor. Comput. Sci., 2009)

Long paths and cycles in faulty hypercubes: existence, optimality, complexity. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek (Electron. Notes Discret. Math., 2009)

Long paths in hypercubes with a quadratic number of faults. - Tomás Dvorák; Václav Koubek (Inf. Sci., 2009)

Efficient Connectivity Testing of Hypercubic Networks with Faults. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek; Tomasz Radzik (IWOCA, 2010)

Computational complexity of long paths and cycles in faulty hypercubes. - Tomás Dvorák; Václav Koubek (Theor. Comput. Sci., 2010)

Gray codes with bounded weights. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek (Discret. Math., 2012)

Testing connectivity of faulty networks in sublinear time. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek; Tomasz Radzik (J. Discrete Algorithms, 2012)

On-line suffix tree construction with reduced branching. - Martin Senft; Tomás Dvorák (J. Discrete Algorithms, 2012)

Linear time construction of a compressed Gray code. - Darko Dimitrov; Tomás Dvorák; Petr Gregor; Riste Skrekovski (Eur. J. Comb., 2013)

On Verification of Workflow and Planning Domain Models Using Attribute Grammars. - Roman Barták; Tomás Dvorák (MICAI (1), 2016)

Matchings of quadratic size extend to long cycles in hypercubes. - Tomás Dvorák (Discret. Math. Theor. Comput. Sci., 2016)

Online Work Habits and Academic Performance. - Tomás Dvorák; Miaoqing Jia (J. Learn. Anal., 2016)

Generalized Gray codes with prescribed ends of small dimensions. - Tomás Dvorák; Václav Koubek (CoRR, 2017)

Towards a problem of Ruskey and Savage on matching extendability. - Jirí Fink; Tomás Dvorák; Petr Gregor; Tomás Novotný (Electron. Notes Discret. Math., 2017)

Generalized Gray codes with prescribed ends. - Tomás Dvorák; Petr Gregor; Václav Koubek (Theor. Comput. Sci., 2017)

Neighbor connectivity of k-ary n-cubes. - Tomás Dvorák; Mei-Mei Gu (CoRR, 2019)

Gray codes extending quadratic matchings. - Tomás Dvorák; Jirí Fink (J. Graph Theory, 2019)

Neighbor connectivity of k-ary n-cubes. - Tomás Dvorák; Mei-Mei Gu (Appl. Math. Comput., 2020)

Interactive 3D models: Documenting and presenting restoration and use of heritage objects. - Sven Ubik; Jirí Kubista; Tomás Dvorák (Digit. Appl. Archaeol. Cult. Heritage, 2022)

Presentation of Historical Clothing Digital Replicas in Motion. - Tomás Dvorák; Jirí Kubista; Oldrich Linhart; Ivo Malý; David Sedlácek; Sven Ubik (IEEE Access, 2024)

Paired 2-disjoint path covers of burnt pancake graphs with faulty elements. - Tomás Dvorák; Mei-Mei Gu (Theor. Comput. Sci., 2024)