Neighborhood complexity and kernelization for nowhere dense classes of graphs K Eickmeyer, AC Giannopoulou, S Kreutzer, O Kwon, M Pilipczuk, ... arXiv preprint arXiv:1612.08197, 2016 | 46 | 2016 |

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs AC Giannopoulou, GB Mertzios, R Niedermeier Theoretical computer science 689, 67-95, 2017 | 41 | 2017 |

Forbidden graphs for tree-depth Z Dvořák, AC Giannopoulou, DM Thilikos European Journal of Combinatorics 33 (5), 969-979, 2012 | 37 | 2012 |

Uniform kernelization complexity of hitting forbidden minors AC Giannopoulou, BMP Jansen, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 13 (3), 1-35, 2017 | 27 | 2017 |

Forbidding Kuratowski graphs as immersions AC Giannopoulou, M Kamiński, DM Thilikos Journal of Graph Theory 78 (1), 43-60, 2015 | 27 | 2015 |

Linear kernels for edge deletion problems to immersion-closed graph classes A Giannopoulou, M Pilipczuk, JF Raymond, DM Thilikos, M Wrochna SIAM Journal on Discrete Mathematics 35 (1), 105-151, 2021 | 23 | 2021 |

LIFO-search: A min–max theorem and a searching game for cycle-rank and tree-depth AC Giannopoulou, P Hunter, DM Thilikos Discrete Applied Mathematics 160 (15), 2089-2097, 2012 | 23 | 2012 |

Computing Tree-Depth Faster Than 2 n FV Fomin, AC Giannopoulou, M Pilipczuk Algorithmica 73 (1), 202-216, 2015 | 21 | 2015 |

Cutwidth: obstructions and algorithmic aspects AC Giannopoulou, M Pilipczuk, JF Raymond, DM Thilikos, M Wrochna Algorithmica 81 (2), 557-588, 2019 | 20 | 2019 |

Tree Deletion Set Has a Polynomial Kernel but No Approximation AC Giannopoulou, D Lokshtanov, S Saurabh, O Suchy SIAM Journal on Discrete Mathematics 30 (3), 1371-1384, 2016 | 20 | 2016 |

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs AC Giannopoulou, GB Mertzios, R Niedermeier arXiv preprint arXiv:1506.01652, 2015 | 19 | 2015 |

The directed flat wall theorem AC Giannopoulou, K Kawarabayashi, S Kreutzer, O Kwon Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 15 | 2020 |

Optimizing the graph minors weak structure theorem AC Giannopoulou, DM Thilikos SIAM Journal on Discrete Mathematics 27 (3), 1209-1227, 2013 | 15 | 2013 |

Obstructions for tree-depth AC Giannopoulou, DM Thilikos Electronic Notes in Discrete Mathematics 34, 249-253, 2009 | 11 | 2009 |

Effective computation of immersion obstructions for unions of graph classes AC Giannopoulou, I Salem, D Zoros Journal of Computer and System Sciences 80 (1), 207-216, 2014 | 10 | 2014 |

Lean tree-cut decompositions: Obstructions and algorithms AC Giannopoulou, O Kwon, JF Raymond, DM Thilikos STACS: Symposium on Theoretical Aspects of Computer Science, 32: 1--32: 14, 2019 | 8 | 2019 |

The Structure of -Immersion-Free Graphs R Belmonte, A Giannopoulou, D Lokshtanov, DM Thilikos arXiv preprint arXiv:1602.02002, 2016 | 8 | 2016 |

Packing and covering immersion models of planar subcubic graphs AC Giannopoulou, O Kwon, JF Raymond, DM Thilikos International Workshop on Graph-Theoretic Concepts in Computer Science, 74-84, 2016 | 7* | 2016 |

The canonical directed tree decomposition and its applications to the directed disjoint paths problem AC Giannopoulou, K Kawarabayashi, S Kreutzer, O Kwon arXiv preprint arXiv:2009.13184, 2020 | 5 | 2020 |

A min-max theorem for LIFO-search AC Giannopoulou, DM Thilikos Electronic Notes in Discrete Mathematics 38, 395-400, 2011 | 5 | 2011 |