Tomás Dvorák

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 14

Top Topics

Spline Interpolation

Error Correction

Top Venues

Theor. Comput. Sci.

J. Learn. Anal.

Publications

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