Dieter Kratsch

Cited by

	All	Since 2017
Citations	7342	2161
h-index	49	23
i10-index	125	65

460

230

115

345

199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220 45 61 63 52 98 99 98 91 82 96 110 106 159 323 212 285 346 361 306 377 453 411 378 392 409 367 405 318 397 263

Public access

View all

27 articles

6 articles

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 Liedloffmaître de conférences HdR, université d'OrléansVerified email at univ-orleans.fr
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandVerified email at idsia.ch
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
Ioan TodincaUniv. Orleans, FranceVerified email at univ-orleans.fr
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
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de
Klaus JansenProfessor, Computer Science, University of KielVerified email at informatik.uni-kiel.de
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityVerified email at math2.rwth-aachen.de
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensVerified email at thilikos.info
Anthony StewartPhD Student, Durham UniversityVerified email at durham.ac.uk
Alexander LangerRWTH Aachen UniversityVerified email at cs.rwth-aachen.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	583	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	279	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	218*	1998
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	189	2006
Measure and conquer: Domination–a case study FV Fomin, F Grandoni, D Kratsch International Colloquium on Automata, Languages, and Programming, 191-203, 2005	182	2005
Domination on cocomparability graphs D Kratsch, L Stewart SIAM Journal on Discrete Mathematics 6 (3), 400-417, 1993	174	1993
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	156	2006
Exact (exponential) algorithms for the dominating set problem FV Fomin, D Kratsch, GJ Woeginger International Workshop on Graph-Theoretic Concepts in Computer Science, 245-256, 2004	152	2004
Treewidth and pathwidth of permutation graphs HL Bodlaender, T Kloks, D Kratsch SIAM Journal on Discrete Mathematics 8 (4), 606-616, 1995	148	1995
Finding and counting small induced subgraphs efficiently T Kloks, D Kratsch, H Müller Information Processing Letters 74 (3-4), 115-121, 2000	140	2000
Listing all minimal separators of a graph T Kloks, D Kratsch SIAM Journal on Computing 27 (3), 605-613, 1998	136*	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	129*	2012
Solving connected dominating set faster than 2^n FV Fomin, F Grandoni, D Kratsch Algorithmica 52 (2), 153-166, 2008	123	2008
Treewidth of chordal bipartite graphs T Kloks, D Kratsch Journal of Algorithms 19 (2), 266-281, 1995	123*	1995
On domination problems for permutation and other graphs A Brandstädt, D Kratsch Theoretical Computer Science 54 (2-3), 181-198, 1987	109	1987
Some new techniques in design and analysis of exact (exponential) algorithms FV Fomin, F Grandoni, D Kratsch Bull. EATCS 87, 47-77, 2005	105	2005
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	104	1997
Linear-time certifying recognition algorithms and forbidden induced subgraphs. P Heggernes, D Kratsch Nord. J. Comput. 14 (1-2), 87-108, 2007	103*	2007
Domination in convex and chordal bipartite graphs P Damaschke, H Müller, D Kratsch Information Processing Letters 36 (5), 231-236, 1990	103	1990
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	101	1999

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