Torsten Mütze

420 total citations
34 papers, 147 citations indexed

About

Torsten Mütze is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Torsten Mütze has authored 34 papers receiving a total of 147 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 20 papers in Discrete Mathematics and Combinatorics and 12 papers in Electrical and Electronic Engineering. Recurrent topics in Torsten Mütze's work include graph theory and CDMA systems (12 papers), Advanced Graph Theory Research (12 papers) and Limits and Structures in Graph Theory (12 papers). Torsten Mütze is often cited by papers focused on graph theory and CDMA systems (12 papers), Advanced Graph Theory Research (12 papers) and Limits and Structures in Graph Theory (12 papers). Torsten Mütze collaborates with scholars based in Germany, United Kingdom and Switzerland. Torsten Mütze's co-authors include Dan Hefetz, Petr Gregor, Bartosz Walczak, Aaron Williams, Sergey Kitaev and Jean Cardinal and has published in prestigious journals such as European Journal of Operational Research, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Torsten Mütze

28 papers receiving 144 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Torsten Mütze Germany 7 93 52 40 32 24 34 147
Rudi Pendavingh Netherlands 7 89 1.0× 43 0.8× 19 0.5× 24 0.8× 4 0.2× 26 138
Jean-Luc Baril France 6 69 0.7× 78 1.5× 34 0.8× 60 1.9× 2 0.1× 34 126
Charis Papadopoulos Greece 8 145 1.6× 39 0.8× 17 0.4× 9 0.3× 4 0.2× 31 167
Michael Dom Germany 6 108 1.2× 11 0.2× 17 0.4× 15 0.5× 6 0.3× 10 122
Luis Cereceda United Kingdom 5 201 2.2× 64 1.2× 30 0.8× 7 0.2× 3 0.1× 7 206
Aline Parreau France 7 121 1.3× 44 0.8× 33 0.8× 27 0.8× 25 151
Arnfried Kemnitz Germany 10 210 2.3× 142 2.7× 35 0.9× 9 0.3× 2 0.1× 39 251
Andrzej Grzesik Poland 7 127 1.4× 124 2.4× 24 0.6× 17 0.5× 2 0.1× 25 152
Mathilde Bouvel France 8 59 0.6× 97 1.9× 21 0.5× 84 2.6× 24 149
Alexey Pokrovskiy United Kingdom 7 100 1.1× 90 1.7× 45 1.1× 5 0.2× 2 0.1× 23 130

Countries citing papers authored by Torsten Mütze

Since Specialization
Citations

This map shows the geographic impact of Torsten Mütze's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Torsten Mütze with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Torsten Mütze more than expected).

Fields of papers citing papers by Torsten Mütze

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Torsten Mütze. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Torsten Mütze. The network helps show where Torsten Mütze may publish in the future.

Co-authorship network of co-authors of Torsten Mütze

This figure shows the co-authorship network connecting the top 25 collaborators of Torsten Mütze. A scholar is included among the top collaborators of Torsten Mütze based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Torsten Mütze. Torsten Mütze is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Mütze, Torsten, et al.. (2024). Traversing Combinatorial 0/1-Polytopes via Optimization. SIAM Journal on Computing. 53(5). 1257–1292.
2.
Gregor, Petr, et al.. (2023). The Hamilton Compression of Highly Symmetric Graphs. Annals of Combinatorics. 28(2). 379–437. 2 indexed citations
3.
Mütze, Torsten. (2023). A Book Proof of the Middle Levels Theorem. COMBINATORICA. 44(1). 205–208.
4.
Gregor, Petr, et al.. (2023). Star transposition Gray codes for multiset permutations. Journal of Graph Theory. 103(2). 212–270. 1 indexed citations
5.
Mütze, Torsten, et al.. (2023). Traversing combinatorial 0/1-polytopes via optimization. Warwick Research Archive Portal (University of Warwick).
6.
Mütze, Torsten, et al.. (2023). Kneser Graphs Are Hamiltonian. 963–970. 3 indexed citations
7.
Mütze, Torsten. (2023). Combinatorial Gray Codes — an Updated Survey. The Electronic Journal of Combinatorics. 1000. 9 indexed citations
8.
Mütze, Torsten, et al.. (2022). Combinatorial generation via permutation languages. I. Fundamentals. Warwick Research Archive Portal (University of Warwick). 8 indexed citations
9.
Mütze, Torsten, et al.. (2022). Combinatorial Generation via Permutation Languages. III. Rectangulations. Discrete & Computational Geometry. 70(1). 51–122. 5 indexed citations
10.
Mütze, Torsten, et al.. (2021). Efficient Generation of Rectangulations via Permutation Languages. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
11.
Mütze, Torsten, et al.. (2018). Sparse Kneser graphs are Hamiltonian. Warwick Research Archive Portal (University of Warwick). 912–919. 5 indexed citations
12.
Kitaev, Sergey, et al.. (2017). On universal partial words. Discrete Mathematics & Theoretical Computer Science. Vol. 19 no. 1(Combinatorics). 2 indexed citations
13.
Mütze, Torsten, et al.. (2017). A minimum-change version of the Chung–Feller theorem for Dyck paths. European Journal of Combinatorics. 69. 260–275. 4 indexed citations
14.
Gregor, Petr & Torsten Mütze. (2017). Trimming and gluing Gray codes. Theoretical Computer Science. 714. 74–95. 3 indexed citations
15.
Mütze, Torsten. (2013). Scheduling with few changes. European Journal of Operational Research. 236(1). 37–50. 11 indexed citations
16.
Mütze, Torsten, et al.. (2012). Construction of 2-factors in the middle layer of the discrete cube. Journal of Combinatorial Theory Series A. 119(8). 1832–1855. 5 indexed citations
17.
Mütze, Torsten, et al.. (2012). Coloring random graphs online without creating monochromatic subgraphs. Random Structures and Algorithms. 44(4). 419–464. 1 indexed citations
18.
Mütze, Torsten, et al.. (2011). Small subgraphs in random graphs and the power of multiple choices. Journal of Combinatorial Theory Series B. 101(4). 237–268. 7 indexed citations
19.
Mütze, Torsten, et al.. (2011). On the Path-Avoidance Vertex-Coloring Game. The Electronic Journal of Combinatorics. 18(1). 4 indexed citations
20.
Mütze, Torsten, et al.. (2011). Coloring random graphs online without creating monochromatic subgraphs. 145–158. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Rudi Pendavingh Breakdown of academic impact, for papers by Jean-Luc Baril Breakdown of academic impact, for papers by Charis Papadopoulos Breakdown of academic impact, for papers by Michael Dom Breakdown of academic impact, for papers by Luis Cereceda Breakdown of academic impact, for papers by Aline Parreau Breakdown of academic impact, for papers by Arnfried Kemnitz Breakdown of academic impact, for papers by Andrzej Grzesik Breakdown of academic impact, for papers by Mathilde Bouvel Breakdown of academic impact, for papers by Alexey Pokrovskiy
Rankless by CCL
2026