Dieter Kratsch

Citata da

	Tutte	Dal 2020
Citazioni	8284	1856
Indice H	50	22
i10-index	128	53

460

230

115

345

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202537 50 70 54 104 100 111 96 84 102 145 109 166 329 217 285 336 349 308 381 449 396 385 380 403 368 407 313 371 388 371 364 49

Accesso pubblico

Visualizza tutto

28 articoli

1 articolo

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Fedor V. FominProfessor of Computer Science, University of BergenEmail verificata su uib.no
Petr GolovachUniversity of BergenEmail verificata su ii.uib.no
Pinar HeggernesProfessor of computer science, University of BergenEmail verificata su ii.uib.no
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityEmail verificata su uu.nl
Mathieu LiedloffProfesseur des Universités, université d'OrléansEmail verificata su univ-orleans.fr
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandEmail verificata su idsia.ch
Daniel PaulusmaDepartment of Computer Science, Durham UniversityEmail verificata su durham.ac.uk
Ioan TodincaUniv. Orleans, FranceEmail verificata su univ-orleans.fr
Yngve VillangerUniversity of BergenEmail verificata su uib.no
Andreas BrandstädtProfessor of Computer Science, University of Rostock, Germany Email verificata su uni-rostock.de
Hajo BroersmaFaculty EEMCS, University of Twente, NLEmail verificata su utwente.nl
Serge GaspersProfessor, UNSW Sydney, AustraliaEmail verificata su cse.unsw.edu.au
Saket SaurabhProfessor at Institute of Mathematical SciencesEmail verificata su imsc.res.in
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaEmail verificata su kam.mff.cuni.cz
Klaus JansenProfessor, Computer Science, University of KielEmail verificata su informatik.uni-kiel.de
Zsolt TuzaMTA Rényi Institute, Budapest & University of Pannonia, VeszprémEmail verificata su dcs.uni-pannon.hu
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityEmail verificata su math2.rwth-aachen.de
Dimitrios M. ThilikosEmail verificata su thilikos.info
Gerhard WoegingerProfessor of Computer Science, RWTH AachenEmail verificata su cs.rwth-aachen.de
Henning FernauProfessor für Informatik, Universität TrierEmail verificata su uni-trier.de

Segui

Dieter Kratsch

professeur d'informatique, Universite de Lorraine

Email verificata su univ-lorraine.fr

algorithms graphs


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Exact Exponential Algorithms FV Fomin, D Kratsch	736	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	326	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	244*	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	201	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	182	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	173	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	161	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	142*	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	131	1999
Domination in convex and chordal bipartite graphs P Damaschke, H Müller, D Kratsch Information Processing Letters 36 (5), 231-236, 1990	129	1990
Solving connected dominating set faster than 2^n FV Fomin, F Grandoni, D Kratsch Algorithmica 52 (2), 153-166, 2008	126	2008
Linear-time certifying recognition algorithms and forbidden induced subgraphs. P Heggernes, D Kratsch Nord. J. Comput. 14 (1-2), 87-108, 2007	126*	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	113	1987
Some new techniques in design and analysis of exact (exponential) algorithms FV Fomin, F Grandoni, D Kratsch Bull. EATCS 87, 47-77, 2005	108	2005

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori