Tomás Dvorák

According to our database1, Tomás Dvorák authored at least 30 papers between 1997 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Neighbor connectivity of <i>k</i>-ary <i>n</i>-cubes.
Appl. Math. Comput., 2020

2019
Gray codes extending quadratic matchings.
J. Graph Theory, 2019

Neighbor connectivity of k-ary n-cubes.
CoRR, 2019

2017
Generalized Gray codes with prescribed ends.
Theor. Comput. Sci., 2017

Towards a problem of Ruskey and Savage on matching extendability.
Electron. Notes Discret. Math., 2017

Generalized Gray codes with prescribed ends of small dimensions.
CoRR, 2017

2016
Matchings of quadratic size extend to long cycles in hypercubes.
Discret. Math. Theor. Comput. Sci., 2016

On Verification of Workflow and Planning Domain Models Using Attribute Grammars.
Proceedings of the Advances in Computational Intelligence, 2016

2013
Linear time construction of a compressed Gray code.
Eur. J. Comb., 2013

2012
On-line suffix tree construction with reduced branching.
J. Discrete Algorithms, 2012

Testing connectivity of faulty networks in sublinear time.
J. Discrete Algorithms, 2012

Gray codes with bounded weights.
Discret. Math., 2012

2010
Computational complexity of long paths and cycles in faulty hypercubes.
Theor. Comput. Sci., 2010

Efficient Connectivity Testing of Hypercubic Networks with Faults.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
Long paths in hypercubes with a quadratic number of faults.
Inf. Sci., 2009

Long paths and cycles in faulty hypercubes: existence, optimality, complexity.
Electron. Notes Discret. Math., 2009

Gray Codes Avoiding Matchings.
Discret. Math. Theor. Comput. Sci., 2009

Gray Code Compression.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices.
SIAM J. Discret. Math., 2008

Path partitions of hypercubes.
Inf. Process. Lett., 2008

Sliding CDAWG Perfection.
Proceedings of the String Processing and Information Retrieval, 2008

2007
Hamiltonian fault-tolerance of hypercubes.
Electron. Notes Discret. Math., 2007

Hamiltonian paths with prescribed edges in hypercubes.
Discret. Math., 2007

Dense sets and embedding binary trees into hypercubes.
Discret. Appl. Math., 2007

2005
Hamiltonian Cycles with Prescribed Edges in Hypercubes.
SIAM J. Discret. Math., 2005

2003
On paths and cycles dominating hypercubes.
Discret. Math., 2003

2000
Chromatic Index of Hypergraphs and Shannon's Theorem.
Eur. J. Comb., 2000

1999
Euler Cycles in K<sub>2m</sub> Plus Perfect Matching.
Eur. J. Comb., 1999

1997
Spanning caterpillars of a hypercube.
J. Graph Theory, 1997

Euler cycles in the complete graph K<sub>2m+1</sub>.
Discret. Math., 1997


  Loading...