Dieter Kratsch - Google Scholar

Cited by

	All	Since 2015
Citations	6627	2227
h-index	46	24
i10-index	121	68

460

230

115

345

1992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020 39 65 54 56 98 105 103 92 85 99 105 109 173 321 203 292 339 370 291 380 445 404 371 387 390 370 428 276

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 University and Technical University EindhovenVerified 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
Daniel PaulusmaDepartment of Computer Science, Durham UniversityVerified email at durham.ac.uk
Andreas BrandstädtProfessor of Computer Science, University of Rostock, Germany Verified email at uni-rostock.de
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 GaspersAssociate Professor, 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
Alexander LangerRWTH Aachen UniversityVerified email at cs.rwth-aachen.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 Athens, AthensVerified email at math.uoa.gr
Anthony StewartPhD Student, Durham UniversityVerified email at durham.ac.uk

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	490	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	237	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	208*	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	181	2006
Measure and conquer: domination–a case study FV Fomin, F Grandoni, D Kratsch International Colloquium on Automata, Languages, and Programming, 191-203, 2005	174	2005
Domination on cocomparability graphs D Kratsch, L Stewart SIAM Journal on Discrete Mathematics 6 (3), 400-417, 1993	161	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	143	2006
Treewidth and pathwidth of permutation graphs HL Bodlaender, T Kloks, D Kratsch SIAM Journal on Discrete Mathematics 8 (4), 606-616, 1995	143	1995
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	138	2004
Listing all minimal separators of a graph T Kloks, D Kratsch SIAM Journal on Computing 27 (3), 605-613, 1998	125*	1998
Solving connected dominating set faster than 2^n FV Fomin, F Grandoni, D Kratsch Algorithmica 52 (2), 153-166, 2008	120	2008
Finding and counting small induced subgraphs efficiently T Kloks, D Kratsch, H Müller Information Processing Letters 74 (3-4), 115-121, 2000	115	2000
Treewidth of chordal bipartite graphs T Kloks, D Kratsch Journal of Algorithms 19 (2), 266-281, 1995	114*	1995
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	113*	2012
On domination problems for permutation and other graphs A Brandstädt, D Kratsch Theoretical Computer Science 54 (2-3), 181-198, 1987	108	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	104	1997
Some new techniques in design and analysis of exact (exponential) algorithms FV Fomin, F Grandoni, D Kratsch Bulletin of the EATCS 87 (47-77), 0-288, 2005	100	2005
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	95	1999
Linear-time certifying recognition algorithms and forbidden induced subgraphs. P Heggernes, D Kratsch Nord. J. Comput. 14 (1-2), 87-108, 2007	90*	2007
On vertex ranking for permutation and other graphs JS Deogun, T Kloks, D Kratsch, H Müller Annual Symposium on Theoretical Aspects of Computer Science, 747-758, 1994	86	1994

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

Upload PDF

Follow this author

Cited by

Co-authors