Follow
Giannos Stamoulis
Title
Cited by
Cited by
Year
k-apices of minor-closed graph classes. II. Parameterized algorithms
I Sau, G Stamoulis, DM Thilikos
ACM Transactions on Algorithms (TALG), 2021
27*2021
k-apices of minor-closed graph classes. I. Bounding the obstructions
I Sau, G Stamoulis, DM Thilikos
Journal of Combinatorial Theory, Series B 161, 180-227, 2023
132023
An algorithmic meta-theorem for graph modification to planarity and FOL
FV Fomin, PA Golovach, G Stamoulis, DM Thilikos
Proceedings of the 28th Annual European Symposium on Algorithms (ESA) 173 ¡K, 2020
132020
Hitting topological minor models in planar graphs is fixed parameter tractable
PA Golovach, G Stamoulis, DM Thilikos
ACM Transactions on Algorithms 19 (3), 23:1-23:29, 2020
132020
Compound Logics for Modification Problems
FV Fomin, PA Golovach, I Sau, G Stamoulis, DM Thilikos
ACM Transactions on Computational Logic 26 (1), 1-57, 2024
122024
Fixed-parameter tractability of maximum colored path and beyond
FV Fomin, PA Golovach, T Korhonen, K Simonov, G Stamoulis
ACM Transactions on Algorithms 20 (4), 1-48, 2024
122024
A more accurate view of the Flat Wall Theorem
I Sau, G Stamoulis, DM Thilikos
Journal of Graph Theory, 2024
122024
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
PA Golovach, G Stamoulis, DM Thilikos
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms ¡K, 2023
122023
Block elimination distance
ÖY Diner, AC Giannopoulou, G Stamoulis, DM Thilikos
Graphs and Combinatorics 38 (5), 1-28, 2022
112022
Model checking disjoint-paths logic on topological-minor-free graph classes
N Schirrmacher, S Siebertz, G Stamoulis, DM Thilikos, A Vigny
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer ¡K, 2024
92024
Faster parameterized algorithms for modification problems to minor-closed classes
L Morelle, I Sau, G Stamoulis, DM Thilikos
TheoretiCS 3, 2024
82024
Minor Containment and Disjoint Paths in almost-linear time
T Korhonen, M Pilipczuk, G Stamoulis
arXiv preprint arXiv:2404.03958, 2024
82024
Combing a Linkage in an Annulus
PA Golovach, G Stamoulis, DM Thilikos
SIAM Journal on Discrete Mathematics 37 (4), 2332-2364, 2023
82023
Minor-obstructions for apex sub-unicyclic graphs
A Leivaditis, A Singh, G Stamoulis, DM Thilikos, K Tsatsanis, V Velona
Discrete Applied Mathematics 284, 538-555, 2020
62020
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
I Sau, G Stamoulis, DM Thilikos
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms ¡K, 2025
32025
Shortest cycles with monotone submodular costs
FV Fomin, PA Golovach, T Korhonen, D Lokshtanov, G Stamoulis
ACM Transactions on Algorithms 20 (1), 1-16, 2023
32023
Branchwidth is (1,g)-self-dual
G Kontogeorgiou, A Leivaditis, KI Psaromiligkos, G Stamoulis, D Zoros
arXiv preprint arXiv:2305.18069, 2023
32023
Minor obstructions for apex-pseudoforests
A Leivaditis, A Singh, G Stamoulis, DM Thilikos, K Tsatsanis
Discrete Mathematics 344 (10), 112529, 2021
32021
Computing paths of large rank in planar frameworks deterministically
FV Fomin, PA Golovach, T Korhonen, G Stamoulis
SIAM Journal on Discrete Mathematics 39 (1), 92-118, 2025
22025
Finding irrelevant vertices in linear time on bounded-genus graphs
PA Golovach, SG Kolliopoulos, G Stamoulis, DM Thilikos
arXiv preprint arXiv:1907.05940, 2024
1*2024
The system can't perform the operation now. Try again later.
Articles 1–20