Dieter Kratsch
- Computational Theory and Mathematics top 0.1%
- Computer Networks and Communications top 2%
- Discrete Mathematics and Combinatorics top 1%
- Geometry and Topology top 2%
- Artificial Intelligence top 5%
- Co-authors
- Fedor V. FominTon KloksHaiko MüllerFabrizio GrandoniHans L. BodlaenderPinar HeggernesJeremy SpinradAndreas Brandstädt
- Topics
- Advanced Graph Theory Research (119 papers)Complexity and Algorithms in Graphs (74 papers)Graph Labeling and Dimension Problems (50 papers)
In The Last Decade
Dieter Kratsch
130 papers receiving 2.1k citations
Peers
Comparison fields: 5 of 69
- Computational Theory and Mathematics 1.9k
- Computer Networks and Communications 756
- Discrete Mathematics and Combinatorics 356
- Geometry and Topology 234
- Artificial Intelligence 234
Countries citing papers authored by Dieter Kratsch
This map shows the geographic impact of Dieter Kratsch'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 Dieter Kratsch with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dieter Kratsch more than expected).
Fields of papers citing papers by Dieter Kratsch
This network shows the impact of papers produced by Dieter Kratsch. 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 Dieter Kratsch. The network helps show where Dieter Kratsch may publish in the future.
Co-authorship network of co-authors of Dieter Kratsch
This figure shows the co-authorship network connecting the top 25 collaborators of Dieter Kratsch. A scholar is included among the top collaborators of Dieter Kratsch 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 Dieter Kratsch. Dieter Kratsch is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 3 | |
| 3 | 10 | |
| 4 | Open Problems of the Lorentz Workshop \Enumeration Algorithms using Structure" | 3 |
| 5 | Bicolored independent sets and bicliques. | 1 |
| 6 | 11 | |
| 7 | Linear-time certifying recognition algorithms and forbidden induced subgraphs | 33 |
| 8 | 0 | |
| 9 | 59 | |
| 10 | Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms | 51 |
| 11 | 14 | |
| 12 | On Algorithms for (P5,Gem)-Free Graphs | 2 |
| 13 | Between O(nm) and O(n alpha). | 1 |
| 14 | 18 | |
| 15 | 16 | |
| 16 | 6 | |
| 17 | 40 | |
| 18 | Ranking of Graphs | 7 |
| 19 | 15 | |
| 20 | On Partitions of Permutations into Increasing and Decreasing Subsequences. | 15 |
About Dieter Kratsch
Dieter Kratsch is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Networks and Communications, having authored 132 papers that have together received 2.2k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (119 papers), Complexity and Algorithms in Graphs (74 papers) and Graph Labeling and Dimension Problems (50 papers). The work is most often cited by research in Computational Theory and Mathematics (1.9k citations), Discrete Mathematics and Combinatorics (356 citations) and Computer Networks and Communications (756 citations). Dieter Kratsch has collaborated with scholars based in France, Germany and Norway. Frequent co-authors include Fedor V. Fomin, Ton Kloks, Haiko Müller, Fabrizio Grandoni, Hans L. Bodlaender, Pinar Heggernes, Jeremy Spinrad, Andreas Brandstädt, Lorna Stewart and Jitender S. Deogun. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing 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.