Stephan Kreutzer
-
- Advanced Graph Theory Research 32
- Complexity and Algorithms in Graphs 20
- Formal Methods in Verification 12
- semigroups and automata theory 7
-
- Limits and Structures in Graph Theory 13
-
- Computational Geometry and Mesh Generation 4
- Geometry and Topology top 10%
-
- Logic, programming, and type systems 9
- Logic, Reasoning, and Knowledge 5
- Co-authors
- Martin GroheAnuj DawarSebastian SiebertzPaul HunterS. L. HakimiErich GrädelIsolde AdlerKen‐ichi Kawarabayashi
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Networks and Communications
- Journals
- Journal of the ACM (1 paper)IEEE Transactions on Computers (1 paper)Theoretical Computer Science (5 papers)
- Partner nations
- GermanyUnited KingdomJapan
In The Last Decade
Stephan Kreutzer
46 papers receiving 538 citations
Peers
Comparison fields: 5 of 46
- Computational Theory and Mathematics 489
- Discrete Mathematics and Combinatorics 79
- Computer Networks and Communications 139
- Computer Graphics and Computer-Aided Design 21
- Geometry and Topology 52
Countries citing papers authored by Stephan Kreutzer
This map shows the geographic impact of Stephan Kreutzer'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 Stephan Kreutzer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stephan Kreutzer more than expected).
Fields of papers citing papers by Stephan Kreutzer
This network shows the impact of papers produced by Stephan Kreutzer. 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 Stephan Kreutzer. The network helps show where Stephan Kreutzer may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Stephan Kreutzer, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 1 | |
| 2 | 2024 | 0 | |
| 3 | 2023 | 1 | |
| 4 | 2018 | 18 | |
| 5 | 2017 | 1 | |
| 6 | 2017 | 7 | |
| 7 | 2015 | 2 | |
| 8 | DAG-width is PSPACE-complete | 2014 | 2 |
| 9 | 2012 | 30 | |
| 10 | 2011 | 7 | |
| 11 | Parameterized Complexity of First-Order Logic. | 2009 | 7 |
| 12 | 2008 | 45 | |
| 13 | Computing Excluded Minors | 2008 | 32 |
| 14 | Non-regular fixed-point logics and games. | 2008 | 2 |
| 15 | 2007 | 18 | |
| 16 | 2007 | 1 | |
| 17 | 2005 | 2 | |
| 18 | 2004 | 14 | |
| 19 | 2003 | 9 | |
| 20 | 1988 | 11 |
About Stephan Kreutzer
Stephan Kreutzer is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 48 papers that have together received 588 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (32 papers), Complexity and Algorithms in Graphs (20 papers), Limits and Structures in Graph Theory (13 papers), Formal Methods in Verification (12 papers), Logic, programming, and type systems (9 papers), semigroups and automata theory (7 papers), Logic, Reasoning, and Knowledge (5 papers) and Computational Geometry and Mesh Generation (4 papers). The work is most often cited by research in Computational Theory and Mathematics (489 citations), Discrete Mathematics and Combinatorics (79 citations) and Computer Networks and Communications (139 citations). Stephan Kreutzer has collaborated with scholars based in Germany, United Kingdom and Japan. Frequent co-authors include Martin Grohe, Anuj Dawar, Sebastian Siebertz, Paul Hunter, S. L. Hakimi, Erich Grädel, Isolde Adler, Ken‐ichi Kawarabayashi, Marcin Jurdziński and Krzysztof R. Apt. Their work appears in journals such as Journal of the ACM, IEEE Transactions on Computers and Theoretical Computer Science.
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.