Welcome
Journals Conferences Manuscripts
Contact ☰


Mandatorily outdated picture

Archontia C. Giannopoulou

Associate Professor
Department of Informatics and Telecommunications
National and Kapodistrian University of Athens
Greece

My main, but not only, research interests are

  • Graph Algorithms,
  • Structural Graph Theory, and
  • Parameterized Algorithms and Complexity.

Journal Publications

  1. Excluding a Planar Matching Minor in Bipartite Graphs.
    Archontia C. Giannopoulou, Stephan Kreutzer, and Sebastian Wiederrecht.
    J. Comb. Theory, Ser. B 164: 161-221 (2024).
  2. Block Elimination Distance.
    Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, and Dimitrios M. Thilikos.
    Graphs Comb. 38(5): 133 (2022).
  3. A Menger-like property of tree-cut width.
    Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, and Dimitrios Thilikos.
    J. Comb. Theory, Ser. B 148: 1-22 (2021).
  4. Linear Kernels for Edge Deletion Problems to Immersion-closed Graph Classes.
    Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, and Marcin Wrochna.
    SIAM J. Discret. Math. 35(1): 105-151 (2021).
  5. Cutwidth: Obstructions and Algorithmic Aspects.
    Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios Thilikos, and Marcin Wrochna.
    Algorithmica 81(2): 557-588, (2019).
  6. Uniform Kernelization Complexity of Hitting Forbidden Minors.
    Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, and Saket Saurabh.
    ACM Trans. Algorithms 13, 3, Article 35 (March 2017), 35 pages.
  7. Packing and Covering Immersion-Expansions of Planar Sub-cubic Graphs.
    Archontia Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, and Dimitrios Thilikos.
    Eur. J. Comb. 65: 154-167 (2017).
  8. Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs.
    Archontia C. Giannopoulou, George B. Mertzios, and Rolf Niedermeier.
    Theor. Comput. Sci. 689: 67-95 (2017).
  9. Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation.
    Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, and Ondrej Suchý.
    SIAM J. Discrete Math. 30(3): 1371-1384 (2016).
  10. New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs.
    Archontia C. Giannopoulou and George B. Mertzios.
    SIAM J. Discrete Math. 30(3): 1685-1725 (2016).
  11. Computing Tree-depth Faster Than 2n.
    Fedor V. Fomin, Archontia C. Giannopoulou, and Michał Pilipczuk.
    Algorithmica 73(1): 202-216 (2015).
  12. Forbidding Kuratowski Graphs as Immersions.
    Archontia C. Giannopoulou, Marcin Kamiński, and Dimitrios M. Thilikos.
    Journal of Graph Theory 78(1): 43-60 (2015).
  13. Effective Computation of Immersion Obstructions for Unions of Graph Classes.
    Archontia C. Giannopoulou, Iosif Salem, and Dimitris Zoros.
    J. Comput. Syst. Sci. 80(1): 207-216 (2014).
  14. Optimizing the Graph Minors Weak Structure Theorem.
    Archontia C. Giannopoulou and Dimitrios M. Thilikos.
    SIAM J. Discrete Math. 27(3): 1209-1227 (2013).
  15. LIFO-search: A Min-max Theorem and a Searching Game for Cycle-rank and Tree-depth.
    Archontia C. Giannopoulou, Paul Hunter, and Dimitrios M. Thilikos.
    Discrete Applied Mathematics 160(15): 2089-2097 (2012).
  16. Forbidden Graphs for Tree-depth.
    Zdeněk Dvořák, Archontia C. Giannopoulou, and Dimitrios M. Thilikos.
    Eur. J. Comb. 33(5): 969-979 (2012).

Conference Proceedings

Note that this section also contains publications whose full version has appeared in a journal (cross-referencing between conference and journal versions under construction).
  1. A Flat Wall Theorem for Matching Minors in Bipartite Graphs.
    Archontia C. Giannopoulou and Sebastian Wiederrecht.
    STOC 2024: 716-727.
  2. Excluding Single-Crossing Matching Minors in Bipartite Graphs.
    Archontia C. Giannopoulou, Dimitrios M. Thilikos, and Sebastian Wiederrecht.
    SODA 2023: 2111-2121.
  3. Directed Tangle Tree-Decompositions and Applications.
    Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-Joung Kwon.
    SODA 2022: 377-405.
  4. Block Elimination Distance.
    Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, and Dimitrios M. Thilikos.
    WG 2021: 28-38.
  5. The Flat Wall Theorem for Bipartite Graphs with Perfect Matchings.
    Archontia C. Giannopoulou and Sebastian Wiederrecht.
    Extended Abstracts EuroComb 2021: 429-435.
  6. The Directed Flat Wall Theorem.
    Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-Joung Kwon.
    SODA 2020: 239-258.
  7. Lean Tree-cut Decompositions: Obstructions and Algorithms.
    Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond and Dimitrios Thilikos.
    STACS 2019: 32:1-32:14.
  8. Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs.
    Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michał Pilipczuk, Roman Rabinovich, and Sebastian Siebertz.
    ICALP 2017: 63:1-63:14.
  9. Linear Kernels for Edge Deletion Problems to Immersion-closed Graph Classes.
    Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, and Marcin Wrochna.
    ICALP 2017: 57:1-57:15.
  10. Matching Connectivity: On the Structure of Graphs with Perfect Matchings.
    Archontia C. Giannopoulou, Stephan Kreutzer, and Sebastian Wiederrecht.
    Electronic Notes in Discrete Mathematics 61: 505-511 (2017).
  11. FPT Algorithms for Plane Completion Problems.
    Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, and Dimitris Zoros.
    MFCS 2016: 26:1-26:13.
  12. Cutwidth: Obstructions and Algorithmic Aspects.
    Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios Thilikos, and Marcin Wrochna.
    IPEC 2016: 15:1-15:13.
  13. Packing and Covering Immersion Models of Planar Subcubic Graphs.
    Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, and Dimitrios Thilikos.
    WG 2016: 74-84.
  14. Uniform Kernelization Complexity of Hitting Forbidden Minors.
    Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, and Saket Saurabh.
    ICALP (1) 2015: 629-641.
  15. Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs.
    Archontia C. Giannopoulou, George B. Mertzios, and Rolf Niedermeier.
    IPEC 2015: 102-113.
  16. New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs.
    Archontia C. Giannopoulou and George B. Mertzios.
    STACS 2015: 354-366.
  17. Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation.
    Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, and Ondrej Suchý.
    FSTTCS 2014: 85-96.
  18. The Structure of W4-immersion-free Graphs.
    Rémy Belmonte, Archontia C. Giannopoulou, Daniel Lokshtanov, and Dimitrios M. Thilikos.
    ICGT 2014.
  19. Excluding Graphs as Immersions in Surface Embedded Graphs.
    Archontia C. Giannopoulou, Marcin Kamiński and Dimitrios M. Thilikos.
    WG 2013: 274-285.
  20. Computing Tree-depth Faster Than 2n.
    Fedor V. Fomin, Archontia C. Giannopoulou, and Michał Pilipczuk.
    IPEC 2013: 137-149.
  21. Effective Computation of Immersion Obstructions for Unions of Graph Classes.
    Archontia C. Giannopoulou, Iosif Salem, and Dimitris Zoros.
    SWAT 2012: 165-176.
  22. New Lower Bound on Max-Cut of Hypergraphs with an Application to r-Set Splitting.
    Archontia C. Giannopoulou, Sudeshna Kolay, and Saket Saurabh.
    LATIN 2012: 408-419.
  23. A min-max theorem for LIFO-search.
    Archontia C. Giannopoulou and Dimitrios M. Thilikos.
    Electronic Notes in Discrete Mathematics 38: 395-400 (2011).
  24. Obstructions for Tree-depth.
    Archontia C. Giannopoulou and Dimitrios M. Thilikos.
    Electronic Notes in Discrete Mathematics 34: 249-253 (2009).

Manuscripts

  1. A graph searching game for block treedepth and a cubic kernel by vertex cover.
    Archontia C. Giannopoulou and Filippos Mavropoulos.
  2. Braces of Perfect Matching Width Two.
    Archontia C. Giannopoulou, Meike Hatzel, and Sebastian Wiederrecht.
  3. Two Disjoint Alternating Paths in Bipartite Graphs: Conformal Crosses.
    Archontia C. Giannopoulou and Sebastian Wiederrecht.

Contact Info

Email: archontia.giannopoulou at gmail dot com

Telephone: (+30) 210 727-5210

Postal address:
Archontia Giannopoulou
National and Kapodistrian University of Athens
Department of Informatics and Telecommunications
Panepistimioupoli, Ilisia
Athens 16122
Greece