Dieter Kratsch

Cited by

	All	Since 2019
Citations	8166	2161
h-index	50	25
i10-index	125	59

460

230

115

345

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202436 50 70 54 104 100 111 96 84 101 145 109 165 329 217 285 336 344 307 381 448 396 385 379 403 362 407 314 373 385 380 302

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
Daniel PaulusmaDepartment of Computer Science, Durham UniversityVerified email at durham.ac.uk
Ioan TodincaUniv. Orleans, FranceVerified email at univ-orleans.fr
Yngve VillangerUniversity of BergenVerified email at uib.no
Andreas BrandstädtProfessor of Computer Science, University of Rostock, Germany Verified email at uni-rostock.de
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
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
Dimitrios M. ThilikosVerified email at thilikos.info
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	721	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	319	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	239*	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	196	2006
Domination on cocomparability graphs D Kratsch, L Stewart SIAM Journal on Discrete Mathematics 6 (3), 400-417, 1993	192	1993
Measure and conquer: Domination–a case study FV Fomin, F Grandoni, D Kratsch Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005	181	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	171	2005
Finding and counting small induced subgraphs efficiently T Kloks, D Kratsch, H Müller Information Processing Letters 74 (3-4), 115-121, 2000	165	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	160	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	141*	2012
Treewidth of chordal bipartite graphs T Kloks, D Kratsch Journal of Algorithms 19 (2), 266-281, 1995	138*	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	128	1999
Domination in convex and chordal bipartite graphs P Damaschke, H Müller, D Kratsch Information Processing Letters 36 (5), 231-236, 1990	126	1990
Solving connected dominating set faster than 2^n FV Fomin, F Grandoni, D Kratsch Algorithmica 52 (2), 153-166, 2008	125	2008
Linear-time certifying recognition algorithms and forbidden induced subgraphs. P Heggernes, D Kratsch Nord. J. Comput. 14 (1-2), 87-108, 2007	124*	2007
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	113	1997
On domination problems for permutation and other graphs A Brandstädt, D Kratsch Theoretical Computer Science 54 (2-3), 181-198, 1987	112	1987
Some new techniques in design and analysis of exact (exponential) algorithms FV Fomin, F Grandoni, D Kratsch Bull. EATCS 87, 47-77, 2005	107	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