A new proof of the colored branch Theorem. - Torsten Mütze (IEEE Trans. Circuits Syst. II Express Briefs, 2006)

Generalized switch-setting problems. - Torsten Muetze (Discret. Math., 2007)

Understanding Radio Irregularity in Wireless Networks. - Torsten Muetze; Patrick Stuedi; Fabian Kuhn; Gustavo Alonso (SECON, 2008)

On antimagic directed graphs. - Dan Hefetz; Torsten Mütze; Justus Schwartz (J. Graph Theory, 2010)

On the path-avoidance vertex-coloring game. - Torsten Mütze; Reto Spöhel (Electron. Notes Discret. Math., 2011)

Small subgraphs in random graphs and the power of multiple choices. - Torsten Mütze; Reto Spöhel; Henning Thomas (J. Comb. Theory B, 2011)

Construction of 2-factors in the middle layer of the discrete cube. - Torsten Mütze; Franziska Weber (J. Comb. Theory A, 2012)

Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games. - Michael Belfrage; Torsten Mütze; Reto Spöhel (SIAM J. Discret. Math., 2012)

On globally sparse Ramsey graphs. - Torsten Mütze; Ueli Peter (Discret. Math., 2013)

Scheduling with few changes. - Torsten Mütze (Eur. J. Oper. Res., 2014)

Coloring random graphs online without creating monochromatic subgraphs. - Torsten Mütze; Thomas Rast; Reto Spöhel (Random Struct. Algorithms, 2014)

Bipartite Kneser graphs are Hamiltonian. - Torsten Mütze; Pascal Su (Electron. Notes Discret. Math., 2015)

Distance-preserving graph contractions. - Karl Däubel; Yann Disser; Max Klimm; Torsten Mütze; Frieder Smolny (CoRR, 2017)

A short proof of the middle levels theorem. - Petr Gregor; Torsten Mütze; Jerri Nummenpalo (CoRR, 2017)

On universal partial words. - Herman Z. Q. Chen; Sergey Kitaev; Torsten Mütze; Brian Yi Sun (Electron. Notes Discret. Math., 2017)

A minimum-change version of the Chung-Feller theorem for Dyck paths. - Torsten Mütze; Christoph Standke; Veit Wiechert (Electron. Notes Discret. Math., 2017)

An algorithmic framework for tool switching problems with multiple objectives. - Martina Furrer; Torsten Mütze (Eur. J. Oper. Res., 2017)

On Hamilton cycles in highly symmetric graphs. - Torsten Mütze (GASCom, 2018)

Sparse Kneser graphs are Hamiltonian. - Torsten Mütze; Jerri Nummenpalo; Bartosz Walczak (STOC, 2018)

Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane. - Torsten Mütze; Bartosz Walczak; Veit Wiechert (CoRR, 2018)

Efficient Computation of Middle Levels Gray Codes. - Torsten Mütze; Jerri Nummenpalo (ACM Trans. Algorithms, 2018)

Trimming and gluing Gray codes. - Petr Gregor; Torsten Mütze (Theor. Comput. Sci., 2018)

On Orthogonal Symmetric Chain Decompositions. - Karl Däubel; Sven Jäger 001; Torsten Mütze; Manfred Scheucher (Electron. J. Comb., 2019)

Combinatorial generation via permutation languages. I. Fundamentals. - Elizabeth J. Hartung; Hung Phuc Hoang; Torsten Mütze; Aaron Williams 001 (CoRR, 2019)

Distance-Preserving Graph Contractions. - Aaron Bernstein; Karl Däubel; Yann Disser; Max Klimm; Torsten Mütze; Frieder Smolny (SIAM J. Discret. Math., 2019)

Combinatorial generation via permutation languages. - Elizabeth J. Hartung; Hung Phuc Hoang; Torsten Mütze; Aaron Williams 001 (SODA, 2020)

A Constant-Time Algorithm for Middle Levels Gray Codes. - Torsten Mütze; Jerri Nummenpalo (Algorithmica, 2020)

On L-shaped point set embeddings of trees: first non-embeddable examples. - Torsten Mütze; Manfred Scheucher (J. Graph Algorithms Appl., 2020)

Rainbow Cycles in Flip Graphs. - Stefan Felsner; Linda Kleist; Torsten Mütze; Leon Sering (SIAM J. Discret. Math., 2020)

Efficient Generation of Rectangulations via Permutation Languages. - Arturo Merino; Torsten Mütze (SoCG, 2021)

Flip Distances Between Graph Orientations. - Oswin Aichholzer; Jean Cardinal; Tony Huynh; Kolja Knauer; Torsten Mütze; Raphael Steiner; Birgit Vogtenhuber (Algorithmica, 2021)

On flips in planar matchings. - Marcel Milich; Torsten Mütze; Martin Pergel (Discret. Appl. Math., 2021)

All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. - Arturo Merino; Torsten Mütze; Aaron Williams 001 (FUN, 2022)

The Hamilton Compression of Highly Symmetric Graphs. - Petr Gregor; Arturo Merino; Torsten Mütze (MFCS, 2022)

Efficient generation of elimination trees and graph associahedra. - Jean Cardinal; Arturo Merino; Torsten Mütze (SODA, 2022)

Combinatorial Gray codes-an updated survey. - Torsten Mütze (CoRR, 2022)

Gray codes and symmetric chains. - Petr Gregor; Sven Jäger 001; Torsten Mütze; Joe Sawada; Kaja Wille (J. Comb. Theory B, 2022)

On a Combinatorial Generation Problem of Knuth. - Arturo Merino; Ondrej Micka; Torsten Mütze (SIAM J. Comput., 2022)

Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. - Petr Gregor; Torsten Mütze; Namrata (ISAAC, 2023)

Zigzagging through acyclic orientations of chordal graphs and hypergraphs. - Jean Cardinal; Hung Phuc Hoang; Arturo Merino; Torsten Mütze (SODA, 2023)

Kneser Graphs Are Hamiltonian. - Arturo Merino; Torsten Mütze; Namrata (STOC, 2023)

On the central levels problem. - Petr Gregor; Ondrej Micka; Torsten Mütze (J. Comb. Theory B, 2023)

Star transposition Gray codes for multiset permutations. - Petr Gregor; Arturo Merino; Torsten Mütze (J. Graph Theory, 2023)

Combinatorial Generation via Permutation Languages. III. Rectangulations. - Arturo Merino; Torsten Mütze (Discret. Comput. Geom., 2023)

Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. - Jean Cardinal; Hung Phuc Hoang; Arturo Merino; Ondrej Micka; Torsten Mütze (SIAM J. Discret. Math., 2023)

Flips in Colorful Triangulations. - Rohan Acharya; Torsten Mütze; Francesco Verciani (GD, 2024)

Matchings in Hypercubes Extend to Long Cycles. - Jirí Fink; Torsten Mütze (IWOCA, 2024)

A Book Proof of the Middle Levels Theorem. - Torsten Mütze (Comb., 2024)

Combinatorial generation via permutation languages. VI. Binary trees. - Petr Gregor; Torsten Mütze; Namrata (Eur. J. Comb., 2024)

Traversing Combinatorial 0/1-Polytopes via Optimization. - Arturo Merino; Torsten Mütze (SIAM J. Comput., 2024)

Listing Spanning Trees of Outerplanar Graphs by Pivot-Exchanges. - Nastaran Behrooznia; Torsten Mütze (STACS, 2025)

Graphs that admit a Hamilton path are cup-stackable. - Petr Gregor; Arturo Merino; Torsten Mütze; Francesco Verciani (Discret. Math., 2025)

Hamiltonicity of Schrijver graphs and stable Kneser graphs. - Torsten Mütze; Namrata (Eur. J. Comb., 2025)

Combinatorial Generation via Permutation Languages. IV. Elimination Trees. - Jean Cardinal; Arturo Merino; Torsten Mütze (ACM Trans. Algorithms, 2025)

Counterexample to Winkler's conjecture on Venn diagrams. - Sofia Brenner; Linda Kleist; Torsten Mütze; Christian Rieck; Francesco Verciani (CoRR, 2025)