2023

Merino, Arturo and Mutze, Torsten (2023) Combinatorial generation via permutation languages. III. Rectangulations. Discrete & Computational Geometry, 70 . pp. 51-122. doi:10.1007/s00454-022-00393-w ISSN 0179-5376.

Gregor, Petr, Micka, Ondrej and Mutze, Torsten (2023) On the central levels problem. Journal of Combinatorial Theory Series B, 160 . pp. 163-205. doi:10.1016/j.jctb.2022.12.008 ISSN 0095-8956.

Gregor, Petr, Merino, Arturo and Mutze, Torsten (2023) The Hamilton compression of highly symmetric graphs. Annals of Combinatorics . ISSN 0218-0006. (In Press)

Cardinal, Jean, Hoang, Hung, Merino, Arturo, Micka, Ondrej and Mutze, Torsten (2023) Combinatorial generation via permutation languages. V. Acyclic orientations. SIAM Journal on Discrete Mathematics, 37 (3). pp. 1509-1547. doi:10.1137/23M1546567 ISSN 0895-4801.

Cardinal, Jean, Hoang, Hung, Merino, Arturo, Micka, Ondrej and Mutze, Torsten (2023) Zigzagging through acyclic orientations of graphs and hypergraphs. In: 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy, 22-25 Jan 2023. Published in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) pp. 3029-3042. ISBN 9781611977554. doi:10.1137/1.9781611977554.ch117

Mutze, Torsten (2023) Combinatorial Gray codes-an updated survey. Electronic Journal of Combinatorics . ISSN 1077-8926. (In Press)

Merino, Arturo, Mutze, Torsten and Namrata, (2023) Kneser graphs are Hamiltonian. In: 55th Annual ACM Symposium on Theory of Computing (STOC2023), Miami, Florida, USA, 20-23 Jun 2023 (In Press)

Gregor, Petr, Merino, Arturo and Mutze, Torsten (2023) Star transposition Gray codes for multiset permutations. Journal of Graph Theory . doi:10.1002/jgt.22915 ISSN 0364-9024. (In Press)

Merino, Arturo and Mutze, Torsten (2023) Traversing combinatorial 0/1-polytopes via optimization. In: IEEE Symposium on Foundations of Computer Science (FOCS), Santa Cruz, CA, USA, 06-09 Nov 2023. Published in: Proceedings of FOCS 2023 (In Press)

2022

Gregor, Petr, Merino, Arturo and Mutze, Torsten (2022) The Hamilton compression of highly symmetric graphs. In: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Vienna, Austria, 22—26 Aug 2022, 241 54:1-54:14. ISBN 9783959772563. doi:10.4230/LIPIcs.MFCS.2022.54 ISSN 1868-8969.

Merino, Arturo, Mutze, Torsten and Williams, Aaron (2022) All your bases are belong to us : listing all bases of a matroid by greedy exchanges. In: 11th International Conference on Fun with Algorithms (FUN 2022), Sicily, Italy, 30 May - 03 Jun 2022. Published in: 11th International Conference on Fun with Algorithms (FUN 2022), 226 22:1-22:28. ISBN 9783959772327. doi:10.4230/LIPIcs.FUN.2022.22 ISSN 1868-8969.

Merino, Arturo, Micka, Ondrej and Mutze, Torsten (2022) On a combinatorial generation problem of Knuth. SIAM Journal on Computing, 51 (3). pp. 379-423. doi:10.1137/20M1377394 ISSN 0097-5397.

Gregor, Petr, Mutze, Torsten and Merino, Arturo (2022) Star transposition Gray codes for multiset permutations. In: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Marseille, 15-18 Mar 2022. Published in: Proceedings of STACS 2022, 219 34:1-34:14. ISBN 9783959772228. doi:10.4230/LIPIcs.CVIT.2016.23 ISSN 1868-8969.

Gregor, Petr, Jäger, Sven, Mutze, Torsten, Sawada, Joe and Wille, Kaja (2022) Gray codes and symmetric chains. Journal of Combinatorial Theory, Series B, 153 . pp. 31-60. doi:10.1016/j.jctb.2021.10.008 ISSN 0095-8956.

Cardinal, Jean, Merino, Arturo and Mutze, Torsten (2022) Efficient generation of elimination trees and graph associahedra. In: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), Virtual Conference, 09-12 Jan 2022. Published in: Proceedings of SODA 2022 pp. 2128-2140. ISBN 9781611977073. doi:10.1137/1.9781611977073.84

Elizabeth, Hartung, Hoang, Hung P., Mutze, Torsten and Williams, Aaron (2022) Combinatorial generation via permutation languages. I. Fundamentals. Transactions of the American Mathematical Society, 375 . pp. 2255-2291. doi:10.1090/tran/8199 ISSN 0002-9947.

2021

Hoang, Hung P. and Mutze, Torsten (2021) Combinatorial generation via permutation languages. II. Lattice congruences. Israel Journal of Mathematics, 244 . pp. 359-417. doi:10.1007/s11856-021-2186-1 ISSN 0021-2172.

Merino, Arturo and Mutze, Torsten (2021) Efficient generation of rectangulations via permutation languages. In: 37th International Symposium on Computational Geometry, University at Buffalo, The State University of New York, USA, 07-11 Jun 2021. Published in: 37th International Symposium on Computational Geometry (SoCG 2021), 189 pp. 1-18. ISBN 9783959771849. doi:10.4230/LIPIcs.SoCG.2021.54 ISSN 1868-8969.

Mutze, Torsten, Nummenpalo, Jerri and Walczak, Bartosz (2021) Sparse Kneser graphs are Hamiltonian. Journal of the London Mathematical Society, 103 (4). pp. 1253-1275. doi:10.1112/jlms.12406 ISSN 0024-6107.

Milich, Marcel, Mutze, Torsten and Pergel, Martin (2021) On flips in planar matchings. Discrete Applied Mathematics, 289 . pp. 427-445. doi:10.1016/j.dam.2020.10.018 ISSN 0166-218X.

Aichholzer, Oswin, Cardinal, Jean, Huynh, Tony, Knauer, Kolja, Mutze, Torsten, Steiner, Raphael and Vogtenhuber, Birgit (2021) Flip distances between graph orientations. Algorithmica, 83 . pp. 116-143. doi:10.1007/s00453-020-00751-1 ISSN 0178-4617.

Merino, Arturo, Micka, Ondrej and Mutze, Torsten (2021) On a combinatorial generation problem of Knuth. In: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Virtual Conference, 10-13 Jan 2021. Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) pp. 735-743. ISBN 9781611976465. doi:10.1137/1.9781611976465.46

2020

Mutze, Torsten and Scheucher, Manfred (2020) On L-shaped point set embeddings of trees : first non-embeddable examples. Journal of Graph Algorithms and Applications, 24 (3). pp. 343-369. doi:10.7155/jgaa.00537 ISSN 1526-1719.

Gregor, Petr, Micka, Ondrej and Mutze, Torsten (2020) On the central levels problem. In: 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, 8-11 Jul 2020. Published in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 168 60:1-60:17. ISBN 9783959771382. doi:10.4230/LIPIcs.ICALP.2020.60 ISSN 1868-8969.

Mutze, Torsten and Nummenpalo, Jerri (2020) A constant-time algorithm for middle levels Gray codes. Algorithmica, 82 . pp. 1239-1258. doi:10.1007/s00453-019-00640-2 ISSN 0178-4617.

Felsner, Stefan, Kleist, Linda, Mutze, Torsten and Sering, Leon (2020) Rainbow cycles in flip graphs. SIAM Journal on Discrete Mathematics, 34 (1). pp. 1-39. doi:10.1137/18M1216456 ISSN 0895-4801.

Hartung, Elizabeth, Hoang, Hung, Mutze, Torsten and Williams, Aaron (2020) Combinatorial generation via permutation languages. In: 31st Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, United States, 5-8 Jan 2020. Published in: SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1214-1225. doi:10.5555/3381089.3381163

2018

Gregor, Petr, Jager, Sven, Mutze, Torsten, Sawada, Joe and Wille, Kaja (2018) Gray codes and symmetric chains. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP), Prague, 9-13 Jul 2018. Published in: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP), 107 66:1-66:14. ISBN 9783959770767. ISSN 1868-8969.

Mutze, Torsten and Nummenpalo, Jerri (2018) Efficient computation of middle levels Gray codes. ACM Transactions on Algorithms, 14 (2). 15. doi:10.1145/3170443

Mutze, Torsten, Nummenpalo, Jerri and Walczak, Bartosz (2018) Sparse Kneser graphs are Hamiltonian. In: 50th Annual ACM Symposium on the Theory of Computing (STOC), Los Angeles, 25-29 Jun 2018. Published in: Proceedings of the 50th Annual ACM Symposium on the Theory of Computing (STOC) pp. 912-919. ISBN 9781450355599. doi:10.1145/3188745.3188834

Gregor, Petr, Mutze, Torsten and Nummenpalo, Jerri (2018) A short proof of the middle levels theorem. Discrete Analysis (Paper No. 8). pp. 1-12. doi:10.19086/da.3659 ISSN 2397-3129.

2017

Mutze, Torsten and Su, Pascal (2017) Bipartite Kneser graphs are Hamiltonian. Combinatorica, 37 (6). pp. 1207-1219. doi:10.1007/s00493-016-3434-6 ISSN 0209-9683.

Mutze, Torsten and Nummenpalo, Jerri (2017) A constant-time algorithm for middle levels Gray codes. In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 16-19 Jan 2017. Published in: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017) pp. 2238-2253. ISBN 9781611974782. doi:10.1137/1.9781611974782.147

2016

Mutze, Torsten (2016) Proof of the middle levels conjecture. Proceedings of the London Mathematical Society, 112 (4). pp. 677-713. doi:10.1112/plms/pdw004 ISSN 0024-6115.