Torsten Mütze
Impact in
-
- Advanced Combinatorial Mathematics
- Limits and Structures in Graph Theory
- Finite Group Theory Research
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
- semigroups and automata theory
Papers in
-
- Advanced Combinatorial Mathematics 36
- Limits and Structures in Graph Theory 13
- Finite Group Theory Research 2
-
- Advanced Graph Theory Research 15
- Complexity and Algorithms in Graphs 9
- semigroups and automata theory 3
- Co-authors
- Petr Gregor (7 shared papers)Reto Spöhel (6 shared papers)Dan Hefetz (1 shared paper)Aaron Williams (3 shared papers)Gustavo Alonso (1 shared paper)Patrick Stuedi (1 shared paper)Bartosz Walczak (2 shared papers)Jean Cardinal (5 shared papers)
- Journals
- European Journal of Combinatorics (4 papers)SIAM Journal on Discrete Mathematics (4 papers)Journal of Combinatorial Theory Series B (3 papers)The Electronic Journal of Combinatorics (3 papers)SIAM Journal on Computing (2 papers)
- Partner nations
- GermanyUnited KingdomSwitzerland
In The Last Decade
Torsten Mütze
57 papers receiving 373 citations
Peers
Comparison fields: 5 of 19
- Discrete Mathematics and Combinatorics 261
- Computational Theory and Mathematics 135
- Industrial and Manufacturing Engineering 23
- Computer Graphics and Computer-Aided Design 9
- Computer Networks and Communications 24
Countries citing papers authored by Torsten Mütze
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
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-authors
The 18 scholars most cited alongside Torsten Mütze, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 63 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 29 | |
| 2 | 2009 | 26 | |
| 3 | 2016 | 23 | |
| 4 | 2008 | 19 | |
| 5 | 2023 | 18 | |
| 6 | 2021 | 16 | |
| 7 | 2018 | 15 | |
| 8 | 2019 | 15 | |
| 9 | 2022 | 13 | |
| 10 | 2011 | 12 | |
| 11 | 2016 | 12 | |
| 12 | 2013 | 11 | |
| 13 | 2017 | 11 | |
| 14 | 2012 | 10 | |
| 15 | 2017 | 9 | |
| 16 | 2018 | 9 | |
| 17 | 2019 | 9 | |
| 18 | 2017 | 7 | |
| 19 | 2020 | 7 | |
| 20 | 2022 | 7 |
About Torsten Mütze
Torsten Mütze is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Industrial and Manufacturing Engineering and Computer Networks and Communications, having authored 63 papers that have together received 390 indexed citations. Recurring topics across this work include Advanced Combinatorial Mathematics (36 papers), Advanced Graph Theory Research (15 papers), Limits and Structures in Graph Theory (13 papers), Complexity and Algorithms in Graphs (9 papers), Computational Geometry and Mesh Generation (4 papers), semigroups and automata theory (3 papers), Scheduling and Optimization Algorithms (2 papers) and Finite Group Theory Research (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (261 citations), Computational Theory and Mathematics (135 citations), Industrial and Manufacturing Engineering (23 citations), Computer Graphics and Computer-Aided Design (9 citations) and Computer Networks and Communications (24 citations). Torsten Mütze has collaborated with scholars based in Germany, United Kingdom and Switzerland. Frequent co-authors include Petr Gregor, Reto Spöhel, Dan Hefetz, Aaron Williams, Gustavo Alonso, Patrick Stuedi, Bartosz Walczak, Jean Cardinal, Fabian Kühn and Sergey Kitaev. Their work appears in journals such as European Journal of Combinatorics, SIAM Journal on Discrete Mathematics, Journal of Combinatorial Theory Series B, The Electronic Journal of Combinatorics and SIAM Journal on Computing.
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.