Petr Gregor

Namrata

Eur. J. Comb., 2024

Packing coloring of hypercubes with extended Hamming codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Generating All Invertible Matrices by Row Operations.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

2023

Star transposition Gray codes for multiset permutations.

[BibT_eX]

[DOI]

Arturo Merino

J. Graph Theory, June, 2023

On the central levels problem.

[BibT_eX]

[DOI]

Ondrej Micka

J. Comb. Theory B, May, 2023

Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections.

[BibT_eX]

[DOI]

Namrata

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

Gray codes and symmetric chains.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

The Hamilton Compression of Highly Symmetric Graphs.

[BibT_eX]

[DOI]

Arturo Merino

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2020

Redundant binary representations with rigorous trade-off between connectivity and locality.

[BibT_eX]

[DOI]

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2018

Trimming and gluing Gray codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Broadcasting multiple messages in the 1-in port model in optimal time.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Extending Perfect Matchings to Gray Codes with Prescribed Ends.

[BibT_eX]

[DOI]

Tomás Novotný

Electron. J. Comb., 2018

Modelling simultaneous broadcasting by level-disjoint partitions.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

Quest for Good Spanners of Hypercubes.

[BibT_eX]

[DOI]

David Kubon

Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

2017

Generalized Gray codes with prescribed ends.

[BibT_eX]

[DOI]

Václav Koubek

Theor. Comput. Sci., 2017

Note on incidence chromatic number of subquartic graphs.

[BibT_eX]

[DOI]

Borut Luzar

Roman Soták

J. Comb. Optim., 2017

Towards a problem of Ruskey and Savage on matching extendability.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

A short proof of the middle levels theorem.

[BibT_eX]

[DOI]

Jerri Nummenpalo

CoRR, 2017

2016

Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs.

[BibT_eX]

[DOI]

David Pegrímek

Graphs Comb., 2016

On incidence coloring conjecture in Cartesian products of graphs.

[BibT_eX]

[DOI]

Borut Luzar

Roman Soták

Discret. Appl. Math., 2016

Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Rooted level-disjoint partitions of Cartesian products.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2015

2014

Linear extension diameter of level induced subposets of the Boolean lattice.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

2013

On the mutually independent Hamiltonian cycles in faulty hypercubes.

[BibT_eX]

[DOI]

Inf. Sci., 2013

Edge-fault-tolerant hamiltonicity of augmented cubes.

[BibT_eX]

[DOI]

Krystof Mekuta

Electron. Notes Discret. Math., 2013

Distance magic labelings of hypercubes.

[BibT_eX]

[DOI]

Petr Kovár

Electron. Notes Discret. Math., 2013

Linear time construction of a compressed Gray code.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

2012

Queue Layouts of Hypercubes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Testing connectivity of faulty networks in sublinear time.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Long cycles in hypercubes with optimal number of faulty vertices.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Parity vertex colorings of binomial trees.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2012

Gray codes with bounded weights.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

On the queue-number of the hypercube.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Linear extension diameter of subposets of Boolean lattice induced by two levels.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

On generalized middle-level problem.

[BibT_eX]

[DOI]

Inf. 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 and cycles in hypercubes with faulty vertices.

[BibT_eX]

[DOI]

Inf. Sci., 2009

Hypercube 1-factorizations from extended Hamming codes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Long cycles in hypercubes with distant faulty vertices.

[BibT_eX]

[DOI]

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

Gray Codes Avoiding Matchings.

[BibT_eX]

[DOI]

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

Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 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

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

2006

Recursive fault-tolerance of Fibonacci cube in hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2006

2000

Embedding Fibonacci Cubes into Hypercubes with Omega(2cn) Faulty Nodes.

[BibT_eX]

[DOI]

Rostislav Caha