Dieter Kratsch

Cited by

	All	Since 2016
Citations	6792	2048
h-index	48	22
i10-index	120	62

440

220

110

330

19921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202124 44 59 54 49 98 103 97 79 85 97 112 108 159 322 208 292 342 362 295 378 429 404 380 392 381 374 419 343 137

Public access

View all

24 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 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
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
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified 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	516	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	249	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	210*	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	183	2006
Measure and conquer: Domination–a case study FV Fomin, F Grandoni, D Kratsch International Colloquium on Automata, Languages, and Programming, 191-203, 2005	176	2005
Domination on cocomparability graphs D Kratsch, L Stewart SIAM Journal on Discrete Mathematics 6 (3), 400-417, 1993	161	1993
Treewidth and pathwidth of permutation graphs HL Bodlaender, T Kloks, D Kratsch SIAM Journal on Discrete Mathematics 8 (4), 606-616, 1995	146	1995
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	142	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	140	2004
Listing all minimal separators of a graph T Kloks, D Kratsch SIAM Journal on Computing 27 (3), 605-613, 1998	129*	1998
Finding and counting small induced subgraphs efficiently T Kloks, D Kratsch, H Müller Information Processing Letters 74 (3-4), 115-121, 2000	127	2000
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	119*	2012
Treewidth of chordal bipartite graphs T Kloks, D Kratsch Journal of Algorithms 19 (2), 266-281, 1995	119*	1995
Solving connected dominating set faster than 2^n FV Fomin, F Grandoni, D Kratsch Algorithmica 52 (2), 153-166, 2008	118	2008
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	102	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	96	1999
Linear-time certifying recognition algorithms and forbidden induced subgraphs. P Heggernes, D Kratsch Nord. J. Comput. 14 (1-2), 87-108, 2007	94*	2007
Domination in convex and chordal bipartite graphs P Damaschke, H Müller, D Kratsch Information Processing Letters 36 (5), 231-236, 1990	85	1990

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