Tomás Dvorák

Mei-Mei Gu

Theor. Comput. Sci., February, 2024

Presentation of Historical Clothing Digital Replicas in Motion.

[BibT_eX]

[DOI]

IEEE Access, 2024

2022

Interactive 3D models: Documenting and presenting restoration and use of heritage objects.

[BibT_eX]

[DOI]

Sven Ubik

Jirí Kubista

Digit. Appl. Archaeol. Cult. Heritage, 2022

2020

Neighbor connectivity of k-ary n-cubes.

[BibT_eX]

[DOI]

Mei-Mei Gu

Appl. Math. Comput., 2020

2019

Gray codes extending quadratic matchings.

[BibT_eX]

[DOI]

Jirí Fink

J. Graph Theory, 2019

Neighbor connectivity of k-ary n-cubes.

[BibT_eX]

[DOI]

Mei-Mei Gu

CoRR, 2019

2017

Generalized Gray codes with prescribed ends.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Towards a problem of Ruskey and Savage on matching extendability.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Generalized Gray codes with prescribed ends of small dimensions.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Online Work Habits and Academic Performance.

[BibT_eX]

[DOI]

Miaoqing Jia

J. Learn. Anal., December, 2016

Matchings of quadratic size extend to long cycles in hypercubes.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

On Verification of Workflow and Planning Domain Models Using Attribute Grammars.

[BibT_eX]

[DOI]

Roman Barták

Proceedings of the Advances in Computational Intelligence, 2016

2013

Linear time construction of a compressed Gray code.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

2012

On-line suffix tree construction with reduced branching.

[BibT_eX]

[DOI]

Martin Senft

J. Discrete Algorithms, 2012

Testing connectivity of faulty networks in sublinear time.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Gray codes with bounded weights.

[BibT_eX]

[DOI]

Discret. Math., 2012

2010

Computational complexity of long paths and cycles in faulty hypercubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Efficient Connectivity Testing of Hypercubic Networks with Faults.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Long paths in hypercubes with a quadratic number of faults.

[BibT_eX]

[DOI]

Inf. Sci., 2009

Long paths and cycles in faulty hypercubes: existence, optimality, complexity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Gray Codes Avoiding Matchings.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2009

Gray Code Compression.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Path partitions of hypercubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Sliding CDAWG Perfection.

[BibT_eX]

[DOI]

Martin Senft

Proceedings of the String Processing and Information Retrieval, 2008

2007

Hamiltonian fault-tolerance of hypercubes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Hamiltonian paths with prescribed edges in hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2007

Dense sets and embedding binary trees into hypercubes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2005

Hamiltonian Cycles with Prescribed Edges in Hypercubes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

2003

On paths and cycles dominating hypercubes.

[BibT_eX]

[DOI]

Ivan Havel

Michel Mollard

Discret. Math., 2003

2000

Chromatic Index of Hypergraphs and Shannon's Theorem.

[BibT_eX]

[DOI]

Eur. J. Comb., 2000

1999

Euler Cycles in K2m Plus Perfect Matching.

[BibT_eX]

[DOI]

Ivan Havel

Petr Liebl

Eur. J. Comb., 1999

1997

Spanning caterpillars of a hypercube.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

Euler cycles in the complete graph K2m+1.

[BibT_eX]

[DOI]