Obstructions for Tree-depth. - Archontia C. Giannopoulou; Dimitrios M. Thilikos (Electron. Notes Discret. Math., 2009)

A min-max theorem for LIFO-search. - Archontia C. Giannopoulou; Dimitrios M. Thilikos (Electron. Notes Discret. Math., 2011)

New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. - Archontia C. Giannopoulou; Sudeshna Kolay; Saket Saurabh 001 (LATIN, 2012)

LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth. - Archontia C. Giannopoulou; Paul Hunter 001; Dimitrios M. Thilikos (Discret. Appl. Math., 2012)

Forbidden graphs for tree-depth. - Zdenek Dvorák 001; Archontia C. Giannopoulou; Dimitrios M. Thilikos (Eur. J. Comb., 2012)

Computing Tree-Depth Faster Than 2 n. - Fedor V. Fomin; Archontia C. Giannopoulou; Michal Pilipczuk (IPEC, 2013)

Excluding Graphs as Immersions in Surface Embedded Graphs. - Archontia C. Giannopoulou; Marcin Kaminski 001; Dimitrios M. Thilikos (WG, 2013)

Optimizing the Graph Minors Weak Structure Theorem. - Archontia C. Giannopoulou; Dimitrios M. Thilikos (SIAM J. Discret. Math., 2013)

Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). - Archontia C. Giannopoulou; Daniel Lokshtanov; Saket Saurabh 001; Ondrej Suchý 001 (FSTTCS, 2014)

Effective computation of immersion obstructions for unions of graph classes. - Archontia C. Giannopoulou; Iosif Salem; Dimitris Zoros (J. Comput. Syst. Sci., 2014)

A Fixed Parameter Algorithm for Plane Subgraph Completion. - Dimitris Chatzidimitriou; Archontia C. Giannopoulou; Clément Requilé; Dimitrios M. Thilikos; Dimitris Zoros (CTW, 2015)

Computing Tree-Depth Faster Than 2n. - Fedor V. Fomin; Archontia C. Giannopoulou; Michal Pilipczuk (Algorithmica, 2015)

Forbidding Kuratowski Graphs as Immersions. - Archontia C. Giannopoulou; Marcin Jakub Kaminski; Dimitrios M. Thilikos (J. Graph Theory, 2015)

FPT Algorithms for Plane Completion Problems. - Dimitris Chatzidimitriou; Archontia C. Giannopoulou; Spyridon Maniatis; Clément Requilé; Dimitrios M. Thilikos; Dimitris Zoros (MFCS, 2016)

Packing and Covering Immersion Models of Planar Subcubic Graphs. - Archontia C. Giannopoulou; O-joung Kwon; Jean-Florent Raymond; Dimitrios M. Thilikos (WG, 2016)

Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation. - Archontia C. Giannopoulou; Daniel Lokshtanov; Saket Saurabh 001; Ondrej Suchý 001 (SIAM J. Discret. Math., 2016)

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. - Archontia C. Giannopoulou; George B. Mertzios (SIAM J. Discret. Math., 2016)

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. - Kord Eickmeyer; Archontia C. Giannopoulou; Stephan Kreutzer; O-joung Kwon; Michal Pilipczuk; Roman Rabinovich 001; Sebastian Siebertz (ICALP, 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)

Matching Connectivity: On the Structure of Graphs with Perfect Matchings. - Archontia C. Giannopoulou; Stephan Kreutzer; Sebastian Wiederrecht (Electron. Notes Discret. Math., 2017)

Uniform Kernelization Complexity of Hitting Forbidden Minors. - Archontia C. Giannopoulou; Bart M. P. Jansen; Daniel Lokshtanov; Saket Saurabh 001 (ACM Trans. Algorithms, 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)

Lean Tree-Cut Decompositions: Obstructions and Algorithms. - Archontia C. Giannopoulou; O-joung Kwon; Jean-Florent Raymond; Dimitrios M. Thilikos (STACS, 2019)

Cutwidth: Obstructions and Algorithmic Aspects. - Archontia C. Giannopoulou; Michal Pilipczuk; Jean-Florent Raymond; Dimitrios M. Thilikos; Marcin Wrochna (Algorithmica, 2019)

Braces of Perfect Matching Width 2. - Archontia C. Giannopoulou; Meike Hatzel; Sebastian Wiederrecht (CoRR, 2019)

The Directed Flat Wall Theorem. - Archontia C. Giannopoulou; Ken-ichi Kawarabayashi; Stephan Kreutzer; O-joung Kwon (SODA, 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)

Two Disjoint Alternating Paths in Bipartite Graphs. - Archontia C. Giannopoulou; Sebastian Wiederrecht (CoRR, 2021)

A Menger-like property of tree-cut width. - Archontia C. Giannopoulou; O-joung Kwon; Jean-Florent Raymond; Dimitrios M. Thilikos (J. Comb. Theory B, 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)

Preface to the special issue on Graph Searching: Theory and Applications. - Spyros Angelopoulos 001; Nancy E. Clarke; Fedor V. Fomin; Archontia C. Giannopoulou; Roman Rabinovich 001 (Theor. Comput. Sci., 2021)

Directed Tangle Tree-Decompositions and Applications. - Archontia C. Giannopoulou; Ken-ichi Kawarabayashi; Stephan Kreutzer; O-joung Kwon (SODA, 2022)

Block Elimination Distance. - Öznur Yasar Diner; Archontia C. Giannopoulou; Giannos Stamoulis; Dimitrios M. Thilikos (Graphs Comb., 2022)

Excluding Single-Crossing Matching Minors in Bipartite Graphs. - Archontia C. Giannopoulou; Dimitrios M. Thilikos; Sebastian Wiederrecht (SODA, 2023)

A Flat Wall Theorem for Matching Minors in Bipartite Graphs. - Archontia C. Giannopoulou; Sebastian Wiederrecht (STOC, 2024)

A graph searching game for block treedepth and a cubic kernel by vertex cover. - Archontia C. Giannopoulou; Filippos Mavropoulos (Theor. Comput. Sci., 2024)

Excluding a planar matching minor in bipartite graphs. - Archontia C. Giannopoulou; Stephan Kreutzer; Sebastian Wiederrecht (J. Comb. Theory B, 2024)