default search action
Torsten Mütze
Person information
- affiliation: University of Warwick, UK
- affiliation: TU Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j36]Torsten Mütze:
A Book Proof of the Middle Levels Theorem. Comb. 44(1): 205-208 (2024) - [j35]Petr Gregor, Torsten Mütze, Namrata:
Combinatorial generation via permutation languages. VI. Binary trees. Eur. J. Comb. 122: 104020 (2024) - [j34]Arturo Merino
, Torsten Mütze:
Traversing Combinatorial 0/1-Polytopes via Optimization. SIAM J. Comput. 53(5): 1257-1292 (2024) - [c27]Rohan Acharya, Torsten Mütze, Francesco Verciani:
Flips in Colorful Triangulations. GD 2024: 30:1-30:20 - [c26]Jirí Fink
Matchings in Hypercubes Extend to Long Cycles. IWOCA 2024: 14-27 - [i28]Torsten Mütze, Namrata:
Hamiltonicity of Schrijver graphs and stable Kneser graphs. CoRR abs/2401.01681 (2024) - [i27]Rohan Acharya, Torsten Mütze, Francesco Verciani:
Flips in colorful triangulations. CoRR abs/2406.03783 (2024) - [i26]Nastaran Behrooznia, Torsten Mütze:
Listing spanning trees of outerplanar graphs by pivot exchanges. CoRR abs/2409.15793 (2024) - 2023
- [j33]Arturo Merino
Combinatorial Generation via Permutation Languages. III. Rectangulations. Discret. Comput. Geom. 70(1): 51-122 (2023) - [j32]Petr Gregor
On the central levels problem. J. Comb. Theory B 160: 163-205 (2023) - [j31]Petr Gregor
Star transposition Gray codes for multiset permutations. J. Graph Theory 103(2): 212-270 (2023) - [j30]Jean Cardinal, Hung Phuc Hoang, Arturo Merino
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. SIAM J. Discret. Math. 37(3): 1509-1547 (2023) - [c25]Arturo Merino, Torsten Mütze:
Traversing combinatorial 0/1-polytopes via optimization. FOCS 2023: 1282-1291 - [c24]Petr Gregor, Torsten Mütze, Namrata:
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. ISAAC 2023: 33:1-33:19 - [c23]Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mütze:
Zigzagging through acyclic orientations of chordal graphs and hypergraphs. SODA 2023: 3029-3042 - [c22]Arturo Merino, Torsten Mütze, Namrata:
Kneser Graphs Are Hamiltonian. STOC 2023: 963-970 - [i25]Arturo Merino, Torsten Mütze:
Traversing combinatorial 0/1-polytopes via optimization. CoRR abs/2304.08567 (2023) - [i24]Petr Gregor, Torsten Mütze, Namrata:
Combinatorial generation via permutation languages. VI. Binary trees. CoRR abs/2306.08420 (2023) - 2022
- [j29]Petr Gregor
Gray codes and symmetric chains. J. Comb. Theory B 153: 31-60 (2022) - [j28]Arturo Merino
On a Combinatorial Generation Problem of Knuth. SIAM J. Comput. 51(3): 379-423 (2022) - [c21]Arturo Merino, Torsten Mütze, Aaron Williams:
All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. FUN 2022: 22:1-22:28 - [c20]Petr Gregor
The Hamilton Compression of Highly Symmetric Graphs. MFCS 2022: 54:1-54:14 - [c19]Jean Cardinal, Arturo Merino, Torsten Mütze:
Efficient generation of elimination trees and graph associahedra. SODA 2022: 2128-2140 - [c18]Petr Gregor
Star Transposition Gray Codes for Multiset Permutations. STACS 2022: 34:1-34:14 - [i23]Torsten Mütze:
Combinatorial Gray codes-an updated survey. CoRR abs/2202.01280 (2022) - [i22]Petr Gregor
The Hamilton compression of highly symmetric graphs. CoRR abs/2205.08126 (2022) - [i21]Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka
Combinatorial generation via permutation languages. V. Acyclic orientations. CoRR abs/2212.03915 (2022) - 2021
- [j27]Oswin Aichholzer
Flip Distances Between Graph Orientations. Algorithmica 83(1): 116-143 (2021) - [j26]Marcel Milich, Torsten Mütze
On flips in planar matchings. Discret. Appl. Math. 289: 427-445 (2021) - [c17]Arturo Merino
Efficient Generation of Rectangulations via Permutation Languages. SoCG 2021: 54:1-54:18 - [c16]Arturo Merino
On a combinatorial generation problem of Knuth. SODA 2021: 735-743 - [i20]Arturo Merino
Combinatorial generation via permutation languages. III. Rectangulations. CoRR abs/2103.09333 (2021) - [i19]Jean Cardinal, Arturo Merino
Combinatorial generation via permutation languages. IV. Elimination trees. CoRR abs/2106.16204 (2021) - [i18]Petr Gregor, Arturo Merino
Star transposition Gray codes for multiset permutations. CoRR abs/2108.07465 (2021) - 2020
- [j25]Torsten Mütze
A Constant-Time Algorithm for Middle Levels Gray Codes. Algorithmica 82(5): 1239-1258 (2020) - [j24]Torsten Mütze, Manfred Scheucher
On L-shaped point set embeddings of trees: first non-embeddable examples. J. Graph Algorithms Appl. 24(3): 343-369 (2020) - [j23]Stefan Felsner, Linda Kleist
Rainbow Cycles in Flip Graphs. SIAM J. Discret. Math. 34(1): 1-39 (2020) - [c15]Petr Gregor
On the Central Levels Problem. ICALP 2020: 60:1-60:17 - [c14]Elizabeth Hartung
Combinatorial generation via permutation languages. SODA 2020: 1214-1225 - [c13]Marcel Milich, Torsten Mütze, Martin Pergel
On Flips in Planar Matchings. WG 2020: 213-225 - [i17]Marcel Milich, Torsten Mütze, Martin Pergel:
On flips in planar matchings. CoRR abs/2002.02290 (2020) - [i16]Arturo Merino
On a combinatorial generation problem of Knuth. CoRR abs/2007.07164 (2020)
2010 – 2019
- 2019
- [j22]Karl Däubel, Sven Jäger
On Orthogonal Symmetric Chain Decompositions. Electron. J. Comb. 26(3): 3 (2019) - [j21]Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny:
Distance-Preserving Graph Contractions. SIAM J. Discret. Math. 33(3): 1607-1636 (2019) - [c12]Oswin Aichholzer
Flip Distances Between Graph Orientations. WG 2019: 120-134 - [i15]Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip distances between graph orientations. CoRR abs/1902.06103 (2019) - [i14]Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams:
Combinatorial generation via permutation languages. I. Fundamentals. CoRR abs/1906.06069 (2019) - [i13]Petr Gregor, Ondrej Micka, Torsten Mütze:
On the central levels problem. CoRR abs/1912.01566 (2019) - 2018
- [j20]Torsten Mütze, Christoph Standke, Veit Wiechert:
A minimum-change version of the Chung-Feller theorem for Dyck paths. Eur. J. Comb. 69: 260-275 (2018) - [j19]Torsten Mütze, Jerri Nummenpalo:
Efficient Computation of Middle Levels Gray Codes. ACM Trans. Algorithms 14(2): 15:1-15:29 (2018) - [j18]Petr Gregor
Trimming and gluing Gray codes. Theor. Comput. Sci. 714: 74-95 (2018) - [c11]Stefan Felsner, Linda Kleist
Rainbow Cycles in Flip Graphs. SoCG 2018: 38:1-38:14 - [c10]Torsten Mütze:
On Hamilton cycles in highly symmetric graphs. GASCom 2018: 12-23 - [c9]Torsten Mütze
On L-Shaped Point Set Embeddings of Trees: First Non-embeddable Examples. GD 2018: 354-360 - [c8]Petr Gregor
Gray Codes and Symmetric Chains. ICALP 2018: 66:1-66:14 - [c7]Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny:
Distance-Preserving Graph Contractions. ITCS 2018: 51:1-51:14 - [c6]Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
Sparse Kneser graphs are Hamiltonian. STOC 2018: 912-919 - [i12]Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille:
Gray codes and symmetric chains. CoRR abs/1802.06021 (2018) - [i11]Torsten Mütze, Bartosz Walczak, Veit Wiechert:
Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane. CoRR abs/1802.09969 (2018) - [i10]Torsten Mütze, Manfred Scheucher:
On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples. CoRR abs/1807.11043 (2018) - [i9]Karl Däubel, Sven Jäger, Torsten Mütze, Manfred Scheucher:
On orthogonal symmetric chain decompositions. CoRR abs/1810.09847 (2018) - 2017
- [j17]Torsten Mütze, Pascal Su
Bipartite Kneser Graphs are Hamiltonian. Comb. 37(6): 1207-1219 (2017) - [j16]Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Yi Sun:
On universal partial words. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j15]Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Yi Sun:
On universal partial words. Electron. Notes Discret. Math. 61: 231-237 (2017) - [j14]Torsten Mütze, Christoph Standke, Veit Wiechert:
A minimum-change version of the Chung-Feller theorem for Dyck paths. Electron. Notes Discret. Math. 61: 901-907 (2017) - [j13]Martina Furrer, Torsten Mütze:
An algorithmic framework for tool switching problems with multiple objectives. Eur. J. Oper. Res. 259(3): 1003-1016 (2017) - [c5]Torsten Mütze, Jerri Nummenpalo:
A constant-time algorithm for middle levels Gray codes. SODA 2017: 2238-2253 - [c4]Petr Gregor
Trimming and Gluing Gray Codes. STACS 2017: 40:1-40:14 - [i8]Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny:
Distance-preserving graph contractions. CoRR abs/1705.04544 (2017) - [i7]Petr Gregor, Torsten Mütze, Jerri Nummenpalo:
A short proof of the middle levels theorem. CoRR abs/1710.08249 (2017) - [i6]Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak:
Sparse Kneser graphs are Hamiltonian. CoRR abs/1711.01636 (2017) - [i5]Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering:
Rainbow cycles in flip graphs. CoRR abs/1712.07421 (2017) - 2016
- [i4]Torsten Mütze, Christoph Standke, Veit Wiechert:
A minimum-change version of the Chung-Feller theorem for Dyck paths. CoRR abs/1603.02525 (2016) - [i3]Torsten Mütze, Jerri Nummenpalo:
A constant-time algorithm for middle levels Gray codes. CoRR abs/1606.06172 (2016) - [i2]Petr Gregor, Torsten Mütze:
Trimming and gluing Gray codes. CoRR abs/1607.08806 (2016) - 2015
- [j12]Torsten Mütze, Pascal Su:
Bipartite Kneser graphs are Hamiltonian. Electron. Notes Discret. Math. 49: 259-267 (2015) - [c3]Torsten Mütze, Jerri Nummenpalo:
Efficient Computation of Middle Levels Gray Codes. ESA 2015: 915-927 - [i1]Torsten Mütze, Jerri Nummenpalo:
Efficient computation of middle levels Gray codes. CoRR abs/1506.07898 (2015) - 2014
- [j11]Torsten Mütze:
Scheduling with few changes. Eur. J. Oper. Res. 236(1): 37-50 (2014) - [j10]Torsten Mütze, Thomas Rast, Reto Spöhel:
Coloring random graphs online without creating monochromatic subgraphs. Random Struct. Algorithms 44(4): 419-464 (2014) - 2013
- [j9]Torsten Mütze, Ueli Peter:
On globally sparse Ramsey graphs. Discret. Math. 313(22): 2626-2637 (2013) - 2012
- [j8]Torsten Mütze, Franziska Weber:
Construction of 2-factors in the middle layer of the discrete cube. J. Comb. Theory A 119(8): 1832-1855 (2012) - [j7]Michael Belfrage, Torsten Mütze, Reto Spöhel:
Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games. SIAM J. Discret. Math. 26(3): 1031-1049 (2012) - 2011
- [j6]Torsten Mütze, Reto Spöhel:
On the Path-Avoidance Vertex-Coloring Game. Electron. J. Comb. 18(1) (2011) - [j5]Torsten Mütze, Reto Spöhel:
On the path-avoidance vertex-coloring game. Electron. Notes Discret. Math. 38: 657-662 (2011) - [j4]Torsten Mütze, Reto Spöhel, Henning Thomas:
Small subgraphs in random graphs and the power of multiple choices. J. Comb. Theory B 101(4): 237-268 (2011) - [c2]Torsten Mütze, Thomas Rast, Reto Spöhel:
Coloring random graphs online without creating monochromatic subgraphs. SODA 2011: 145-158 - 2010
- [j3]Dan Hefetz
On antimagic directed graphs. J. Graph Theory 64(3): 219-232 (2010)
2000 – 2009
- 2008
- [c1]Torsten Muetze, Patrick Stuedi, Fabian Kuhn, Gustavo Alonso:
Understanding Radio Irregularity in Wireless Networks. SECON 2008: 82-90 - 2007
- [j2]Torsten Muetze:
Generalized switch-setting problems. Discret. Math. 307(22): 2755-2770 (2007) - 2006
- [j1]Torsten Mütze:
A new proof of the colored branch Theorem. IEEE Trans. Circuits Syst. II Express Briefs 53-II(4): 286-288 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: