default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomás Dvorák
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]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: 13310-13326 (2024)- [j27]Tomás Dvorák, Mei-Mei Gu:
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements. Theor. Comput. Sci. 986: 114327 (2024) - 2023
- [i5]Tomás Dvorák, Mei-Mei Gu:
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements. CoRR abs/2310.18831 (2023) - 2022
- [j26]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: 00246 (2022) - 2020
- [j25]Tomás Dvorák, Mei-Mei Gu:
Neighbor connectivity of k-ary n-cubes. Appl. Math. Comput. 379: 125237 (2020)
2010 – 2019
- 2019
- [j24]Tomás Dvorák, Jirí Fink:
Gray codes extending quadratic matchings. J. Graph Theory 90(2): 123-136 (2019) - [i4]Tomás Dvorák, Mei-Mei Gu:
Neighbor connectivity of k-ary n-cubes. CoRR abs/1910.12364 (2019) - 2017
- [j23]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: 437-443 (2017) - [j22]Tomás Dvorák, Petr Gregor, Václav Koubek:
Generalized Gray codes with prescribed ends. Theor. Comput. Sci. 668: 70-94 (2017) - [i3]Tomás Dvorák, Václav Koubek:
Generalized Gray codes with prescribed ends of small dimensions. CoRR abs/1701.06705 (2017) - 2016
- [j21]Tomás Dvorák:
Matchings of quadratic size extend to long cycles in hypercubes. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j20]Tomás Dvorák, Miaoqing Jia:
Online Work Habits and Academic Performance. J. Learn. Anal. 3(3): 318-330 (2016) - [c4]Roman Barták, Tomás Dvorák:
On Verification of Workflow and Planning Domain Models Using Attribute Grammars. MICAI (1) 2016: 332-345 - [i2]Tomás Dvorák, Petr Gregor, Václav Koubek:
Generalized Gray codes with prescribed ends. CoRR abs/1603.08827 (2016) - 2015
- [i1]Tomás Dvorák:
Matchings of quadratic size extend to long cycles in hypercubes. CoRR abs/1511.06568 (2015) - 2013
- [j19]Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Linear time construction of a compressed Gray code. Eur. J. Comb. 34(1): 69-81 (2013) - 2012
- [j18]Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek:
Gray codes with bounded weights. Discret. Math. 312(17): 2599-2611 (2012) - [j17]Martin Senft, Tomás Dvorák:
On-line suffix tree construction with reduced branching. J. Discrete Algorithms 12: 48-60 (2012) - [j16]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: 223-231 (2012) - 2010
- [j15]Tomás Dvorák, Václav Koubek:
Computational complexity of long paths and cycles in faulty hypercubes. Theor. Comput. Sci. 411(40-42): 3774-3786 (2010) - [c3]Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik:
Efficient Connectivity Testing of Hypercubic Networks with Faults. IWOCA 2010: 181-191
2000 – 2009
- 2009
- [j14]Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Gray Codes Avoiding Matchings. Discret. Math. Theor. Comput. Sci. 11(2): 123-148 (2009) - [j13]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: 35-39 (2009) - [j12]Tomás Dvorák, Václav Koubek:
Long paths in hypercubes with a quadratic number of faults. Inf. Sci. 179(21): 3763-3771 (2009) - [c2]Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Gray Code Compression. IWOCA 2009: 183-193 - 2008
- [j11]Petr Gregor, Tomás Dvorák:
Path partitions of hypercubes. Inf. Process. Lett. 108(6): 402-406 (2008) - [j10]Tomás Dvorák, Petr Gregor:
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices. SIAM J. Discret. Math. 22(4): 1448-1461 (2008) - [c1]Martin Senft, Tomás Dvorák:
Sliding CDAWG Perfection. SPIRE 2008: 109-120 - 2007
- [j9]Tomás Dvorák:
Dense sets and embedding binary trees into hypercubes. Discret. Appl. Math. 155(4): 506-514 (2007) - [j8]Tomás Dvorák, Petr Gregor:
Hamiltonian paths with prescribed edges in hypercubes. Discret. Math. 307(16): 1982-1998 (2007) - [j7]Tomás Dvorák, Petr Gregor:
Hamiltonian fault-tolerance of hypercubes. Electron. Notes Discret. Math. 29: 471-477 (2007) - 2005
- [j6]Tomás Dvorák:
Hamiltonian Cycles with Prescribed Edges in Hypercubes. SIAM J. Discret. Math. 19(1): 135-144 (2005) - 2003
- [j5]Tomás Dvorák, Ivan Havel, Michel Mollard:
On paths and cycles dominating hypercubes. Discret. Math. 262(1-3): 121-129 (2003) - 2000
- [j4]Tomás Dvorák:
Chromatic Index of Hypergraphs and Shannon's Theorem. Eur. J. Comb. 21(5): 585-591 (2000)
1990 – 1999
- 1999
- [j3]Tomás Dvorák, Ivan Havel, Petr Liebl:
Euler Cycles in K2m Plus Perfect Matching. Eur. J. Comb. 20(3): 227-232 (1999) - 1997
- [j2]Tomás Dvorák, Ivan Havel, Petr Liebl:
Euler cycles in the complete graph K2m+1. Discret. Math. 171(1-3): 89-102 (1997) - [j1]Tomás Dvorák, Ivan Havel, Jean-Marie Laborde, Michel Mollard:
Spanning caterpillars of a hypercube. J. Graph Theory 24(1): 9-19 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
