A
Archontia C. Giannopoulou
Researcher at National and Kapodistrian University of Athens
Publications - 62
Citations - 516
Archontia C. Giannopoulou is an academic researcher from National and Kapodistrian University of Athens. The author has contributed to research in topics: Treewidth & Planar graph. The author has an hindex of 11, co-authored 60 publications receiving 446 citations. Previous affiliations of Archontia C. Giannopoulou include University of Bergen & University of Warsaw.
Papers
More filters
Proceedings ArticleDOI
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs
Kord Eickmeyer,Archontia C. Giannopoulou,Stephan Kreutzer,O-joung Kwon,Michał Pilipczuk,Roman Rabinovich,Sebastian Siebertz +6 more
TL;DR: In this paper, it was shown that for every fixed integer r, the parameterized distance dominating set problem admits an almost linear kernel on any nowhere dense graph class, and that the limit of parameterized tractability of DDS on subgraph-closed graph classes lies exactly on the boundary between nowhere denseness and somewhere denseness.
Journal ArticleDOI
Forbidden graphs for tree-depth
TL;DR: The set of graphs not belonging in G"k that are minimal with respect to the minor/subgraph/induced subgraph relation (obstructions of G" k) is studied and a structural lemma for creating obstructions from simpler ones is proved.
Journal ArticleDOI
Polynomial fixed-parameter algorithms : a case study for longest path on interval graphs.
TL;DR: This work studies the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time, and shows how to solve Longest Path on Interval Graphs, parameterized by vertex deletion number k to proper interval graphs, in O(k9n) time.
Posted Content
Uniform Kernelization Complexity of Hitting Forbidden Minors
TL;DR: It is proved that some Planar F-Minor-Free Deletion problems do not have uniformly polynomial kernels (unless NP ⊆ coNP/poly), not even when parameterized by the vertex cover number.
Journal ArticleDOI
Uniform Kernelization Complexity of Hitting Forbidden Minors
TL;DR: In this article, it was shown that planar F-minior-free deletion problems do not have uniformly polynomial kernels, unless NP ⊆ coNP/poly, not even when parameterized by the vertex cover number.