BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
1 × Germany
1 × Italy
1 × Latvia
1 × Portugal
1 × Sweden
Collaborated with:
T.Kloks F.V.Fomin F.Grandoni I.Todinca C.K.Wong H.L.Bodlaender P.A.Golovach P.Heggernes Y.Villanger H.Broersma H.Müller
Talks about:
graph (3) treewidth (2) algorithm (2) minimum (2) domin (2) fill (2) set (2) pathwidth (1) increment (1) exponenti (1)

Person: Dieter Kratsch

DBLP DBLP: Kratsch:Dieter

Contributed to:

ICALP (1) 20132013
ICALP 20052005
ICALP 20042004
ICALP 19971997
ICALP 19961996
ICALP 19931993

Wrote 6 papers:

ICALP-v1-2013-GolovachHKV #algorithm #incremental #polynomial #set
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets (PAG, PH, DK, YV), pp. 485–496.
ICALP-2005-FominGK #case study
Measure and Conquer: Domination — A Case Study (FVF, FG, DK), pp. 191–203.
ICALP-2004-FominKT #algorithm #exponential
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In (FVF, DK, IT), pp. 568–580.
ICALP-1997-BroersmaKKM #graph #independence #set
Independent Sets in Asteroidal Triple-Free Graphs (HB, TK, DK, HM), pp. 760–770.
ICALP-1996-KloksKW #graph
Minimum Fill-In on Circle and Circular-Arc Graphs (TK, DK, CKW), pp. 256–267.
ICALP-1993-BodlaenderKK #graph #permutation
Treewidth and Pathwidth of Permutation Graphs (HLB, TK, DK), pp. 114–125.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.