Archontia C. Giannopoulou

activity

20112026

most citedLinear kernels for edge deletion problems to immersion-closed graph classes

12 citations · 47 across the 20 of their papers we have counts for

collaborators

Showing 2013 · cs.DSShow all

2 papers · 2 filters

cs.DS2013★ 2 cited

Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation)

Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh +1

In the Tree Deletion Set problem the input is a graph G together with an integer k. The objective is to determine whether there exists a set S of at most k vertices such that G-S i…

cs.DS2013★ 1 cited

Computing Tree-depth Faster Than $2^{n}$

Fedor V. Fomin, Archontia C. Giannopoulou, Michał Pilipczuk

A connected graph has tree-depth at most $k$ if it is a subgraph of the closure of a rooted tree whose height is at most $k$ . We give an algorithm which for a given $n$ -vertex grap…

Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation)

Computing Tree-depth Faster Than 2n

Computing Tree-depth Faster Than $2^{n}$