Items where Author is "Fomin, Fedor V."

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 Lokshtanov, Daniel and Saurabh, Saket (2012) Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica, 63 (3). pp. 692-706. ISSN 1432-0541

Fomin, Fedor V. and Lokshtanov, Daniel and Grandoni, Fabrizio and Saurabh, Saket (2010) Sharp Separation and Applications to Exact and Parameterized Algorithms. In: LATIN.

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

Fomin, Fedor V. and Grandoni, Fabrizio and Pyatkin, Artem V. and Stepanov, Alexey A. (2008) Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Transactions on Algorithms, 5 (1). ISSN 1549-6325

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 Pyatkin, Artem V. and Stepanov, Alexey A. (2005) On maximum number of minimal dominating sets in graphs. Electronic Notes in Discrete Mathematics, 22. pp. 157-162. ISSN 1571-0653

Fomin, Fedor V. and Grandoni, Fabrizio and Pyatkin, Artem V. and Stepanov, Alexey A. (2005) Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. In: ISAAC.

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