Torsten Mütze

101 papers A* 15A 7B 4C 1Misc 1Journal 72Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements.
Eur. J. Comb.
Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mütze
2026 A* conf
Listing faces of polytopes.
SODA
Nastaran Behrooznia, Sofia Brenner, Arturo Merino, Torsten Mütze, Christian Rieck, Francesco Verciani
2026 A* conf
Traversing regions of supersolvable hyperplane arrangements and their lattice quotients.
SODA
Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mütze
2025 J jnl
Combinatorial Generation via Permutation Languages. IV. Elimination Trees.
ACM Trans. Algorithms
Jean Cardinal, Arturo Merino, Torsten Mütze
2025 J jnl
Counterexample to Winkler's conjecture on Venn diagrams.
CoRR
Sofia Brenner, Linda Kleist, Torsten Mütze, Christian Rieck, Francesco Verciani
2025 J jnl
Flips in colorful triangulations.
J. Comput. Geom.
Rohan Acharya, Torsten Mütze, Francesco Verciani
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
Hamiltonicity of Schrijver graphs and stable Kneser graphs.
Eur. J. Comb.
Torsten Mütze, Namrata
2025 A conf
Listing Spanning Trees of Outerplanar Graphs by Pivot-Exchanges.
STACS
Nastaran Behrooznia, Torsten Mütze
2025 J jnl
Matchings in Hypercubes Extend to Long Cycles.
SIAM J. Discret. Math.
Jirí Fink, Torsten Mütze
2025 J jnl
On minimum Venn diagrams.
CoRR
Sofia Brenner, Petr Gregor, Torsten Mütze, Francesco Verciani
2025 J jnl
Order Dimension, Grids, and Products.
Order
Stefan Felsner, Torsten Mütze, Maximilian Wittmann
2024 J jnl
A Book Proof of the Middle Levels Theorem.
Comb.
Torsten Mütze
2024 J jnl
Combinatorial generation via permutation languages. VI. Binary trees.
Eur. J. Comb.
Petr Gregor, Torsten Mütze, Namrata
2024 A conf
Flips in Colorful Triangulations.
GD
Rohan Acharya, Torsten Mütze, Francesco Verciani
2024 J jnl
Flips in colorful triangulations.
CoRR
Rohan Acharya, Torsten Mütze, Francesco Verciani
2024 J jnl
Hamiltonicity of Schrijver graphs and stable Kneser graphs.
CoRR
Torsten Mütze, Namrata
2024 J jnl
Listing spanning trees of outerplanar graphs by pivot exchanges.
CoRR
Nastaran Behrooznia, Torsten Mütze
2024 C conf
Matchings in Hypercubes Extend to Long Cycles.
IWOCA
Jirí Fink, Torsten Mütze
2024 J jnl
Traversing Combinatorial 0/1-Polytopes via Optimization.
SIAM J. Comput.
Arturo Merino, Torsten Mütze
2023 J jnl
Combinatorial Generation via Permutation Languages. III. Rectangulations.
Discret. Comput. Geom.
Arturo Merino, Torsten Mütze
2023 J jnl
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations.
SIAM J. Discret. Math.
Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze
2023 J jnl
Combinatorial generation via permutation languages. VI. Binary trees.
CoRR
Petr Gregor, Torsten Mütze, Namrata
2023 A* conf
Kneser Graphs Are Hamiltonian.
STOC
Arturo Merino, Torsten Mütze, Namrata
2023 J jnl
On the central levels problem.
J. Comb. Theory B
Petr Gregor, Ondrej Micka, Torsten Mütze
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
2023 A* conf
Traversing combinatorial 0/1-polytopes via optimization.
FOCS
Arturo Merino, Torsten Mütze
2023 J jnl
Traversing combinatorial 0/1-polytopes via optimization.
CoRR
Arturo Merino, Torsten Mütze
2023 A* conf
Zigzagging through acyclic orientations of chordal graphs and hypergraphs.
SODA
Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mütze
2022 Misc conf
All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges.
FUN
Arturo Merino, Torsten Mütze, Aaron Williams
2022 J jnl
Combinatorial Gray codes-an updated survey.
CoRR
Torsten Mütze
2022 J jnl
Combinatorial generation via permutation languages. V. Acyclic orientations.
CoRR
Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze
2022 A* conf
Efficient generation of elimination trees and graph associahedra.
SODA
Jean Cardinal, 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 J jnl
On a Combinatorial Generation Problem of Knuth.
SIAM J. Comput.
Arturo Merino, Ondrej Micka, Torsten Mütze
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
Combinatorial generation via permutation languages. III. Rectangulations.
CoRR
Arturo Merino, Torsten Mütze
2021 J jnl
Combinatorial generation via permutation languages. IV. Elimination trees.
CoRR
Jean Cardinal, Arturo Merino, Torsten Mütze
2021 A* conf
Efficient Generation of Rectangulations via Permutation Languages.
SoCG
Arturo Merino, Torsten Mütze
2021 J jnl
Flip Distances Between Graph Orientations.
Algorithmica
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
2021 A* conf
On a combinatorial generation problem of Knuth.
SODA
Arturo Merino, Ondrej Micka, Torsten Mütze
2021 J jnl
On flips in planar matchings.
Discret. Appl. Math.
Marcel Milich, Torsten Mütze, Martin Pergel
2021 J jnl
Star transposition Gray codes for multiset permutations.
CoRR
Petr Gregor, Arturo Merino, Torsten Mütze
2020 J jnl
A Constant-Time Algorithm for Middle Levels Gray Codes.
Algorithmica
Torsten Mütze, Jerri Nummenpalo
2020 A* conf
Combinatorial generation via permutation languages.
SODA
Elizabeth J. Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams
2020 B conf
On Flips in Planar Matchings.
WG
Marcel Milich, Torsten Mütze, Martin Pergel
2020 J jnl
On L-shaped point set embeddings of trees: first non-embeddable examples.
J. Graph Algorithms Appl.
Torsten Mütze, Manfred Scheucher
2020 J jnl
On a combinatorial generation problem of Knuth.
CoRR
Arturo Merino, Ondrej Micka, Torsten Mütze
2020 J jnl
On flips in planar matchings.
CoRR
Marcel Milich, Torsten Mütze, Martin Pergel
2020 A* conf
On the Central Levels Problem.
ICALP
Petr Gregor, Ondrej Micka, Torsten Mütze
2020 J jnl
Rainbow Cycles in Flip Graphs.
SIAM J. Discret. Math.
Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering
2019 J jnl
Combinatorial generation via permutation languages. I. Fundamentals.
CoRR
Elizabeth J. Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams
2019 J jnl
Distance-Preserving Graph Contractions.
SIAM J. Discret. Math.
Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
2019 B conf
Flip Distances Between Graph Orientations.
WG
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
2019 J jnl
Flip distances between graph orientations.
CoRR
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
2019 J jnl
On Orthogonal Symmetric Chain Decompositions.
Electron. J. Comb.
Karl Däubel, Sven Jäger, Torsten Mütze, Manfred Scheucher
2019 J jnl
On the central levels problem.
CoRR
Petr Gregor, Ondrej Micka, Torsten Mütze
2018 J jnl
A minimum-change version of the Chung-Feller theorem for Dyck paths.
Eur. J. Comb.
Torsten Mütze, Christoph Standke, Veit Wiechert
2018 A conf
Distance-Preserving Graph Contractions.
ITCS
Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
2018 J jnl
Efficient Computation of Middle Levels Gray Codes.
ACM Trans. Algorithms
Torsten Mütze, Jerri Nummenpalo
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 — conf
On Hamilton cycles in highly symmetric graphs.
GASCom
Torsten Mütze
2018 A conf
On L-Shaped Point Set Embeddings of Trees: First Non-embeddable Examples.
GD
Torsten Mütze, Manfred Scheucher
2018 J jnl
On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples.
CoRR
Torsten Mütze, Manfred Scheucher
2018 J jnl
On orthogonal symmetric chain decompositions.
CoRR
Karl Däubel, Sven Jäger, Torsten Mütze, Manfred Scheucher
2018 A* conf
Rainbow Cycles in Flip Graphs.
SoCG
Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering
2018 J jnl
Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane.
CoRR
Torsten Mütze, Bartosz Walczak, Veit Wiechert
2018 A* conf
Sparse Kneser graphs are Hamiltonian.
STOC
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
2018 J jnl
Trimming and gluing Gray codes.
Theor. Comput. Sci.
Petr Gregor, Torsten Mütze
2017 A* conf
A constant-time algorithm for middle levels Gray codes.
SODA
Torsten Mütze, Jerri Nummenpalo
2017 J jnl
A minimum-change version of the Chung-Feller theorem for Dyck paths.
Electron. Notes Discret. Math.
Torsten Mütze, Christoph Standke, Veit Wiechert
2017 J jnl
A short proof of the middle levels theorem.
CoRR
Petr Gregor, Torsten Mütze, Jerri Nummenpalo
2017 J jnl
An algorithmic framework for tool switching problems with multiple objectives.
Eur. J. Oper. Res.
Martina Furrer, Torsten Mütze
2017 J jnl
Bipartite Kneser Graphs are Hamiltonian.
Comb.
Torsten Mütze, Pascal Su
2017 J jnl
Distance-preserving graph contractions.
CoRR
Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
2017 J jnl
On universal partial words.
Discret. Math. Theor. Comput. Sci.
Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Yi Sun
2017 J jnl
On universal partial words.
Electron. Notes Discret. Math.
Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Yi Sun
2017 J jnl
Rainbow cycles in flip graphs.
CoRR
Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering
2017 J jnl
Sparse Kneser graphs are Hamiltonian.
CoRR
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
2017 A conf
Trimming and Gluing Gray Codes.
STACS
Petr Gregor, Torsten Mütze
2016 J jnl
A constant-time algorithm for middle levels Gray codes.
CoRR
Torsten Mütze, Jerri Nummenpalo
2016 J jnl
A minimum-change version of the Chung-Feller theorem for Dyck paths.
CoRR
Torsten Mütze, Christoph Standke, Veit Wiechert
2016 J jnl
Trimming and gluing Gray codes.
CoRR
Petr Gregor, Torsten Mütze
2015 J jnl
Bipartite Kneser graphs are Hamiltonian.
Electron. Notes Discret. Math.
Torsten Mütze, Pascal Su
2015 A conf
Efficient Computation of Middle Levels Gray Codes.
ESA
Torsten Mütze, Jerri Nummenpalo
2015 J jnl
Efficient computation of middle levels Gray codes.
CoRR
Torsten Mütze, Jerri Nummenpalo
2014 J jnl
Coloring random graphs online without creating monochromatic subgraphs.
Random Struct. Algorithms
Torsten Mütze, Thomas Rast, Reto Spöhel
2014 J jnl
Scheduling with few changes.
Eur. J. Oper. Res.
Torsten Mütze
2013 J jnl
On globally sparse Ramsey graphs.
Discret. Math.
Torsten Mütze, Ueli Peter
2012 J jnl
Construction of 2-factors in the middle layer of the discrete cube.
J. Comb. Theory A
Torsten Mütze, Franziska Weber
2012 J jnl
Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games.
SIAM J. Discret. Math.
Michael Belfrage, Torsten Mütze, Reto Spöhel
2011 A* conf
Coloring random graphs online without creating monochromatic subgraphs.
SODA
Torsten Mütze, Thomas Rast, Reto Spöhel
2011 J jnl
On the Path-Avoidance Vertex-Coloring Game.
Electron. J. Comb.
Torsten Mütze, Reto Spöhel
2011 J jnl
On the path-avoidance vertex-coloring game.
Electron. Notes Discret. Math.
Torsten Mütze, Reto Spöhel
2011 J jnl
Small subgraphs in random graphs and the power of multiple choices.
J. Comb. Theory B
Torsten Mütze, Reto Spöhel, Henning Thomas
2010 J jnl
On antimagic directed graphs.
J. Graph Theory
Dan Hefetz, Torsten Mütze, Justus Schwartz
2006 J jnl
A new proof of the colored branch Theorem.
IEEE Trans. Circuits Syst. II Express Briefs
Torsten Mütze