Dieter Kratsch

Navedeno

	Vse	Od leta 2019
Navedbe	8166	2161
indeks h	50	25
indeks i10	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

Javni dostop

Prikaži vse

28 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Fedor V. FominProfessor of Computer Science, University of BergenPreverjeni e-poštni naslov na uib.no
Petr GolovachUniversity of BergenPreverjeni e-poštni naslov na ii.uib.no
Pinar HeggernesProfessor of computer science, University of BergenPreverjeni e-poštni naslov na ii.uib.no
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityPreverjeni e-poštni naslov na uu.nl
Mathieu LiedloffProfesseur des Universités, université d'OrléansPreverjeni e-poštni naslov na univ-orleans.fr
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandPreverjeni e-poštni naslov na idsia.ch
Daniel PaulusmaDepartment of Computer Science, Durham UniversityPreverjeni e-poštni naslov na durham.ac.uk
Ioan TodincaUniv. Orleans, FrancePreverjeni e-poštni naslov na univ-orleans.fr
Yngve VillangerUniversity of BergenPreverjeni e-poštni naslov na uib.no
Andreas BrandstädtProfessor of Computer Science, University of Rostock, Germany Preverjeni e-poštni naslov na uni-rostock.de
Hajo BroersmaFaculty EEMCS, University of Twente, NLPreverjeni e-poštni naslov na utwente.nl
Serge GaspersProfessor, UNSW Sydney, AustraliaPreverjeni e-poštni naslov na cse.unsw.edu.au
Saket SaurabhProfessor at Institute of Mathematical SciencesPreverjeni e-poštni naslov na imsc.res.in
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaPreverjeni e-poštni naslov na kam.mff.cuni.cz
Klaus JansenProfessor, Computer Science, University of KielPreverjeni e-poštni naslov na informatik.uni-kiel.de
Zsolt TuzaMTA Rényi Institute, Budapest & University of Pannonia, VeszprémPreverjeni e-poštni naslov na dcs.uni-pannon.hu
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityPreverjeni e-poštni naslov na math2.rwth-aachen.de
Dimitrios M. ThilikosPreverjeni e-poštni naslov na thilikos.info
Gerhard WoegingerProfessor of Computer Science, RWTH AachenPreverjeni e-poštni naslov na cs.rwth-aachen.de
Henning FernauProfessor für Informatik, Universität TrierPreverjeni e-poštni naslov na uni-trier.de

Spremljaj

Dieter Kratsch

professeur d'informatique, Universite de Lorraine

Preverjeni e-poštni naslov na univ-lorraine.fr

algorithms graphs


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji