Petr Gregor - RankMe

66 papers A* 2A 2B 5C 3Journal 53Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Generating all invertible matrices by row operations. Discret. Math. Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka
2026	J	`jnl`	Intermediate Results on the Complexity of STRIPS CoRR Stefan Edelkamp, Jirí Fink, Petr Gregor, Anders Jonsson, Bernhard Nebel
2025	J	`jnl`	Graphs that admit a Hamilton path are cup-stackable. Discret. Math. Petr Gregor, Arturo Merino, Torsten Mütze, Francesco Verciani
2025	J	`jnl`	On minimum Venn diagrams. CoRR Sofia Brenner, Petr Gregor, Torsten Mütze, Francesco Verciani
2024	J	`jnl`	Combinatorial generation via permutation languages. VI. Binary trees. Eur. J. Comb. Petr Gregor, Torsten Mütze, Namrata
2024	B	`conf`	Generating All Invertible Matrices by Row Operations. ISAAC Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka
2024	J	`jnl`	Packing coloring of hypercubes with extended Hamming codes. Discret. Appl. Math. Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel
2023	J	`jnl`	Combinatorial generation via permutation languages. VI. Binary trees. CoRR Petr Gregor, Torsten Mütze, Namrata
2023	J	`jnl`	On the central levels problem. J. Comb. Theory B Petr Gregor, Ondrej Micka, Torsten Mütze
2023	J	`jnl`	Packing coloring of hypercubes with extended Hamming codes. CoRR Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel
2023	B	`conf`	Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. ISAAC Petr Gregor, Torsten Mütze, Namrata
2023	J	`jnl`	Star transposition Gray codes for multiset permutations. J. Graph Theory Petr Gregor, Arturo Merino, Torsten Mütze
2022	J	`jnl`	Gray codes and symmetric chains. J. Comb. Theory B Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
2022	A	`conf`	Star Transposition Gray Codes for Multiset Permutations. STACS Petr Gregor, Torsten Mütze, Arturo Merino
2022	B	`conf`	The Hamilton Compression of Highly Symmetric Graphs. MFCS Petr Gregor, Arturo Merino, Torsten Mütze
2022	J	`jnl`	The Hamilton compression of highly symmetric graphs. CoRR Petr Gregor, Arturo Merino, Torsten Mütze
2021	J	`jnl`	Star transposition Gray codes for multiset permutations. CoRR Petr Gregor, Arturo Merino, Torsten Mütze
2020	A*	`conf`	On the Central Levels Problem. ICALP Petr Gregor, Ondrej Micka, Torsten Mütze
2020	—	`conf`	Redundant binary representations with rigorous trade-off between connectivity and locality. GECCO Companion Vida Vukasinovic, David Kubon, Riste Skrekovski, Petr Gregor
2019	J	`jnl`	On the central levels problem. CoRR Petr Gregor, Ondrej Micka, Torsten Mütze
2018	J	`jnl`	Broadcasting multiple messages in the 1-in port model in optimal time. J. Comb. Optim. Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2018	J	`jnl`	Extending Perfect Matchings to Gray Codes with Prescribed Ends. Electron. J. Comb. Petr Gregor, Tomás Novotný, Riste Skrekovski
2018	A*	`conf`	Gray Codes and Symmetric Chains. ICALP Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
2018	J	`jnl`	Gray codes and symmetric chains. CoRR Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
2018	J	`jnl`	Modelling simultaneous broadcasting by level-disjoint partitions. Appl. Math. Comput. Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2018	B	`conf`	Quest for Good Spanners of Hypercubes. CEC David Kubon, Petr Gregor
2018	J	`jnl`	Trimming and gluing Gray codes. Theor. Comput. Sci. Petr Gregor, Torsten Mütze
2017	J	`jnl`	A short proof of the middle levels theorem. CoRR Petr Gregor, Torsten Mütze, Jerri Nummenpalo
2017	J	`jnl`	Generalized Gray codes with prescribed ends. Theor. Comput. Sci. Tomás Dvorák, Petr Gregor, Václav Koubek
2017	J	`jnl`	Note on incidence chromatic number of subquartic graphs. J. Comb. Optim. Petr Gregor, Borut Luzar, Roman Soták
2017	J	`jnl`	Towards a problem of Ruskey and Savage on matching extendability. Electron. Notes Discret. Math. Jirí Fink, Tomás Dvorák, Petr Gregor, Tomás Novotný
2017	A	`conf`	Trimming and Gluing Gray Codes. STACS Petr Gregor, Torsten Mütze
2016	J	`jnl`	Generalized Gray codes with prescribed ends. CoRR Tomás Dvorák, Petr Gregor, Václav Koubek
2016	J	`jnl`	Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs. Graphs Comb. David Pegrímek, Petr Gregor
2016	J	`jnl`	Modelling simultaneous broadcasting by level-disjoint partitions. CoRR Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2016	J	`jnl`	On incidence coloring conjecture in Cartesian products of graphs. Discret. Appl. Math. Petr Gregor, Borut Luzar, Roman Soták
2016	C	`conf`	Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model. COCOA Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2016	J	`jnl`	Trimming and gluing Gray codes. CoRR Petr Gregor, Torsten Mütze
2015	J	`jnl`	Rooted level-disjoint partitions of Cartesian products. Appl. Math. Comput. Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2014	J	`jnl`	Linear extension diameter of level induced subposets of the Boolean lattice. Eur. J. Comb. Jirí Fink, Petr Gregor
2013	J	`jnl`	Distance magic labelings of hypercubes. Electron. Notes Discret. Math. Petr Gregor, Petr Kovár
2013	J	`jnl`	Edge-fault-tolerant hamiltonicity of augmented cubes. Electron. Notes Discret. Math. Krystof Mekuta, Petr Gregor
2013	J	`jnl`	Linear time construction of a compressed Gray code. Eur. J. Comb. Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2013	J	`jnl`	On the mutually independent Hamiltonian cycles in faulty hypercubes. Inf. Sci. Vida Vukasinovic, Petr Gregor, Riste Skrekovski
2012	J	`jnl`	Gray codes with bounded weights. Discret. Math. Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek
2012	J	`jnl`	Long cycles in hypercubes with optimal number of faulty vertices. J. Comb. Optim. Jirí Fink, Petr Gregor
2012	J	`jnl`	Parity vertex colorings of binomial trees. Discuss. Math. Graph Theory Petr Gregor, Riste Skrekovski
2012	J	`jnl`	Queue Layouts of Hypercubes. SIAM J. Discret. Math. Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2012	J	`jnl`	Testing connectivity of faulty networks in sublinear time. J. Discrete Algorithms Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
2011	J	`jnl`	Linear extension diameter of subposets of Boolean lattice induced by two levels. Electron. Notes Discret. Math. Jirí Fink, Petr Gregor
2011	J	`jnl`	On the queue-number of the hypercube. Electron. Notes Discret. Math. Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2010	C	`conf`	Efficient Connectivity Testing of Hypercubic Networks with Faults. IWOCA Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
2010	J	`jnl`	On generalized middle-level problem. Inf. Sci. Petr Gregor, Riste Skrekovski
2009	C	`conf`	Gray Code Compression. IWOCA Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2009	J	`jnl`	Gray Codes Avoiding Matchings. Discret. Math. Theor. Comput. Sci. Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2009	J	`jnl`	Hypercube 1-factorizations from extended Hamming codes. Electron. Notes Discret. Math. Petr Gregor
2009	J	`jnl`	Long cycles in hypercubes with distant faulty vertices. Discret. Math. Theor. Comput. Sci. Petr Gregor, Riste Skrekovski
2009	J	`jnl`	Long paths and cycles in faulty hypercubes: existence, optimality, complexity. Electron. Notes Discret. Math. Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek
2009	J	`jnl`	Long paths and cycles in hypercubes with faulty vertices. Inf. Sci. Jirí Fink, Petr Gregor
2009	J	`jnl`	Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes. Discret. Math. Petr Gregor
2008	J	`jnl`	Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices. SIAM J. Discret. Math. Tomás Dvorák, Petr Gregor
2008	J	`jnl`	Path partitions of hypercubes. Inf. Process. Lett. Petr Gregor, Tomás Dvorák
2007	J	`jnl`	Hamiltonian fault-tolerance of hypercubes. Electron. Notes Discret. Math. Tomás Dvorák, Petr Gregor
2007	J	`jnl`	Hamiltonian paths with prescribed edges in hypercubes. Discret. Math. Tomás Dvorák, Petr Gregor
2006	J	`jnl`	Recursive fault-tolerance of Fibonacci cube in hypercubes. Discret. Math. Petr Gregor
2000	B	`conf`	Embedding Fibonacci Cubes into Hypercubes with MFCS Rostislav Caha, Petr Gregor