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
49 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
42 2017 Forbidden graphs for tree-depth Z Dvořák, AC Giannopoulou, DM Thilikos
European Journal of Combinatorics 33 (5), 969-979, 2012
41 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
29 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
25 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
25 2012 Cutwidth: obstructions and algorithmic aspects AC Giannopoulou, M Pilipczuk, JF Raymond, DM Thilikos, M Wrochna
Algorithmica 81, 557-588, 2019
22 2019 Computing Tree-Depth Faster Than FV Fomin, AC Giannopoulou, M Pilipczuk
Algorithmica 73, 202-216, 2015
21 2015 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
19 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
18 2015 Optimizing the graph minors weak structure theorem AC Giannopoulou, DM Thilikos
SIAM Journal on Discrete Mathematics 27 (3), 1209-1227, 2013
16 2013 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 Obstructions for tree-depth AC Giannopoulou, DM Thilikos
Electronic Notes in Discrete Mathematics 34, 249-253, 2009
12 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 2019-36th International Symposium on Theoretical Aspects of Computer …, 2019
9 2019 Packing and covering immersion-expansions of planar sub-cubic graphs AC Giannopoulou, OJ Kwon, JF Raymond, DM Thilikos
European Journal of Combinatorics 65, 154-167, 2017
8 * 2017 The Structure of -Immersion-Free Graphs R Belmonte, A Giannopoulou, D Lokshtanov, DM Thilikos
arXiv preprint arXiv:1602.02002, 2016
8 2016 Block elimination distance ÖY Diner, AC Giannopoulou, G Stamoulis, DM Thilikos
Graphs and Combinatorics 38 (5), 133, 2022
5 2022 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