| 2026 | SODA | Listing faces of polytopes. | Nastaran Behrooznia, Sofia Brenner, Arturo Merino, Torsten Mtze, Christian Rieck, Francesco Verciani |
| 2026 | SODA | Traversing regions of supersolvable hyperplane arrangements and their lattice quotients. | Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mtze |
| 2025 | STACS | Listing Spanning Trees of Outerplanar Graphs by Pivot-Exchanges. | Nastaran Behrooznia, Torsten Mtze |
| 2024 | GD | Flips in Colorful Triangulations. | Rohan Acharya, Torsten Mtze, Francesco Verciani |
| 2024 | IWOCA | Matchings in Hypercubes Extend to Long Cycles. | Jir Fink, Torsten Mtze |
| 2023 | FOCS | Traversing combinatorial 0/1-polytopes via optimization. | Arturo Merino, Torsten Mtze |
| 2023 | ISAAC | Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. | Petr Gregor, Torsten Mtze, Namrata |
| 2023 | SODA | Zigzagging through acyclic orientations of chordal graphs and hypergraphs. | Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mtze |
| 2023 | STOC | Kneser Graphs Are Hamiltonian. | Arturo Merino, Torsten Mtze, Namrata |
| 2022 | FUN | All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. | Arturo Merino, Torsten Mtze, Aaron Williams |
| 2022 | MFCS | The Hamilton Compression of Highly Symmetric Graphs. | Petr Gregor, Arturo Merino, Torsten Mtze |
| 2022 | SODA | Efficient generation of elimination trees and graph associahedra. | Jean Cardinal, Arturo Merino, Torsten Mtze |
| 2022 | STACS | Star Transposition Gray Codes for Multiset Permutations. | Petr Gregor, Torsten Mtze, Arturo Merino |
| 2021 | SODA | On a combinatorial generation problem of Knuth. | Arturo Merino, Ondrej Micka, Torsten Mtze |
| 2020 | ICALP | On the Central Levels Problem. | Petr Gregor, Ondrej Micka, Torsten Mtze |
| 2020 | SODA | Combinatorial generation via permutation languages. | Elizabeth J. Hartung, Hung Phuc Hoang, Torsten Mtze, Aaron Williams |
| 2020 | WG | On Flips in Planar Matchings. | Marcel Milich, Torsten Mtze, Martin Pergel |
| 2019 | WG | Flip Distances Between Graph Orientations. | Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mtze, Raphael Steiner, Birgit Vogtenhuber |
| 2018 | GD | On L-Shaped Point Set Embeddings of Trees: First Non-embeddable Examples. | Torsten Mtze, Manfred Scheucher |
| 2018 | ICALP | Gray Codes and Symmetric Chains. | Petr Gregor, Sven Jger, Torsten Mtze, Joe Sawada, Kaja Wille |
| 2018 | STOC | Sparse Kneser graphs are Hamiltonian. | Torsten Mtze, Jerri Nummenpalo, Bartosz Walczak |
| 2017 | SODA | A constant-time algorithm for middle levels Gray codes. | Torsten Mtze, Jerri Nummenpalo |
| 2017 | STACS | Trimming and Gluing Gray Codes. | Petr Gregor, Torsten Mtze |
| 2015 | ESA | Efficient Computation of Middle Levels Gray Codes. | Torsten Mtze, Jerri Nummenpalo |
| 2011 | SODA | Coloring random graphs online without creating monochromatic subgraphs. | Torsten Mtze, Thomas Rast, Reto Sphel |