Petr Gregor

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 34

Top Topics

Complete Axiomatization

Levels Of Abstraction

Error Correcting Codes

Top Venues

J. Comb. Optim.

Appl. Math. Comput.

Theor. Comput. Sci.

Publications

Petr Gregor, Torsten Mütze, Namrata
Combinatorial generation via permutation languages. VI. Binary trees. Eur. J. Comb. 122 (2024)
Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel
Packing coloring of hypercubes with extended Hamming codes. Discret. Appl. Math. 359 (2024)
Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel
Packing coloring of hypercubes with extended Hamming codes. CoRR (2023)
Petr Gregor, Torsten Mütze, Namrata
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. ISAAC (2023)
Petr Gregor, Ondrej Micka, Torsten Mütze
On the central levels problem. J. Comb. Theory, Ser. B 160 (2023)
Petr Gregor, Arturo I. Merino, Torsten Mütze
Star transposition Gray codes for multiset permutations. J. Graph Theory 103 (2) (2023)
Petr Gregor, Torsten Mütze, Namrata
Combinatorial generation via permutation languages. VI. Binary trees. CoRR (2023)
Petr Gregor, Arturo I. Merino, Torsten Mütze
The Hamilton compression of highly symmetric graphs. CoRR (2022)
Petr Gregor, Torsten Mütze, Arturo I. Merino
Star Transposition Gray Codes for Multiset Permutations. STACS (2022)
Petr Gregor, Arturo I. Merino, Torsten Mütze
The Hamilton Compression of Highly Symmetric Graphs. MFCS (2022)
Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
Gray codes and symmetric chains. J. Comb. Theory, Ser. B 153 (2022)
Petr Gregor, Arturo I. Merino, Torsten Mütze
Star transposition Gray codes for multiset permutations. CoRR (2021)
Vida Vukasinovic, David Kubon, Riste Skrekovski, Petr Gregor
Redundant binary representations with rigorous trade-off between connectivity and locality. GECCO Companion (2020)
Petr Gregor, Ondrej Micka, Torsten Mütze
On the Central Levels Problem. ICALP (2020)
Petr Gregor, Ondrej Micka, Torsten Mütze
On the central levels problem. CoRR (2019)
Petr Gregor, Torsten Mütze
Trimming and gluing Gray codes. Theor. Comput. Sci. 714 (2018)
Petr Gregor, Riste Skrekovski, Vida Vukasinovic
Modelling simultaneous broadcasting by level-disjoint partitions. Appl. Math. Comput. 325 (2018)
Petr Gregor, Tomás Novotný, Riste Skrekovski
Extending Perfect Matchings to Gray Codes with Prescribed Ends. Electron. J. Comb. 25 (2) (2018)
Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
Gray Codes and Symmetric Chains. ICALP (2018)
Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
Gray codes and symmetric chains. CoRR (2018)
David Kubon, Petr Gregor
Quest for Good Spanners of Hypercubes. CEC (2018)
Petr Gregor, Riste Skrekovski, Vida Vukasinovic
Broadcasting multiple messages in the 1-in port model in optimal time. J. Comb. Optim. 36 (4) (2018)
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 (2017)
Petr Gregor, Torsten Mütze
Trimming and Gluing Gray Codes. STACS (2017)
Tomás Dvorák, Petr Gregor, Václav Koubek
Generalized Gray codes with prescribed ends. Theor. Comput. Sci. 668 (2017)
Petr Gregor, Torsten Mütze, Jerri Nummenpalo
A short proof of the middle levels theorem. CoRR (2017)
Petr Gregor, Borut Luzar, Roman Soták
Note on incidence chromatic number of subquartic graphs. J. Comb. Optim. 34 (1) (2017)
Petr Gregor, Riste Skrekovski, Vida Vukasinovic
Modelling simultaneous broadcasting by level-disjoint partitions. CoRR (2016)
Petr Gregor, Riste Skrekovski, Vida Vukasinovic
Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model. COCOA (2016)
Petr Gregor, Torsten Mütze
Trimming and gluing Gray codes. CoRR (2016)
Tomás Dvorák, Petr Gregor, Václav Koubek
Generalized Gray codes with prescribed ends. CoRR (2016)
Petr Gregor, Borut Luzar, Roman Soták
On incidence coloring conjecture in Cartesian products of graphs. Discret. Appl. Math. 213 (2016)
David Pegrímek, Petr Gregor
Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs. Graphs Comb. 32 (6) (2016)
Petr Gregor, Riste Skrekovski, Vida Vukasinovic
Rooted level-disjoint partitions of Cartesian products. Appl. Math. Comput. 266 (2015)
Jirí Fink, Petr Gregor
Linear extension diameter of level induced subposets of the Boolean lattice. Eur. J. Comb. 35 (2014)
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
Linear time construction of a compressed Gray code. Eur. J. Comb. 34 (1) (2013)
Vida Vukasinovic, Petr Gregor, Riste Skrekovski
On the mutually independent Hamiltonian cycles in faulty hypercubes. Inf. Sci. 236 (2013)
Krystof Mekuta, Petr Gregor
Edge-fault-tolerant hamiltonicity of augmented cubes. Electron. Notes Discret. Math. 40 (2013)
Petr Gregor, Petr Kovár
Distance magic labelings of hypercubes. Electron. Notes Discret. Math. 40 (2013)
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek
Gray codes with bounded weights. Discret. Math. 312 (17) (2012)
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 (2012)
Petr Gregor, Riste Skrekovski, Vida Vukasinovic
Queue Layouts of Hypercubes. SIAM J. Discret. Math. 26 (1) (2012)
Jirí Fink, Petr Gregor
Long cycles in hypercubes with optimal number of faulty vertices. J. Comb. Optim. 24 (3) (2012)
Petr Gregor, Riste Skrekovski
Parity vertex colorings of binomial trees. Discuss. Math. Graph Theory 32 (1) (2012)
Petr Gregor, Riste Skrekovski, Vida Vukasinovic
On the queue-number of the hypercube. Electron. Notes Discret. Math. 38 (2011)
Jirí Fink, Petr Gregor
Linear extension diameter of subposets of Boolean lattice induced by two levels. Electron. Notes Discret. Math. 38 (2011)
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
Efficient Connectivity Testing of Hypercubic Networks with Faults. IWOCA (2010)
Petr Gregor, Riste Skrekovski
On generalized middle-level problem. Inf. Sci. 180 (12) (2010)
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
Gray Codes Avoiding Matchings. Discret. Math. Theor. Comput. Sci. 11 (2) (2009)
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 (2009)
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
Gray Code Compression. IWOCA (2009)
Jirí Fink, Petr Gregor
Long paths and cycles in hypercubes with faulty vertices. Inf. Sci. 179 (20) (2009)
Petr Gregor
Hypercube 1-factorizations from extended Hamming codes. Electron. Notes Discret. Math. 34 (2009)
Petr Gregor
Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes. Discret. Math. 309 (6) (2009)
Petr Gregor, Riste Skrekovski
Long cycles in hypercubes with distant faulty vertices. Discret. Math. Theor. Comput. Sci. 11 (1) (2009)
Tomás Dvorák, Petr Gregor
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices. SIAM J. Discret. Math. 22 (4) (2008)
Petr Gregor, Tomás Dvorák
Path partitions of hypercubes. Inf. Process. Lett. 108 (6) (2008)
Tomás Dvorák, Petr Gregor
Hamiltonian paths with prescribed edges in hypercubes. Discret. Math. 307 (16) (2007)
Tomás Dvorák, Petr Gregor
Hamiltonian fault-tolerance of hypercubes. Electron. Notes Discret. Math. 29 (2007)
Petr Gregor
Recursive fault-tolerance of Fibonacci cube in hypercubes. Discret. Math. 306 (13) (2006)
Rostislav Caha, Petr Gregor
) Faulty Nodes. MFCS (2000)