Tomás Dvorák

37 papers C 3Journal 33Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements.
Theor. Comput. Sci.
Tomás Dvorák, Mei-Mei Gu
2024 J jnl
Presentation of Historical Clothing Digital Replicas in Motion.
IEEE Access
Tomás Dvorák, Jirí Kubista, Oldrich Linhart, Ivo Malý, David Sedlácek, Sven Ubik
2023 J jnl
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements.
CoRR
Tomás Dvorák, Mei-Mei Gu
2022 J jnl
Interactive 3D models: Documenting and presenting restoration and use of heritage objects.
Digit. Appl. Archaeol. Cult. Heritage
Sven Ubik, Jirí Kubista, Tomás Dvorák
2020 J jnl
Neighbor connectivity of
Appl. Math. Comput.
Tomás Dvorák, Mei-Mei Gu
2019 J jnl
Gray codes extending quadratic matchings.
J. Graph Theory
Tomás Dvorák, Jirí Fink
2019 J jnl
Neighbor connectivity of k-ary n-cubes.
CoRR
Tomás Dvorák, Mei-Mei Gu
2017 J jnl
Generalized Gray codes with prescribed ends of small dimensions.
CoRR
Tomás Dvorák, Václav Koubek
2017 J jnl
Generalized Gray codes with prescribed ends.
Theor. Comput. Sci.
Tomás Dvorák, Petr Gregor, Václav Koubek
2017 J jnl
Towards a problem of Ruskey and Savage on matching extendability.
Electron. Notes Discret. Math.
Jirí Fink, Tomás Dvorák, Petr Gregor, Tomás Novotný
2016 J jnl
Generalized Gray codes with prescribed ends.
CoRR
Tomás Dvorák, Petr Gregor, Václav Koubek
2016 J jnl
Matchings of quadratic size extend to long cycles in hypercubes.
Discret. Math. Theor. Comput. Sci.
Tomás Dvorák
2016 — conf
On Verification of Workflow and Planning Domain Models Using Attribute Grammars.
MICAI (1)
Roman Barták, Tomás Dvorák
2016 J jnl
Online Work Habits and Academic Performance.
J. Learn. Anal.
Tomás Dvorák, Miaoqing Jia
2015 J jnl
Matchings of quadratic size extend to long cycles in hypercubes.
CoRR
Tomás Dvorák
2013 J jnl
Linear time construction of a compressed Gray code.
Eur. J. Comb.
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2012 J jnl
Gray codes with bounded weights.
Discret. Math.
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek
2012 J jnl
On-line suffix tree construction with reduced branching.
J. Discrete Algorithms
Martin Senft, Tomás Dvorák
2012 J jnl
Testing connectivity of faulty networks in sublinear time.
J. Discrete Algorithms
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
2010 J jnl
Computational complexity of long paths and cycles in faulty hypercubes.
Theor. Comput. Sci.
Tomás Dvorák, Václav Koubek
2010 C conf
Efficient Connectivity Testing of Hypercubic Networks with Faults.
IWOCA
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
2009 C conf
Gray Code Compression.
IWOCA
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2009 J jnl
Gray Codes Avoiding Matchings.
Discret. Math. Theor. Comput. Sci.
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2009 J jnl
Long paths and cycles in faulty hypercubes: existence, optimality, complexity.
Electron. Notes Discret. Math.
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek
2009 J jnl
Long paths in hypercubes with a quadratic number of faults.
Inf. Sci.
Tomás Dvorák, Václav Koubek
2008 J jnl
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices.
SIAM J. Discret. Math.
Tomás Dvorák, Petr Gregor
2008 J jnl
Path partitions of hypercubes.
Inf. Process. Lett.
Petr Gregor, Tomás Dvorák
2008 C conf
Sliding CDAWG Perfection.
SPIRE
Martin Senft, Tomás Dvorák
2007 J jnl
Dense sets and embedding binary trees into hypercubes.
Discret. Appl. Math.
Tomás Dvorák
2007 J jnl
Hamiltonian fault-tolerance of hypercubes.
Electron. Notes Discret. Math.
Tomás Dvorák, Petr Gregor
2007 J jnl
Hamiltonian paths with prescribed edges in hypercubes.
Discret. Math.
Tomás Dvorák, Petr Gregor
2005 J jnl
Hamiltonian Cycles with Prescribed Edges in Hypercubes.
SIAM J. Discret. Math.
Tomás Dvorák
2003 J jnl
On paths and cycles dominating hypercubes.
Discret. Math.
Tomás Dvorák, Ivan Havel, Michel Mollard
2000 J jnl
Chromatic Index of Hypergraphs and Shannon's Theorem.
Eur. J. Comb.
Tomás Dvorák
1999 J jnl
Euler Cycles in K
Eur. J. Comb.
Tomás Dvorák, Ivan Havel, Petr Liebl
1997 J jnl
Euler cycles in the complete graph K
Discret. Math.
Tomás Dvorák, Ivan Havel, Petr Liebl
1997 J jnl
Spanning caterpillars of a hypercube.
J. Graph Theory
Tomás Dvorák, Ivan Havel, Jean-Marie Laborde, Michel Mollard