## Search

Now showing items 1-5 of 5

#### Tight bounds for parameterized complexity of Cluster Editing

(Dagstuhl Publishing, 2013)

In the Correlation Clustering problem, also known as Cluster Editing, we are given an undirected graph G and a positive integer k; the task is to decide whether G can be transformed into a cluster graph, i.e., a disjoint ...

#### Solving the 2-disjoint connected subgraphs problem faster than 2ⁿ

(Springer, 2014-10)

The 2-DISJOINT CONNECTED SUBGRAPHS problem, given a graph along
with two disjoint sets of terminals Z1,Z2, asks whether it is possible to find disjoint
sets A1,A2, such that Z1 ⊆ A1, Z2 ⊆ A2 and A1,A2 induce connected ...

#### Subexponential-time parameterized algorithm for Steiner tree on planar graphs

(Dagstuhl Publishing, 2013)

The well-known bidimensionality theory provides a method for designing fast, subexponential-time parameterized algorithms for a vast number of NP-hard problems on sparse graph classes such as planar graphs, bounded genus ...

#### Parameterized complexity of Eulerian deletion problems

(Springer, 2014-01)

We study a family of problems where the goal is to make a graph Eulerian,
i.e., connected and with all the vertices having even degrees, by a minimum
number of deletions. We completely classify the parameterized complexity ...

#### On cutwidth parameterized by vertex cover

(Springer, 2014-04)

We study the CUTWIDTH problem, where the input is a graph G, and the
objective is find a linear layout of the vertices that minimizes the maximum number of
edges intersected by any vertical line inserted between two ...