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
70 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
62 2017 Forbidden graphs for tree-depth Z Dvořák, AC Giannopoulou, DM Thilikos
European Journal of Combinatorics 33 (5), 969-979, 2012
53 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
40 2017 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
38 2012 Cutwidth: Obstructions and algorithmic aspects AC Giannopoulou, M Pilipczuk, JF Raymond, DM Thilikos, M Wrochna
Algorithmica 81, 557-588, 2019
33 2019 The directed flat wall theorem AC Giannopoulou, K Kawarabayashi, S Kreutzer, O Kwon
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
25 2020 Forbidding Kuratowski graphs as immersions AC Giannopoulou, M Kamiński, DM Thilikos
Journal of Graph Theory 78 (1), 43-60, 2015
25 2015 Computing Tree-Depth Faster Than FV Fomin, AC Giannopoulou, M Pilipczuk
Algorithmica 73 (1), 202-216, 2015
23 2015 Linear kernels for edge deletion problems to immersion-closed graph classes AC Giannopoulou, M Pilipczuk, DM Thilikos, JF Raymond, M Wrochna
arXiv preprint arXiv:1609.07780, 2016
22 2016 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
22 2016 Optimizing the graph minors weak structure theorem AC Giannopoulou, DM Thilikos
SIAM Journal on Discrete Mathematics 27 (3), 1209-1227, 2013
18 2013 Directed Tangle Tree-Decompositions and Applications∗ AC Giannopoulou, K Kawarabayashi, S Kreutzer, O Kwon
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
16 2022 Lean tree-cut decompositions: Obstructions and algorithms AC Giannopoulou, O Kwon, JF Raymond, DM Thilikos
36th International Symposium on Theoretical Aspects of Computer Science …, 2019
13 2019 Obstructions for tree-depth AC Giannopoulou, DM Thilikos
Electronic Notes in Discrete Mathematics 34, 249-253, 2009
13 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
12 2014 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
11 2021 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
11 * 2016 Block elimination distance ÖY Diner, AC Giannopoulou, G Stamoulis, DM Thilikos
Graphs and Combinatorics 38 (5), 133, 2022
10 2022 A Menger-like property of tree-cut width AC Giannopoulou, O Kwon, JF Raymond, DM Thilikos
Journal of Combinatorial Theory, Series B 148, 1-22, 2021
10 * 2021