Archontia C. Giannopoulou

Here you can find a (not necessarily up-to-date) list of my papers.

Alternatively, you could take a look at my DBLP page.

Some of my papers are also on ArXiV.

Papers

Published in Journals

  1. Uniform Kernelization Complexity of Hitting Forbidden Minors.
    Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, and Saket Saurabh.
    ACM Transactions on Algorithms (TALG: Volume 13 Issue 3, March 2017).
    An extended abstract of a preliminary version of this paper has appeared in the proceedings of ICALP 2015.

  2. Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation).
    Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, and Ondrej Suchy.
    SIAM Journal on Discrete Mathematics (SIAM J. Discrete Math. 30(3): 1371-1384 (2016)).
    An extended abstract of a preliminary version of this paper has appeared in the proceedings of FSTTCS 2014.

  3. New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs.
    Archontia C. Giannopoulou and George B. Mertzios.
    SIAM Journal on Discrete Mathematics (SIAM J. Discrete Math. 30(3): 1685-1725 (2016)).
    An extended abstract of a preliminary version of this paper has appeared in the proceedings of STACS 2015.

  4. Computing Tree-depth Faster Than 2^n.
    Fedor V. Fomin, Archontia C. Giannopoulou, and Michal Pilipczuk.
    Algorithmica 2015 (Algorithmica 73(1): 202-216 (2015)).
    An extended abstract of a preliminary version of this paper has appeared in the proceedings of IPEC 2013.

  5. Forbidding Kuratowski Graphs as Immersions.
    Archontia C. Giannopoulou, Marcin Kaminski, and Dimitrios M. Thilikos.
    Journal of Graph Theory 2015 (Journal of Graph Theory 78(1): 43-60 (2015)).

  6. Effective Computation of Immersion Obstructions for Unions of Graph Classes.
    Archontia C. Giannopoulou, Iosif Salem, and Dimitris Zoros.
    Journal of Computer and System Sciences 2014 (J. Comput. Syst. Sci. 80(1): 207-216 (2014)).
    An extended abstract of a preliminary version of this paper has appeared in the proceedings of SWAT 2012.

  7. Optimizing the Graph Minors Weak Structure Theorem.
    Archontia C. Giannopoulou and Dimitrios M. Thilikos.
    SIAM Journal on Discrete Mathematics 2013 (SIAM J. Discrete Math. 27(3): 1209-1227 (2013)).
    (The results of this paper were presented in the 2nd Workshop on Graph Decompositions: Theoretical,
    Algorithmic and Logical Aspects, October 18-22, 2010.)

  8. 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 2012 (Discrete Applied Mathematics 160(15): 2089-2097 (2012)).
    A preliminary version of this paper appeared in the Electronic Notes in Discrete Mathematics.

  9. Forbidden Graphs for Tree-depth.
    Zdenek Dvorak, Archontia C. Giannopoulou, and Dimitrios M. Thilikos.
    European Journal of Combinatorics 2012 (Eur. J. Comb. 33(5): 969-979 (2012)).
    A preliminary version of this paper appeared in the Electronic Notes in Dicrete Mathematics (Eurocomb 2009).

Published in Conference Proceedings

  1. Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs.
    Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon,
    Michal Pilipczuk, Roman Rabinovich, and Sebastian Siebertz.
    ICALP 2017.

  2. Linear Kernels for Edge Deletion Problems to Immersion-closed Graph Classes.
    Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos,
    Jean-Florent Raymond, and Marcin Wrochna.
    ICALP 2017.

  3. Matching Connectivity: On the Structure of Graphs with Perfect Matchings.
    Archontia C. Giannopoulou, Stephan Kreutzer, and Sebastian Wiederrecht.
    EUROCOMB 2017.

  4. Cutwidth: Obstructions and Algorithmic Aspects.
    Archontia Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond,
    Dimitrios Thilikos, and Marcin Wrochna.
    IPEC 2016.

  5. FPT Algorithms for Plane Completion Problems.
    Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clement Requile,
    Dimitrios M. Thilikos, and Dimitris Zoros.
    MFCS 2016 (MFCS 2016: 26:1-26:13).

  6. Packing and Covering Immersion Models of Planar Subcubic Graphs.
    Archontia Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, and Dimitrios Thilikos.
    WG 2016. (WG 2016: 74-84)

  7. Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs.
    Archontia C. Giannopoulou, George B. Mertzios, and Rolf Niedermeier.
    IPEC 2015 (IPEC 2015: 102-113).

  8. Structure of W4-immersion free graphs.
    Remy Belmonte, Archontia C. Giannopoulou, Daniel Lokshtanov, and Dimitrios M. Thilikos.
    ICGT 2014.

  9. Excluding Graphs as Immersions in Surface Embedded Graphs.
    Archontia C. Giannopoulou, Marcin Kaminski, and Dimitrios M. Thilikos.
    WG 2013 (WG 2013: 274-285).

  10. 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 (LATIN 2012: 408-419).

Manuscripts

  1. To be announced.