Torsten Mütze

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 72

Top Topics

Efficient Computation

Graph Theoretic

Top Venues

SIAM J. Discret. Math.

Electron. Notes Discret. Math.

Publications

Torsten Mütze
A Book Proof of the Middle Levels Theorem. Comb. 44 (1) (2024)
Jirí Fink, Torsten Mütze
Matchings in Hypercubes Extend to Long Cycles. IWOCA (2024)
Petr Gregor, Torsten Mütze, Namrata
Combinatorial generation via permutation languages. VI. Binary trees. Eur. J. Comb. 122 (2024)
Torsten Mütze, Namrata
Hamiltonicity of Schrijver graphs and stable Kneser graphs. CoRR (2024)
Rohan Acharya, Torsten Mütze, Francesco Verciani
Flips in colorful triangulations. CoRR (2024)
Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Torsten Mütze
Zigzagging through acyclic orientations of chordal graphs and hypergraphs. SODA (2023)
Arturo I. Merino, Torsten Mütze
Combinatorial Generation via Permutation Languages. III. Rectangulations. Discret. Comput. Geom. 70 (1) (2023)
Arturo I. Merino, Torsten Mütze
Traversing combinatorial 0/1-polytopes via optimization. FOCS (2023)
Arturo I. Merino, Torsten Mütze
Traversing combinatorial 0/1-polytopes via optimization. CoRR (2023)
Petr Gregor, Torsten Mütze, Namrata
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. ISAAC (2023)
Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Ondrej Micka, Torsten Mütze
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. SIAM J. Discret. Math. 37 (3) (2023)
Arturo I. Merino, Torsten Mütze, Namrata
Kneser Graphs Are Hamiltonian. STOC (2023)
Petr Gregor, Ondrej Micka, Torsten Mütze
On the central levels problem. J. Comb. Theory, Ser. B 160 (2023)
Petr Gregor, Arturo I. Merino, Torsten Mütze
Star transposition Gray codes for multiset permutations. J. Graph Theory 103 (2) (2023)
Petr Gregor, Torsten Mütze, Namrata
Combinatorial generation via permutation languages. VI. Binary trees. CoRR (2023)
Torsten Mütze
Combinatorial Gray codes-an updated survey. CoRR (2022)
Petr Gregor, Arturo I. Merino, Torsten Mütze
The Hamilton compression of highly symmetric graphs. CoRR (2022)
Arturo I. Merino, Ondrej Micka, Torsten Mütze
On a Combinatorial Generation Problem of Knuth. SIAM J. Comput. 51 (3) (2022)
Petr Gregor, Torsten Mütze, Arturo I. Merino
Star Transposition Gray Codes for Multiset Permutations. STACS (2022)
Arturo I. Merino, Torsten Mütze, Aaron Williams
All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. FUN (2022)
Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Ondrej Micka, Torsten Mütze
Combinatorial generation via permutation languages. V. Acyclic orientations. CoRR (2022)
Petr Gregor, Arturo I. Merino, Torsten Mütze
The Hamilton Compression of Highly Symmetric Graphs. MFCS (2022)
Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
Gray codes and symmetric chains. J. Comb. Theory, Ser. B 153 (2022)
Jean Cardinal, Arturo I. Merino, Torsten Mütze
Efficient generation of elimination trees and graph associahedra. SODA (2022)
Marcel Milich, Torsten Mütze, Martin Pergel
On flips in planar matchings. Discret. Appl. Math. 289 (2021)
Jean Cardinal, Arturo I. Merino, Torsten Mütze
Combinatorial generation via permutation languages. IV. Elimination trees. CoRR (2021)
Arturo I. Merino, Torsten Mütze
Combinatorial generation via permutation languages. III. Rectangulations. CoRR (2021)
Petr Gregor, Arturo I. Merino, Torsten Mütze
Star transposition Gray codes for multiset permutations. CoRR (2021)
Arturo I. Merino, Torsten Mütze
Efficient Generation of Rectangulations via Permutation Languages. SoCG (2021)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip Distances Between Graph Orientations. Algorithmica 83 (1) (2021)
Arturo I. Merino, Ondrej Micka, Torsten Mütze
On a combinatorial generation problem of Knuth. SODA (2021)
Marcel Milich, Torsten Mütze, Martin Pergel
On Flips in Planar Matchings. WG (2020)
Arturo I. Merino, Ondrej Micka, Torsten Mütze
On a combinatorial generation problem of Knuth. CoRR (2020)
Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams
Combinatorial generation via permutation languages. SODA (2020)
Torsten Mütze, Jerri Nummenpalo
A Constant-Time Algorithm for Middle Levels Gray Codes. Algorithmica 82 (5) (2020)
Marcel Milich, Torsten Mütze, Martin Pergel
On flips in planar matchings. CoRR (2020)
Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering
Rainbow Cycles in Flip Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Petr Gregor, Ondrej Micka, Torsten Mütze
On the Central Levels Problem. ICALP (2020)
Torsten Mütze, Manfred Scheucher
On L-shaped point set embeddings of trees: first non-embeddable examples. J. Graph Algorithms Appl. 24 (3) (2020)
Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams
Combinatorial generation via permutation languages. I. Fundamentals. CoRR (2019)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip distances between graph orientations. CoRR (2019)
Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
Distance-Preserving Graph Contractions. SIAM J. Discret. Math. 33 (3) (2019)
Petr Gregor, Ondrej Micka, Torsten Mütze
On the central levels problem. CoRR (2019)
Karl Däubel, Sven Jäger, Torsten Mütze, Manfred Scheucher
On Orthogonal Symmetric Chain Decompositions. Electron. J. Comb. 26 (3) (2019)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip Distances Between Graph Orientations. WG (2019)
Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering
Rainbow Cycles in Flip Graphs. SoCG (2018)
Torsten Mütze, Bartosz Walczak, Veit Wiechert
Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane. CoRR (2018)
Petr Gregor, Torsten Mütze
Trimming and gluing Gray codes. Theor. Comput. Sci. 714 (2018)
Torsten Mütze, Manfred Scheucher
On L-Shaped Point Set Embeddings of Trees: First Non-embeddable Examples. Graph Drawing (2018)
Karl Däubel, Sven Jäger, Torsten Mütze, Manfred Scheucher
On orthogonal symmetric chain decompositions. CoRR (2018)
Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
Gray Codes and Symmetric Chains. ICALP (2018)
Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille
Gray codes and symmetric chains. CoRR (2018)
Torsten Mütze
On Hamilton cycles in highly symmetric graphs. GASCom (2018)
Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
Distance-Preserving Graph Contractions. ITCS (2018)
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
Sparse Kneser graphs are Hamiltonian. STOC (2018)
Torsten Mütze, Manfred Scheucher
On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples. CoRR (2018)
Torsten Mütze, Christoph Standke, Veit Wiechert
A minimum-change version of the Chung-Feller theorem for Dyck paths. Eur. J. Comb. 69 (2018)
Torsten Mütze, Jerri Nummenpalo
Efficient Computation of Middle Levels Gray Codes. ACM Trans. Algorithms 14 (2) (2018)
Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering
Rainbow cycles in flip graphs. CoRR (2017)
Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
Distance-preserving graph contractions. CoRR (2017)
Torsten Mütze, Pascal Su
Bipartite Kneser Graphs are Hamiltonian. Comb. 37 (6) (2017)
Petr Gregor, Torsten Mütze
Trimming and Gluing Gray Codes. STACS (2017)
Martina Furrer, Torsten Mütze
An algorithmic framework for tool switching problems with multiple objectives. Eur. J. Oper. Res. 259 (3) (2017)
Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Y. Sun
On universal partial words. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Torsten Mütze, Christoph Standke, Veit Wiechert
A minimum-change version of the Chung-Feller theorem for Dyck paths. Electron. Notes Discret. Math. 61 (2017)
Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Y. Sun
On universal partial words. Electron. Notes Discret. Math. 61 (2017)
Petr Gregor, Torsten Mütze, Jerri Nummenpalo
A short proof of the middle levels theorem. CoRR (2017)
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
Sparse Kneser graphs are Hamiltonian. CoRR (2017)
Torsten Mütze, Jerri Nummenpalo
A constant-time algorithm for middle levels Gray codes. SODA (2017)
Torsten Mütze, Christoph Standke, Veit Wiechert
A minimum-change version of the Chung-Feller theorem for Dyck paths. CoRR (2016)
Petr Gregor, Torsten Mütze
Trimming and gluing Gray codes. CoRR (2016)
Torsten Mütze, Jerri Nummenpalo
A constant-time algorithm for middle levels Gray codes. CoRR (2016)
Torsten Mütze, Pascal Su
Bipartite Kneser graphs are Hamiltonian. Electron. Notes Discret. Math. 49 (2015)
Torsten Mütze, Jerri Nummenpalo
Efficient computation of middle levels Gray codes. CoRR (2015)
Torsten Mütze, Jerri Nummenpalo
Efficient Computation of Middle Levels Gray Codes. ESA (2015)
Torsten Mütze, Thomas Rast, Reto Spöhel
Coloring random graphs online without creating monochromatic subgraphs. Random Struct. Algorithms 44 (4) (2014)
Torsten Mütze
Scheduling with few changes. Eur. J. Oper. Res. 236 (1) (2014)
Torsten Mütze, Ueli Peter
On globally sparse Ramsey graphs. Discret. Math. 313 (22) (2013)
Torsten Mütze, Franziska Weber
Construction of 2-factors in the middle layer of the discrete cube. J. Comb. Theory, Ser. A 119 (8) (2012)
Michael Belfrage, Torsten Mütze, Reto Spöhel
Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games. SIAM J. Discret. Math. 26 (3) (2012)
Torsten Mütze, Thomas Rast, Reto Spöhel
Coloring random graphs online without creating monochromatic subgraphs. SODA (2011)
Torsten Mütze, Reto Spöhel
On the Path-Avoidance Vertex-Coloring Game. Electron. J. Comb. 18 (1) (2011)
Torsten Mütze, Reto Spöhel
On the path-avoidance vertex-coloring game. Electron. Notes Discret. Math. 38 (2011)
Torsten Mütze, Reto Spöhel, Henning Thomas
Small subgraphs in random graphs and the power of multiple choices. J. Comb. Theory, Ser. B 101 (4) (2011)
Dan Hefetz, Torsten Mütze, Justus Schwartz
On antimagic directed graphs. J. Graph Theory 64 (3) (2010)
Torsten Mütze
A new proof of the colored branch Theorem. IEEE Trans. Circuits Syst. II Express Briefs (4) (2006)