Dieter Kratsch

Cited by

	All	Since 2020
Citations	8351	1876
h-index	50	22
i10-index	129	53

460

230

115

345

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202539 50 67 57 103 100 109 96 82 102 145 110 164 336 215 283 335 358 309 389 458 402 384 385 402 372 411 313 366 389 374 343 91

Public access

View all

28 articles

1 article

available

not available

Based on funding mandates

Co-authors

Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityVerified email at uu.nl
Mathieu LiedloffProfesseur des Universités, université d'OrléansVerified email at univ-orleans.fr
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandVerified email at idsia.ch
Ioan TodincaUniv. Orleans, FranceVerified email at univ-orleans.fr
Andreas BrandstädtProfessor of Computer Science, University of Rostock, Germany Verified email at uni-rostock.de
Daniel PaulusmaDepartment of Computer Science, Durham UniversityVerified email at durham.ac.uk
Yngve VillangerUniversity of BergenVerified email at uib.no
Hajo BroersmaFaculty EEMCS, University of Twente, NLVerified email at utwente.nl
Serge GaspersProfessor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaVerified email at kam.mff.cuni.cz
Klaus JansenProfessor, Computer Science, University of KielVerified email at informatik.uni-kiel.de
Dimitrios M. ThilikosNational and Kapodistrian University of AthensVerified email at thilikos.info
Zsolt TuzaMTA Rényi Institute, Budapest & University of Pannonia, VeszprémVerified email at dcs.uni-pannon.hu
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityVerified email at math2.rwth-aachen.de
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de

Dieter Kratsch

professeur d'informatique, Universite de Lorraine

Verified email at univ-lorraine.fr

algorithms graphs


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Exact Exponential Algorithms FV Fomin, D Kratsch	738	2010
A measure & conquer approach for the analysis of exact algorithms FV Fomin, F Grandoni, D Kratsch Journal of the ACM (JACM) 56 (5), 1-32, 2009	332	2009
Rankings of graphs HL Bodlaender, JS Deogun, K Jansen, T Kloks, D Kratsch, H Müller, ... SIAM Journal on Discrete Mathematics 11 (1), 168-181, 1998	245*	1998
Treewidth and pathwidth of permutation graphs HL Bodlaender, T Kloks, D Kratsch SIAM Journal on Discrete Mathematics 8 (4), 606-616, 1995	211	1995
Measure and conquer: a simple O (2^0.288 n) independent set algorithm FV Fomin, F Grandoni, D Kratsch Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006	202	2006
Domination on cocomparability graphs D Kratsch, L Stewart SIAM Journal on Discrete Mathematics 6 (3), 400-417, 1993	189	1993
Measure and conquer: Domination–a case study FV Fomin, F Grandoni, D Kratsch International Colloquium on Automata, Languages, and Programming, 191-203, 2005	183	2005
Exact (exponential) algorithms for the dominating set problem FV Fomin, D Kratsch, GJ Woeginger Graph-Theoretic Concepts in Computer Science: 30th International Workshop …, 2005	175	2005
Finding and counting small induced subgraphs efficiently T Kloks, D Kratsch, H Müller Information Processing Letters 74 (3-4), 115-121, 2000	167	2000
Certifying algorithms for recognizing interval graphs and permutation graphs D Kratsch, RM McConnell, K Mehlhorn, JP Spinrad SIAM Journal on Computing 36 (2), 326-353, 2006	164	2006
Listing all minimal separators of a graph T Kloks, D Kratsch SIAM Journal on Computing 27 (3), 605-613, 1998	151*	1998
On exact algorithms for treewidth HL Bodlaender, FV Fomin, AMCA Koster, D Kratsch, DM Thilikos ACM Transactions on Algorithms (TALG) 9 (1), 1-23, 2012	145*	2012
Treewidth of chordal bipartite graphs T Kloks, D Kratsch Journal of Algorithms 19 (2), 266-281, 1995	140*	1995
Independent sets in asteroidal triple-free graphs H Broersma, T Kloks, D Kratsch, H Müller SIAM Journal on Discrete Mathematics 12 (2), 276-287, 1999	133	1999
Domination in convex and chordal bipartite graphs P Damaschke, H Müller, D Kratsch Information Processing Letters 36 (5), 231-236, 1990	132	1990
Linear-time certifying recognition algorithms and forbidden induced subgraphs. P Heggernes, D Kratsch Nord. J. Comput. 14 (1-2), 87-108, 2007	130*	2007
Solving connected dominating set faster than 2^n FV Fomin, F Grandoni, D Kratsch Algorithmica 52 (2), 153-166, 2008	127	2008
On domination problems for permutation and other graphs A Brandstädt, D Kratsch Theoretical Computer Science 54 (2-3), 181-198, 1987	117	1987
On treewidth and minimum fill-in of asteroidal triple-free graphs T Kloks, D Kratsch, J Spinrad Theoretical Computer Science 175 (2), 309-335, 1997	112	1997
Some new techniques in design and analysis of exact (exponential) algorithms FV Fomin, F Grandoni, D Kratsch Bull. EATCS 87, 47-77, 2005	111	2005

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors