Archontia C. Giannopoulou

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 35

Top Topics

Tree Decomposition

Bipartite Graph

Top Venues

SIAM J. Discret. Math.

Theor. Comput. Sci.

Publications

Archontia C. Giannopoulou, Filippos Mavropoulos
A graph searching game for block treedepth and a cubic kernel by vertex cover. Theor. Comput. Sci. 1011 (2024)
Archontia C. Giannopoulou, Sebastian Wiederrecht
A Flat Wall Theorem for Matching Minors in Bipartite Graphs. STOC (2024)
Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Excluding a planar matching minor in bipartite graphs. J. Comb. Theory, Ser. B 164 (2024)
Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
Excluding Single-Crossing Matching Minors in Bipartite Graphs. SODA (2023)
Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
Directed Tangle Tree-Decompositions and Applications. SODA (2022)
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
Block Elimination Distance. Graphs Comb. 38 (5) (2022)
Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
Excluding Single-Crossing Matching Minors in Bipartite Graphs. CoRR (2022)
Spyros Angelopoulos, Nancy E. Clarke, Fedor V. Fomin, Archontia C. Giannopoulou, Roman Rabinovich
Preface to the special issue on Graph Searching: Theory and Applications. Theor. Comput. Sci. 858 (2021)
Archontia C. Giannopoulou, Sebastian Wiederrecht
A Flat Wall Theorem for Matching Minors in Bipartite Graphs. CoRR (2021)
Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Excluding a Planar Matching Minor in Bipartite Graphs. CoRR (2021)
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
Block Elimination Distance. WG (2021)
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
Block Elimination Distance. CoRR (2021)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. 35 (1) (2021)
Archontia C. Giannopoulou, Sebastian Wiederrecht
Two Disjoint Alternating Paths in Bipartite Graphs. CoRR (2021)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
A Menger-like property of tree-cut width. J. Comb. Theory, Ser. B 148 (2021)
Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
The canonical directed tree decomposition and its applications to the directed disjoint paths problem. CoRR (2020)
Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
The Directed Flat Wall Theorem. SODA (2020)
Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht
Braces of Perfect Matching Width 2. CoRR (2019)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica 81 (2) (2019)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS (2019)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Lean tree-cut decompositions: obstructions and algorithms. CoRR (2018)
Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. Theor. Comput. Sci. 689 (2017)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. ICALP (2017)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Packing and covering immersion-expansions of planar sub-cubic graphs. Eur. J. Comb. 65 (2017)
Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Matching Connectivity: On the Structure of Graphs with Perfect Matchings. Electron. Notes Discret. Math. 61 (2017)
Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
Uniform Kernelization Complexity of Hitting Forbidden Minors. ACM Trans. Algorithms 13 (3) (2017)
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP (2017)
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR (2016)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Packing and Covering Immersion Models of Planar Subcubic Graphs. WG (2016)
Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros
FPT Algorithms for Plane Completion Problems. MFCS (2016)
Archontia C. Giannopoulou, George B. Mertzios
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. SIAM J. Discret. Math. 30 (3) (2016)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Cutwidth: Obstructions and Algorithmic Aspects. IPEC (2016)
Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
Approximation. SIAM J. Discret. Math. 30 (3) (2016)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Cutwidth: obstructions and algorithmic aspects. CoRR (2016)
Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna
Linear kernels for edge deletion problems to immersion-closed graph classes. CoRR (2016)
Archontia C. Giannopoulou, George B. Mertzios
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. STACS (2015)
Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
Uniform Kernelization Complexity of Hitting Forbidden Minors. ICALP (1) (2015)
Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
. Algorithmica 73 (1) (2015)
Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs. CoRR (2015)
Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros
A Fixed Parameter Algorithm for Plane Subgraph Completion. CTW (2015)
Archontia C. Giannopoulou, Marcin Jakub Kaminski, Dimitrios M. Thilikos
Forbidding Kuratowski Graphs as Immersions. J. Graph Theory 78 (1) (2015)
Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. IPEC (2015)
Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
Uniform Kernelization Complexity of Hitting Forbidden Minors. CoRR (2015)
Archontia C. Giannopoulou, George B. Mertzios
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. CoRR (2014)
Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). FSTTCS (2014)
Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros
Effective computation of immersion obstructions for unions of graph classes. J. Comput. Syst. Sci. 80 (1) (2014)
Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
Computing Tree-Depth Faster Than 2 n. IPEC (2013)
Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation). CoRR (2013)
Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
. CoRR (2013)
Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos
Excluding Graphs as Immersions in Surface Embedded Graphs. WG (2013)
Archontia C. Giannopoulou, Dimitrios M. Thilikos
Optimizing the Graph Minors Weak Structure Theorem. SIAM J. Discret. Math. 27 (3) (2013)
Zdenek Dvorák, Archontia C. Giannopoulou, Dimitrios M. Thilikos
Forbidden graphs for tree-depth. Eur. J. Comb. 33 (5) (2012)
Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. LATIN (2012)
Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth. Discret. Appl. Math. 160 (15) (2012)
Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos
Forbidding Kuratowski Graphs as Immersions CoRR (2012)
Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros
Effective Computation of Immersion Obstructions for Unions of Graph Classes CoRR (2012)
Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros
Effective Computation of Immersion Obstructions for Unions of Graph Classes. SWAT (2012)
Archontia C. Giannopoulou, Dimitrios M. Thilikos
Optimizing the Graph Minors Weak Structure Theorem CoRR (2011)
Archontia C. Giannopoulou, Dimitrios M. Thilikos
A min-max theorem for LIFO-search. Electron. Notes Discret. Math. 38 (2011)
Archontia C. Giannopoulou, Dimitrios M. Thilikos
Obstructions for Tree-depth. Electron. Notes Discret. Math. 34 (2009)