D. Kratsch

Publications
Influence

A measure & conquer approach for the analysis of exact algorithms

F. Fomin, F. Grandoni, D. Kratsch
Mathematics, Computer Science
JACM
1 August 2009

We show that a good choice of the measure, made in the very first stages of exact algorithms design, can have a tremendous impact on the running time bounds achievable. Expand

On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs

T. Kloks, D. Kratsch, J. Spinrad
Computer Science, Mathematics
Theor. Comput. Sci.
10 April 1997

We present O(n5R + n3R3) time algorithms to compute the treewidth, pathwidth, minimum fill-in and minimum interval graph completion of asteroidal triple-free graphs, where n is the number of vertices and R is thenumber of minimal separators of the input graph. Expand

Measure and Conquer: Domination - A Case Study

F. Fomin, F. Grandoni, D. Kratsch
Computer Science
ICALP
11 July 2005

We present a refined analysis, based on a different measure of the size of the subproblems generated and show that the same algorithm has running time O(20.850n) on n-nodes graphs. Expand

Rankings of Graphs

H. Bodlaender, J. Deogun, +4 authors Z. Tuza
Mathematics, Computer Science
SIAM J. Discret. Math.
1 February 1998

A vertex (edge) coloring $\phi:V\rightarrow \{1,2,\ldots,$ $t\}$) of a graph G=(V,E) is the smallest value of t such that G has a vertex ( edge) t-ranking. Expand

Measure and conquer: a simple O(20.288n) independent set algorithm

F. Fomin, F. Grandoni, D. Kratsch
Mathematics, Computer Science
SODA '06
22 January 2006

In this paper we apply "Measure and Conquer" to the analysis of a very simple backtracking algorithm solving the maximum independent set problem. Expand

Exact (Exponential) Algorithms for the Dominating Set Problem

F. Fomin, D. Kratsch, G. Woeginger
Mathematics, Computer Science
WG
21 June 2004

We design fast exact algorithms for the problem of computing a minimum dominating set in undirected graphs. Expand

Treewidth and Pathwidth of Permutation Graphs

H. Bodlaender, T. Kloks, D. Kratsch
Mathematics, Computer Science
SIAM J. Discret. Math.
1 November 1995

In this paper, we show that the treewidth and pathwidth of a permutation graph can be computed in polynomial time. Expand

Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms

F. Fomin, F. Grandoni, D. Kratsch
Computer Science
Bull. EATCS
2005

This survey concerns techniques in design and analysis of algo- rithms that can be used to solve NP hard problems faster than ex- haustive search algorithms (but still in exponential time). Expand

Certifying algorithms for recognizing interval graphs and permutation graphs

D. Kratsch, R. McConnell, K. Mehlhorn, J. Spinrad
Mathematics, Computer Science
SODA '03
12 January 2003

A certifying algorithm for a decision problem is an algorithm that provides a certificate with each answer that it produces. Expand

An exact algorithm for the Maximum Leaf Spanning Tree problem

H. Fernau, Joachim Kneis, +4 authors P. Rossmanith
Computer Science, Mathematics
Theor. Comput. Sci.
1 October 2011

We present an algorithm to solve the Maximum Leaf Spanning Tree problem from an exponential time viewpoint, where it is equivalent to the Connected Dominating Set problem. Expand

Recommended Authors