Torsten Mütze

1. GREGOR, Petr, MÜTZE, Torsten, NUMMENPALO, Jerri. A short proof of the middle levels theorem. Discrete analysis. 2018, vol. 8, str. 1-12, ilustr. ISSN 2397-3129. DOI: 10.19086/da.3659. [COBISS.SI-ID 2048572947]

2. GREGOR, Petr, MÜTZE, Torsten. Trimming and gluing Gray codes. Theoretical computer science. 2018, vol. 714, str. 74-95. ISSN 0304-3975. DOI: 10.1016/j.tcs.2017.12.003. [COBISS.SI-ID 2048495379]

3. GREGOR, Petr, MIČKA, Ondřej, MÜTZE, Torsten. On the central levels problem. In: CZUMAJ, Artur (ed.), DAWAR, Anuj (ed.), MERELLI, Emanuela (ed.). 47th International Colloquium on Automata, Languages, and Programming : ICALP 2020, July 8–11, 2020, Saarbrücken, Germany (Virtual Conference). Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. Str. 60:1-60:17, ilustr. Leibniz international proceedings in informatics, 168. ISBN 978-3-95977-138-2. ISSN 1868-8969. https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.60, DOI: 10.4230/LIPIcs.ICALP.2020.60. [COBISS.SI-ID 241406723]

4. GREGOR, Petr, JÄGER, Sven, MÜTZE, Torsten, SAWADA, Joe, WILLE, Kaja. Gray codes and symmetric chains. Journal of combinatorial theory. Series B. March 2022, vol. 153, str. 31-60. ISSN 0095-8956. https://www.sciencedirect.com/science/article/pii/S0095895621000897, DOI: 10.1016/j.jctb.2021.10.008. [COBISS.SI-ID 241328643]

5. GREGOR, Petr, MERINO, Arturo, MÜTZE, Torsten. The Hamilton Compression of Highly Symmetric Graphs. In: SZEIDER, Stefan (ed.), GANIAN, Robert (ed.), SILVA, Alexandra (ed.). 47th International Symposium on Mathematical Foundations of Computer Science : MFCS 2022, August 22-26, 2022, Vienna, Austria. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Str. 54:1-54:14. Leibniz international proceedings in informatics, vol. 241. ISBN 978-3-95977-256-3. ISSN 1868-8969. https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.54, DOI: 10.4230/LIPIcs.MFCS.2022.54. [COBISS.SI-ID 241245955]
project: This work was supported by Czech Science Foundation grant GA 22-15272S. Petr Gregor: Partially supported by ARRS project P1-0383. Arturo Merino: German Science Foundation grant 413902284 and ANID Becas Chile 2019-72200522 Torsten Mütze: German Science Foundation grant 413902284

6. GREGOR, Petr, MÜTZE, Torsten, MERINO, Arturo. Star Transposition Gray Codes for Multiset Permutations. In: BERENBRINK, Petra (ed.), MONMEGE, Benjamin (ed.). 39th International Symposium on Theoretical Aspects of Computer Science : STACS 2022, March 15–18, 2022, Marseille, France : (Virtual Conference). Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Str. 34:1-34:14. Leibniz international proceedings in informatics, vol. 219. ISBN 978-3-95977-222-8. ISSN 1868-8969. https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.34, DOI: 10.4230/LIPIcs.STACS.2022.34. [COBISS.SI-ID 241298947]
project: This work was supported by Czech Science Foundation grant GA 19-08554S, and by German Science Foundation grant 413902284. Arturo Merino: was also supported by ANID Becas Chile 2019-72200522

7. GREGOR, Petr, MIČKA, Ondřej, MÜTZE, Torsten. On the central levels problem. Journal of combinatorial theory. Series B. May 2023, vol. 160, str. 163-205. ISSN 0095-8956. https://www.sciencedirect.com/science/article/pii/S0095895623000011, DOI: 10.1016/j.jctb.2022.12.008. [COBISS.SI-ID 241233411]

8. GREGOR, Petr, MÜTZE, Torsten, NAMRATA. Pattern-Avoiding Binary Trees – Generation, Counting, and Bijections. In: IWATA, Satoru (ed.), KAKIMURA, Naonori (ed.). 34th International Symposium on Algorithms and Computation : ISAAC 2023, December 3-6, 2023, Kyoto, Japan. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2023. Str. 1-19, ilustr. Leibniz international proceedings in informatics, vol. 283. ISBN 978-3-95977-289-1. ISSN 1868-8969. https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.33, DOI: 10.4230/LIPIcs.ISAAC.2023.33. [COBISS.SI-ID 241105155]
project: This work was supported by Czech Science Foundation grant GA 22-15272S.

9. GREGOR, Petr, MERINO, Arturo, MÜTZE, Torsten. Star transposition Gray codes for multiset permutations. Journal of graph theory. 2023, vol. 103, iss. 2, str. 212-270, ilustr. ISSN 1097-0118. DOI: 10.1002/jgt.22915. [COBISS.SI-ID 241118211]
project: This work was supported by Czech Science Foundation grant GA 19-08554S, and by German Science Foundation grant 413902284.

10. GREGOR, Petr, MÜTZE, Torsten, NAMRATA. Combinatorial generation via permutation languages. VI., Binary trees. European journal of combinatorics. Dec. 2024, vol. 122, str. 1-41, ilustr. ISSN 0195-6698. DOI: 10.1016/j.ejc.2024.104020. [COBISS.SI-ID 241055235]

11. GREGOR, Petr, MERINO, Arturo, MÜTZE, Torsten. The Hamilton Compression of Highly Symmetric Graphs. Annals of combinatorics. Mar. 2024, vol. 28, iss. 2, str. 379–437. ISSN 0218-0006. https://link.springer.com/article/10.1007/s00026-023-00674-y, DOI: 10.1007/s00026-023-00674-y. [COBISS.SI-ID 241147139]
project: This work was supported by Czech Science Foundation grant GA 22-15272 S, and by German Science Foundation grant 413902284. Furthermore, Petr Gregor was partially supported by ARRS project P1-0383, and Arturo Merino was supported by ANID Becas Chile 2019-72200522.

12. GREGOR, Petr, MERINO, Arturo, MÜTZE, Torsten, VERCIANI, Francesco. Graphs that admit a Hamilton path are cup-stackable. Discrete mathematics. [Online ed.]. 2025, iss. 5, vol. 348, str. 1-12, ilustr. ISSN 1872-681X. DOI: 10.1016/j.disc.2024.114375. [COBISS.SI-ID 240797699]
project: This work was supported by Czech Science Foundation grant GA 22-15272S. The authors participated in the workshop Combinatorics, Algorithms and Geometry in March 2024, which was funded by German Science Foundation grant 522790373.