World's Best Scientists 2026 revealed!
Award Badge
Computer Science
France
2023

D-Index & Metrics

Computer Science

D-Index
49
Citations
7208
World Ranking
5980
National Ranking
124

Mathematics

D-Index
49
Citations
7182
World Ranking
1167
National Ranking
60

Research.com Recognitions

  • 2023 - Research.com Computer Science in France Leader Award

Overview

Dieter Kratsch is affiliated with the University of Lorraine in France, contributing to the field of Computer Science with a focus on computational theory, algorithms, and graph-related studies.

Their research spans multiple subfields within computer science, including:

  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Computer Networks and Communications

Kratsch's work centers primarily on advanced topics such as:

  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Machine Learning and Algorithms
  • Constraint Satisfaction and Optimization

Their recent publications include two closely related papers published in 2021:

  • "Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration," published in arXiv (Cornell University)
  • "Refined notions of parameterized enumeration kernels with applications to matching cut enumeration," in the Journal of Computer and System Sciences

These contributions explore refined concepts in parameterized enumeration kernels with practical applications in enumerating matching cuts, contributing to theoretical computer science literature.

Frequent collaborators in Kratsch's research include:

  • Petr A. Golovach
  • Christian Komusiewicz
  • Van Bang Lê

Their publications have appeared in venues such as:

  • arXiv (Cornell University)
  • Journal of Computer and System Sciences

Best Publications

  • A measure & conquer approach for the analysis of exact algorithms

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Rankings of graphs

    H. L. Bodlaender;Jitender S Deogun;K. Jansen;T. Kloks

  • Measure and conquer: a simple O(20.288n) independent set algorithm

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Measure and conquer: domination – a case study

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Domination on cocomparability graphs

    Dieter Kratsch;Lorna Stewart

  • Rankings of Graphs

    Hans L. Bodlaender;Jitender S. Deogun;Klaus Jansen;Ton Kloks

  • Exact (exponential) algorithms for the dominating set problem

    Fedor V. Fomin;Dieter Kratsch;Gerhard J. Woeginger

  • Finding and counting small induced subgraphs efficiently

    Ton Kloks;Dieter Kratsch;Haiko Müller

  • Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs

    Dieter Kratsch;Ross M. McConnell;Kurt Mehlhorn;Jeremy P. Spinrad

  • Treewidth and Pathwidth of Permutation Graphs

    Hans L. Bodlaender;Ton Kloks;Dieter Kratsch

  • Solving Connected Dominating Set Faster than 2 n

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Listing all Minimal Separators of a Graph

    T. Kloks;D. Kratsch

  • Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • On domination problems for permutation and other graphs

    Andreas Brandstädt;Dieter Kratsch

  • Domination in convex and chordal bipartite graphs

    Peter Damaschke;Haiko Müller;Dieter Kratsch

  • Independent Sets in Asteroidal Triple-Free Graphs

    Hajo Broersma;Ton Kloks;Dieter Kratsch;Haiko Müller

  • Treewidth of chordal bipartite graphs

    T. Kloks;D. Kratsch

  • On treewidth and minimum fill-in of asteroidal triple-free graphs

    Ton Kloks;Dieter Kratsch;Jeremy Spinrad

  • Approximating the Bandwidth for Asteroidal Triple-Free Graphs

    Ton Kloks;Dieter Kratsch;Haiko Müller

  • On Vertex Ranking for Permutations and Other Graphs

    Jitender S. Deogun;Ton Kloks;Dieter Kratsch;Haiko Müller

  • Treewidth and pathwidth of permutation graphs

    H.L. Bodlaender;A.J.J. Kloks;D. Kratsch

Frequent Co-Authors

Fedor V. Fomin
Fedor V. Fomin University of Bergen
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University
Daniël Paulusma
Daniël Paulusma Durham University
Andreas Brandstädt
Andreas Brandstädt University of Rostock
Jitender S. Deogun
Jitender S. Deogun University of Nebraska–Lincoln
Fabrizio Grandoni
Fabrizio Grandoni Dalle Molle Institute for Artificial Intelligence Research
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Henning Fernau
Henning Fernau University of Trier
Jan Kratochvíl
Jan Kratochvíl Charles University
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Students pursuing Mathematics often explore complementary fields to expand career opportunities. For those interested in finance, many opt for masters in finance online programs, which offer a practical application of mathematical theories in financial analysis and risk management.

Business-minded individuals can also benefit from enrolling in accelerated MBA programs online. These allow students to quickly gain leadership and management skills that complement a quantitative background.

Marketing is another dynamic field where analytical skills are highly valued. For students looking for cost-effective options with good earning potential, the cheapest online marketing degree programs provide valuable insight into market trends and consumer data analysis.

Finally, for those prioritizing efficiency, some choose 12 month MBA programs that deliver comprehensive business education in a condensed time frame, helping students jumpstart their careers without prolonged study periods.

Best Scientists Citing Dieter Kratsch

Trending Scientists

Recently Published Articles