| 2024 | ISAAC | Generating All Invertible Matrices by Row Operations. | Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka |
| 2023 | ISAAC | Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. | Petr Gregor, Torsten Mtze, Namrata |
| 2022 | MFCS | The Hamilton Compression of Highly Symmetric Graphs. | Petr Gregor, Arturo Merino, Torsten Mtze |
| 2022 | STACS | Star Transposition Gray Codes for Multiset Permutations. | Petr Gregor, Torsten Mtze, Arturo Merino |
| 2020 | GECCO | Redundant binary representations with rigorous trade-off between connectivity and locality. | Vida Vukasinovic, David Kubon, Riste Skrekovski, Petr Gregor |
| 2020 | ICALP | On the Central Levels Problem. | Petr Gregor, Ondrej Micka, Torsten Mtze |
| 2018 | CEC | Quest for Good Spanners of Hypercubes. | David Kubon, Petr Gregor |
| 2018 | ICALP | Gray Codes and Symmetric Chains. | Petr Gregor, Sven Jger, Torsten Mtze, Joe Sawada, Kaja Wille |
| 2017 | STACS | Trimming and Gluing Gray Codes. | Petr Gregor, Torsten Mtze |
| 2016 | COCOA | Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model. | Petr Gregor, Riste Skrekovski, Vida Vukasinovic |
| 2010 | IWOCA | Efficient Connectivity Testing of Hypercubic Networks with Faults. | Toms Dvork, Jir Fink, Petr Gregor, Vclav Koubek, Tomasz Radzik |
| 2009 | IWOCA | Gray Code Compression. | Darko Dimitrov, Toms Dvork, Petr Gregor, Riste Skrekovski |
| 2000 | MFCS | Embedding Fibonacci Cubes into Hypercubes with | Rostislav Caha, Petr Gregor |