Items where Author is "Kratsch, Dieter"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 9.

Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter and Lokshtanov, Daniel and Saurabh, Saket (2013) Computing Optimal Steiner Trees in Polynomial Space. Algorithmica, 65 (3). pp. 584-604. ISSN 1432-0541

Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2009) A measure & conquer approach for the analysis of exact algorithms. Journal of the ACM, 56 (5). ISSN 0004-5411

Kratsch, Dieter and Fomin, Fedor V. and Grandoni, Fabrizio (2008) Exact Algorithms for Dominating Set. In: Encyclopedia of Algorithms. Springer.

Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2008) Faster Steiner Tree Computation in Polynomial-Space. In: ESA.

Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2008) Solving Connected Dominating Set Faster than 2^n. Algorithmica, 52 (2). pp. 153-166. ISSN 1432-0541

Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2006) Measure and conquer: a simple O(2^{0.288 n}) independent set algorithm. In: SODA.

Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2006) Solving Connected Dominating Set Faster Than 2^n. In: FSTTCS.

Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2005) Measure and Conquer: Domination - A Case Study. In: ICALP.

Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2005) Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bulletin of the European Association for Theoretical Computer Science, 87. pp. 47-77. ISSN 0252-9742

This list was generated on Tue Sep 29 00:52:12 2020 CEST.