default search action
Petr Gregor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j39]Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel:
Packing coloring of hypercubes with extended Hamming codes. Discret. Appl. Math. 359: 269-277 (2024) - [j38]Petr Gregor, Torsten Mütze, Namrata:
Combinatorial generation via permutation languages. VI. Binary trees. Eur. J. Comb. 122: 104020 (2024) - [c13]Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka:
Generating All Invertible Matrices by Row Operations. ISAAC 2024: 35:1-35:14 - 2023
- [j37]Petr Gregor
, Ondrej Micka
On the central levels problem. J. Comb. Theory B 160: 163-205 (2023) - [j36]Petr Gregor
Star transposition Gray codes for multiset permutations. J. Graph Theory 103(2): 212-270 (2023) - [c12]Petr Gregor, Torsten Mütze, Namrata:
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. ISAAC 2023: 33:1-33:19 - [i10]Petr Gregor, Torsten Mütze, Namrata:
Combinatorial generation via permutation languages. VI. Binary trees. CoRR abs/2306.08420 (2023) - [i9]Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel:
Packing coloring of hypercubes with extended Hamming codes. CoRR abs/2312.14576 (2023) - 2022
- [j35]Petr Gregor
Gray codes and symmetric chains. J. Comb. Theory B 153: 31-60 (2022) - [c11]Petr Gregor
The Hamilton Compression of Highly Symmetric Graphs. MFCS 2022: 54:1-54:14 - [c10]Petr Gregor
Star Transposition Gray Codes for Multiset Permutations. STACS 2022: 34:1-34:14 - [i8]Petr Gregor
The Hamilton compression of highly symmetric graphs. CoRR abs/2205.08126 (2022) - 2021
- [i7]Petr Gregor, Arturo Merino
Star transposition Gray codes for multiset permutations. CoRR abs/2108.07465 (2021) - 2020
- [c9]Vida Vukasinovic, David Kubon
Redundant binary representations with rigorous trade-off between connectivity and locality. GECCO Companion 2020: 325-326 - [c8]Petr Gregor
On the Central Levels Problem. ICALP 2020: 60:1-60:17
2010 – 2019
- 2019
- [i6]Petr Gregor, Ondrej Micka, Torsten Mütze:
On the central levels problem. CoRR abs/1912.01566 (2019) - 2018
- [j34]Petr Gregor
Modelling simultaneous broadcasting by level-disjoint partitions. Appl. Math. Comput. 325: 15-23 (2018) - [j33]Petr Gregor
Extending Perfect Matchings to Gray Codes with Prescribed Ends. Electron. J. Comb. 25(2): 2 (2018) - [j32]Petr Gregor
Broadcasting multiple messages in the 1-in port model in optimal time. J. Comb. Optim. 36(4): 1333-1355 (2018) - [j31]Petr Gregor
Trimming and gluing Gray codes. Theor. Comput. Sci. 714: 74-95 (2018) - [c7]David Kubon
Quest for Good Spanners of Hypercubes. CEC 2018: 1-8 - [c6]Petr Gregor
Gray Codes and Symmetric Chains. ICALP 2018: 66:1-66:14 - [i5]Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille:
Gray codes and symmetric chains. CoRR abs/1802.06021 (2018) - 2017
- [j30]Jirí Fink
Towards a problem of Ruskey and Savage on matching extendability. Electron. Notes Discret. Math. 61: 437-443 (2017) - [j29]Petr Gregor
Note on incidence chromatic number of subquartic graphs. J. Comb. Optim. 34(1): 174-181 (2017) - [j28]Tomás Dvorák
Generalized Gray codes with prescribed ends. Theor. Comput. Sci. 668: 70-94 (2017) - [c5]Petr Gregor
Trimming and Gluing Gray Codes. STACS 2017: 40:1-40:14 - [i4]Petr Gregor, Torsten Mütze, Jerri Nummenpalo:
A short proof of the middle levels theorem. CoRR abs/1710.08249 (2017) - 2016
- [j27]Petr Gregor
On incidence coloring conjecture in Cartesian products of graphs. Discret. Appl. Math. 213: 93-100 (2016) - [j26]David Pegrímek, Petr Gregor
Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs. Graphs Comb. 32(6): 2591-2624 (2016) - [c4]Petr Gregor
Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model. COCOA 2016: 144-158 - [i3]Tomás Dvorák, Petr Gregor, Václav Koubek:
Generalized Gray codes with prescribed ends. CoRR abs/1603.08827 (2016) - [i2]Petr Gregor, Torsten Mütze:
Trimming and gluing Gray codes. CoRR abs/1607.08806 (2016) - [i1]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Modelling simultaneous broadcasting by level-disjoint partitions. CoRR abs/1609.01116 (2016) - 2015
- [j25]Petr Gregor
Rooted level-disjoint partitions of Cartesian products. Appl. Math. Comput. 266: 244-258 (2015) - 2014
- [j24]Jirí Fink
Linear extension diameter of level induced subposets of the Boolean lattice. Eur. J. Comb. 35: 221-231 (2014) - 2013
- [j23]Darko Dimitrov, Tomás Dvorák
Linear time construction of a compressed Gray code. Eur. J. Comb. 34(1): 69-81 (2013) - [j22]Petr Gregor
Distance magic labelings of hypercubes. Electron. Notes Discret. Math. 40: 145-149 (2013) - [j21]Krystof Mekuta, Petr Gregor
Edge-fault-tolerant hamiltonicity of augmented cubes. Electron. Notes Discret. Math. 40: 239-243 (2013) - [j20]Vida Vukasinovic
On the mutually independent Hamiltonian cycles in faulty hypercubes. Inf. Sci. 236: 224-235 (2013) - 2012
- [j19]Tomás Dvorák
Gray codes with bounded weights. Discret. Math. 312(17): 2599-2611 (2012) - [j18]Petr Gregor, Riste Skrekovski
Parity vertex colorings of binomial trees. Discuss. Math. Graph Theory 32(1): 177-180 (2012) - [j17]Jirí Fink
Long cycles in hypercubes with optimal number of faulty vertices. J. Comb. Optim. 24(3): 240-265 (2012) - [j16]Tomás Dvorák
Testing connectivity of faulty networks in sublinear time. J. Discrete Algorithms 14: 223-231 (2012) - [j15]Petr Gregor
Queue Layouts of Hypercubes. SIAM J. Discret. Math. 26(1): 77-88 (2012) - 2011
- [j14]Jirí Fink
Linear extension diameter of subposets of Boolean lattice induced by two levels. Electron. Notes Discret. Math. 38: 337-342 (2011) - [j13]Petr Gregor
On the queue-number of the hypercube. Electron. Notes Discret. Math. 38: 413-418 (2011) - 2010
- [j12]Petr Gregor
On generalized middle-level problem. Inf. Sci. 180(12): 2448-2457 (2010) - [c3]Tomás Dvorák
Efficient Connectivity Testing of Hypercubic Networks with Faults. IWOCA 2010: 181-191
2000 – 2009
- 2009
- [j11]Petr Gregor
Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes. Discret. Math. 309(6): 1711-1713 (2009) - [j10]Petr Gregor
Long cycles in hypercubes with distant faulty vertices. Discret. Math. Theor. Comput. Sci. 11(1): 187-200 (2009) - [j9]Darko Dimitrov, Tomás Dvorák
Gray Codes Avoiding Matchings. Discret. Math. Theor. Comput. Sci. 11(2): 123-148 (2009) - [j8]Tomás Dvorák
Long paths and cycles in faulty hypercubes: existence, optimality, complexity. Electron. Notes Discret. Math. 34: 35-39 (2009) - [j7]Petr Gregor
Hypercube 1-factorizations from extended Hamming codes. Electron. Notes Discret. Math. 34: 627-631 (2009) - [j6]Jirí Fink
Long paths and cycles in hypercubes with faulty vertices. Inf. Sci. 179(20): 3634-3644 (2009) - [c2]Darko Dimitrov, Tomás Dvorák
Gray Code Compression. IWOCA 2009: 183-193 - 2008
- [j5]Petr Gregor
Path partitions of hypercubes. Inf. Process. Lett. 108(6): 402-406 (2008) - [j4]Tomás Dvorák
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices. SIAM J. Discret. Math. 22(4): 1448-1461 (2008) - 2007
- [j3]Tomás Dvorák
Hamiltonian paths with prescribed edges in hypercubes. Discret. Math. 307(16): 1982-1998 (2007) - [j2]Tomás Dvorák
Hamiltonian fault-tolerance of hypercubes. Electron. Notes Discret. Math. 29: 471-477 (2007) - 2006
- [j1]Petr Gregor
Recursive fault-tolerance of Fibonacci cube in hypercubes. Discret. Math. 306(13): 1327-1341 (2006) - 2000
- [c1]Rostislav Caha, Petr Gregor
Embedding Fibonacci Cubes into Hypercubes with Omega(2cn) Faulty Nodes. MFCS 2000: 253-263
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: