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, 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

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

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

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

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