Archontia C. Giannopoulou

According to our database, Archontia C. Giannopoulou authored at least 36 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Excluding a planar matching minor in bipartite graphs.

Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht

J. Comb. Theory, Ser. B, January, 2024

2023

Excluding Single-Crossing Matching Minors in Bipartite Graphs.

Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Block Elimination Distance.

Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos

Graphs Comb., 2022

Directed Tangle Tree-Decompositions and Applications.

Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Preface to the special issue on Graph Searching: Theory and Applications.

Spyros Angelopoulos, Nancy E. Clarke, Fedor V. Fomin, Archontia C. Giannopoulou, Roman Rabinovich

Theor. Comput. Sci., 2021

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes.

Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna

SIAM J. Discret. Math., 2021

A Menger-like property of tree-cut width.

Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos

J. Comb. Theory, Ser. B, 2021

A Flat Wall Theorem for Matching Minors in Bipartite Graphs.

Archontia C. Giannopoulou, Sebastian Wiederrecht

CoRR, 2021

Two Disjoint Alternating Paths in Bipartite Graphs.

Archontia C. Giannopoulou, Sebastian Wiederrecht

CoRR, 2021

2020

The canonical directed tree decomposition and its applications to the directed disjoint paths problem.

Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon

CoRR, 2020

The Directed Flat Wall Theorem.

Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Braces of Perfect Matching Width 2.

Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht

CoRR, 2019

Cutwidth: Obstructions and Algorithmic Aspects.

Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna

Algorithmica, 2019

Lean Tree-Cut Decompositions: Obstructions and Algorithms.

Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2017

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs.

Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier

Theor. Comput. Sci., 2017

Uniform Kernelization Complexity of Hitting Forbidden Minors.

Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh

ACM Trans. Algorithms, 2017

Matching Connectivity: On the Structure of Graphs with Perfect Matchings.

Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht

Electron. Notes Discret. Math., 2017

Packing and covering immersion-expansions of planar sub-cubic graphs.

Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos

Eur. J. Comb., 2017

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs.

Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs.

Archontia C. Giannopoulou, George B. Mertzios

SIAM J. Discret. Math., 2016

Tree Deletion Set Has a Polynomial Kernel but No OPT^<i>O</i>(1) Approximation.

Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý

SIAM J. Discret. Math., 2016

Packing and Covering Immersion Models of Planar Subcubic Graphs.

Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

FPT Algorithms for Plane Completion Problems.

Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Forbidding Kuratowski Graphs as Immersions.

Archontia C. Giannopoulou, Marcin Jakub Kaminski, Dimitrios M. Thilikos

J. Graph Theory, 2015

Computing Tree-Depth Faster Than 2ⁿ.

Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk

Algorithmica, 2015

A Fixed Parameter Algorithm for Plane Subgraph Completion.

Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Effective computation of immersion obstructions for unions of graph classes.

Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros

J. Comput. Syst. Sci., 2014

Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation).

Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Optimizing the Graph Minors Weak Structure Theorem.

Archontia C. Giannopoulou, Dimitrios M. Thilikos

SIAM J. Discret. Math., 2013

Excluding Graphs as Immersions in Surface Embedded Graphs.

Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Computing Tree-Depth Faster Than 2 n.

Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012

Forbidden graphs for tree-depth.

Zdenek Dvorák, Archontia C. Giannopoulou, Dimitrios M. Thilikos

Eur. J. Comb., 2012

LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.

Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos

Discret. Appl. Math., 2012

New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting.

Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

A min-max theorem for LIFO-search.

Archontia C. Giannopoulou, Dimitrios M. Thilikos

Electron. Notes Discret. Math., 2011

2009

Obstructions for Tree-depth.

Archontia C. Giannopoulou, Dimitrios M. Thilikos

Electron. Notes Discret. Math., 2009