Stephan Kreutzer

2.1k total citations
48 papers, 588 citations indexed

About

Stephan Kreutzer is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence. According to data from OpenAlex, Stephan Kreutzer has authored 48 papers receiving a total of 588 indexed citations (citations by other indexed papers that have themselves been cited), including 43 papers in Computational Theory and Mathematics, 13 papers in Discrete Mathematics and Combinatorics and 10 papers in Artificial Intelligence. Recurrent topics in Stephan Kreutzer's work include Advanced Graph Theory Research (32 papers), Complexity and Algorithms in Graphs (20 papers) and Limits and Structures in Graph Theory (13 papers). Stephan Kreutzer is often cited by papers focused on Advanced Graph Theory Research (32 papers), Complexity and Algorithms in Graphs (20 papers) and Limits and Structures in Graph Theory (13 papers). Stephan Kreutzer collaborates with scholars based in Germany, United Kingdom and Japan. Stephan Kreutzer's 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 and has published in prestigious journals such as Journal of the ACM, IEEE Transactions on Computers and Theoretical Computer Science.

In The Last Decade

Stephan Kreutzer

46 papers receiving 538 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Stephan Kreutzer Germany	15	489	155	139	79	52	48	588
Magnus Wahlström United Kingdom	14	384 0.8×	96 0.6×	135 1.0×	62 0.8×	9 0.2×	49	510
Jan Arne Telle Norway	16	720 1.5×	76 0.5×	343 2.5×	131 1.7×	82 1.6×	69	864
Luděk Kučera Czechia	8	177 0.4×	102 0.7×	75 0.5×	37 0.5×	29 0.6×	35	303
Vincent Vajnovszki France	8	181 0.4×	176 1.1×	81 0.6×	67 0.8×	22 0.4×	25	349
Nadia Creignou France	13	576 1.2×	285 1.8×	357 2.6×	38 0.5×	14 0.3×	46	763
Yngve Villanger Norway	17	604 1.2×	97 0.6×	233 1.7×	81 1.0×	37 0.7×	46	675
Albert Atserias Spain	12	339 0.7×	230 1.5×	184 1.3×	33 0.4×	29 0.6×	48	498
Emanuele Viola United States	14	508 1.0×	444 2.9×	115 0.8×	70 0.9×	12 0.2×	78	650
Stefan Kratsch Germany	15	553 1.1×	110 0.7×	188 1.4×	84 1.1×	15 0.3×	56	672
Benjamin Rossman United States	10	250 0.5×	215 1.4×	115 0.8×	39 0.5×	20 0.4×	34	427

Countries citing papers authored by Stephan Kreutzer

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 of co-authors of Stephan Kreutzer

This figure shows the co-authorship network connecting the top 25 collaborators of Stephan Kreutzer. A scholar is included among the top collaborators of Stephan Kreutzer 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 Stephan Kreutzer. Stephan Kreutzer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Kawarabayashi, Ken‐ichi, et al.. (2024). Packing Even Directed Circuits Quarter-Integrally. 72. 692–703. 1 indexed citations

Kreutzer, Stephan, et al.. (2024). Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem. 1–20.

Kreutzer, Stephan, et al.. (2023). Excluding a planar matching minor in bipartite graphs. Journal of Combinatorial Theory Series B. 164. 161–221. 1 indexed citations

Kreutzer, Stephan, et al.. (2018). First-Order Interpretations of Bounded Expansion Classes. arXiv (Cornell University). 18 indexed citations

Heuvel, Jan van den, et al.. (2017). Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. 1–11. 1 indexed citations

Kreutzer, Stephan, et al.. (2017). Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 7 indexed citations

Kreutzer, Stephan, et al.. (2015). Graph operations on parity games and polynomial-time algorithms. Theoretical Computer Science. 614. 97–108. 2 indexed citations

Kreutzer, Stephan, et al.. (2014). DAG-width is PSPACE-complete. 2 indexed citations

Berwanger, Dietmar, Anuj Dawar, Paul Hunter, Stephan Kreutzer, & Jan Óbdržálek. (2012). The dag-width of directed graphs. Journal of Combinatorial Theory Series B. 102(4). 900–923. 30 indexed citations

10.

Kreutzer, Stephan & Sebastian Ordyniak. (2011). Digraph decompositions and monotonicity in digraph searching. Theoretical Computer Science. 412(35). 4688–4703. 7 indexed citations

11.

Kreutzer, Stephan & Anuj Dawar. (2009). Parameterized Complexity of First-Order Logic.. Electronic colloquium on computational complexity. 16. 131. 7 indexed citations

12.

Hunter, Paul & Stephan Kreutzer. (2008). Digraph measures: Kelly decompositions, games, and orderings. Theoretical Computer Science. 399(3). 206–219. 45 indexed citations

13.

Adler, Isolde, Martin Grohe, & Stephan Kreutzer. (2008). Computing Excluded Minors. Oxford University Research Archive (ORA) (University of Oxford). 32 indexed citations

14.

Kreutzer, Stephan & Martin Lange. (2008). Non-regular fixed-point logics and games.. 423–456. 2 indexed citations

15.

Hunter, Paul & Stephan Kreutzer. (2007). Digraph measures: Kelly decompositions, games, and orderings. Symposium on Discrete Algorithms. 637–644. 18 indexed citations

16.

Dawar, Anuj & Stephan Kreutzer. (2007). Generalising automaticity to modal properties of finite structures. Theoretical Computer Science. 379(1-2). 266–285. 1 indexed citations

17.

Dawar, Anuj, Erich Grädel, & Stephan Kreutzer. (2005). Backtracking games and inflationary fixed points. Theoretical Computer Science. 350(2-3). 174–187. 2 indexed citations

18.

Kreutzer, Stephan. (2004). Expressive equivalence of least and inflationary fixed-point logic. Annals of Pure and Applied Logic. 130(1-3). 61–78. 14 indexed citations

19.

Kreutzer, Stephan. (2003). Expressive equivalence of least and inflationary fixed-point logic. 403–410. 9 indexed citations

20.

Kreutzer, Stephan & S. L. Hakimi. (1988). Distributed diagnosis and the system user. IEEE Transactions on Computers. 37(1). 71–78. 11 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