According to our database
1,
Petr Gregor
authored at least 48 papers
between 2000 and 2023.
Collaborative distances:
2023
Star transposition Gray codes for multiset permutations.
J. Graph Theory, June, 2023
On the central levels problem.
J. Comb. Theory, Ser. B, May, 2023
Packing coloring of hypercubes with extended Hamming codes.
CoRR, 2023
Combinatorial generation via permutation languages. VI. Binary trees.
CoRR, 2023
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023
2022
Gray codes and symmetric chains.
J. Comb. Theory, Ser. B, 2022
The Hamilton Compression of Highly Symmetric Graphs.
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.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020
2018
Trimming and gluing Gray codes.
Theor. Comput. Sci., 2018
Broadcasting multiple messages in the 1-in port model in optimal time.
J. Comb. Optim., 2018
Extending Perfect Matchings to Gray Codes with Prescribed Ends.
Electron. J. Comb., 2018
Modelling simultaneous broadcasting by level-disjoint partitions.
Appl. Math. Comput., 2018
Quest for Good Spanners of Hypercubes.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018
2017
Generalized Gray codes with prescribed ends.
Theor. Comput. Sci., 2017
Note on incidence chromatic number of subquartic graphs.
J. Comb. Optim., 2017
Towards a problem of Ruskey and Savage on matching extendability.
Electron. Notes Discret. Math., 2017
A short proof of the middle levels theorem.
CoRR, 2017
2016
Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs.
Graphs Comb., 2016
On incidence coloring conjecture in Cartesian products of graphs.
Discret. Appl. Math., 2016
Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model.
Proceedings of the Combinatorial Optimization and Applications, 2016
2015
Rooted level-disjoint partitions of Cartesian products.
Appl. Math. Comput., 2015
2014
Linear extension diameter of level induced subposets of the Boolean lattice.
Eur. J. Comb., 2014
2013
On the mutually independent Hamiltonian cycles in faulty hypercubes.
Inf. Sci., 2013
Edge-fault-tolerant hamiltonicity of augmented cubes.
Electron. Notes Discret. Math., 2013
Distance magic labelings of hypercubes.
Electron. Notes Discret. Math., 2013
Linear time construction of a compressed Gray code.
Eur. J. Comb., 2013
2012
Queue Layouts of Hypercubes.
SIAM J. Discret. Math., 2012
Testing connectivity of faulty networks in sublinear time.
J. Discrete Algorithms, 2012
Long cycles in hypercubes with optimal number of faulty vertices.
J. Comb. Optim., 2012
Parity vertex colorings of binomial trees.
Discuss. Math. Graph Theory, 2012
Gray codes with bounded weights.
Discret. Math., 2012
2011
On the queue-number of the hypercube.
Electron. Notes Discret. Math., 2011
Linear extension diameter of subposets of Boolean lattice induced by two levels.
Electron. Notes Discret. Math., 2011
2010
On generalized middle-level problem.
Inf. Sci., 2010
Efficient Connectivity Testing of Hypercubic Networks with Faults.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010
2009
Long paths and cycles in hypercubes with faulty vertices.
Inf. Sci., 2009
Hypercube 1-factorizations from extended Hamming codes.
Electron. Notes Discret. Math., 2009
Long paths and cycles in faulty hypercubes: existence, optimality, complexity.
Electron. Notes Discret. Math., 2009
Long cycles in hypercubes with distant faulty vertices.
Discret. Math. Theor. Comput. Sci., 2009
Gray Codes Avoiding Matchings.
Discret. Math. Theor. Comput. Sci., 2009
Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes.
Discret. Math., 2009
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
2007
Hamiltonian fault-tolerance of hypercubes.
Electron. Notes Discret. Math., 2007
Hamiltonian paths with prescribed edges in hypercubes.
Discret. Math., 2007
2006
Recursive fault-tolerance of Fibonacci cube in hypercubes.
Discret. Math., 2006
2000
Embedding Fibonacci Cubes into Hypercubes with <i>Omega</i>(2<sup><i>cn</i></sup>) Faulty Nodes.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
