Dieter Kratsch

6.1k total citations
132 papers, 2.2k citations indexed

About

Dieter Kratsch is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Dieter Kratsch has authored 132 papers receiving a total of 2.2k indexed citations (citations by other indexed papers that have themselves been cited), including 123 papers in Computational Theory and Mathematics, 43 papers in Computer Networks and Communications and 29 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Dieter Kratsch's work include Advanced Graph Theory Research (119 papers), Complexity and Algorithms in Graphs (74 papers) and Graph Labeling and Dimension Problems (50 papers). Dieter Kratsch is often cited by papers focused on Advanced Graph Theory Research (119 papers), Complexity and Algorithms in Graphs (74 papers) and Graph Labeling and Dimension Problems (50 papers). Dieter Kratsch collaborates with scholars based in France, Germany and Norway. Dieter Kratsch's 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 and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Dieter Kratsch

130 papers receiving 2.1k citations

Peers

Dieter Kratsch

CTM

CNC

DMC

Jeremy Spinrad United States

Ton Kloks Netherlands

Daniel Lokshtanov Norway

Andreas Brandstädt Germany

Dimitrios M. Thilikos Greece

Andrzej Proskurowski United States

Van Bang Lê Germany

Fǎnicǎ Gavril Israel

Douglas B. West United States

Michał Pilipczuk Poland

Jeremy Spinrad United States

Dieter Kratsch

2.2k ×1.1

CTM

763 ×1.0

CNC

474 ×1.3

DMC

344 ×1.5

Citations per year, relative to Dieter Kratsch Dieter Kratsch (= 1×) peers Jeremy Spinrad

Countries citing papers authored by Dieter Kratsch

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

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

20 of 20 papers shown

Golovach, Petr A., Christian Komusiewicz, Dieter Kratsch, & Van Bang Lê. (2021). Refined Notions of Parameterized Enumeration Kernels with Applications\n to Matching Cut Enumeration. arXiv (Cornell University). 1 indexed citations

Kratsch, Dieter, et al.. (2017). Exact algorithms for weak Roman domination. Discrete Applied Mathematics. 248. 79–92. 3 indexed citations

Golovach, Petr A., Pinar Heggernes, & Dieter Kratsch. (2016). Enumeration and Maximum Number of Minimal Connected Vertex Covers in\n Graphs. arXiv (Cornell University). 10 indexed citations

Bodlaender, Hans L., Endre Boros, Pinar Heggernes, & Dieter Kratsch. (2015). Open Problems of the Lorentz Workshop \Enumeration Algorithms using Structure". Utrecht University Repository (Utrecht University). 3 indexed citations

Kratsch, Dieter, et al.. (2011). Bicolored independent sets and bicliques.. 130–133. 1 indexed citations

Fomin, Fedor V., Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, & Saket Saurabh. (2009). Iterative compression and exact algorithms. Theoretical Computer Science. 411(7-9). 1045–1053. 11 indexed citations

Heggernes, Pinar & Dieter Kratsch. (2007). Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nordic journal of computing. 14(1). 87–108. 33 indexed citations

Brandstädt, Andreas, Dieter Kratsch, & Haiko Müller. (2007). Graph-theoretic concepts in computer science : 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007 : revised papers. DIAL (Catholic University of Leuven).

Fomin, Fedor V., Fabrizio Grandoni, & Dieter Kratsch. (2006). Measure and conquer: a simple O(20.288n) independent set algorithm. Symposium on Discrete Algorithms. 18–25. 59 indexed citations

10.

Fomin, Fedor V., Fabrizio Grandoni, & Dieter Kratsch. (2005). Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bulletin of the European Association for Theoretical Computer Science. 87. 47–77. 51 indexed citations

11.

Bodlaender, Hans L., Andreas Brandstädt, Dieter Kratsch, Michaël Rao, & Jeremy Spinrad. (2005). On algorithms for (P5,gem)-free graphs. Theoretical Computer Science. 349(1). 2–21. 14 indexed citations

12.

Bodlaender, Hans L., et al.. (2003). On Algorithms for (P5,Gem)-Free Graphs. Utrecht University Repository (Utrecht University). 2 indexed citations

13.

Kratsch, Dieter & Jeremy Spinrad. (2003). Between O(nm) and O(n alpha).. Symposium on Discrete Algorithms. 709–716. 1 indexed citations

14.

Kratsch, Dieter, Ross M. McConnell, Kurt Mehlhorn, & Jeremy Spinrad. (2003). Certifying algorithms for recognizing interval graphs and permutation graphs. Symposium on Discrete Algorithms. 158–167. 18 indexed citations

15.

Kratsch, Dieter & Jeremy Spinrad. (2003). Between O(nm) and O(nα). Symposium on Discrete Algorithms. 709–716. 16 indexed citations

16.

Fomin, Fedor V., Dieter Kratsch, & Haiko Müller. (2003). On the domination search number. Discrete Applied Mathematics. 127(3). 565–580. 6 indexed citations

17.

Kloks, Ton, Dieter Kratsch, & Jeremy Spinrad. (1997). On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoretical Computer Science. 175(2). 309–335. 40 indexed citations

18.

Bodlaender, Hans L., Klaus Jansen, Ton Kloks, et al.. (1994). Ranking of Graphs. 292–304. 7 indexed citations

19.

Gimbel, John, Dieter Kratsch, & Lorna Stewart. (1994). On cocolourings and cochromatic numbers of graphs. Discrete Applied Mathematics. 48(2). 111–127. 15 indexed citations

20.

Brandstädt, Andreas & Dieter Kratsch. (1986). On Partitions of Permutations into Increasing and Decreasing Subsequences.. Journal of automata, languages and combinatorics. 22. 263–273. 15 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