Follow
Giannos Stamoulis
Giannos Stamoulis
LIRMM, Université de Montpellier, CNRS, Montpellier, France
Verified email at lirmm.fr - Homepage
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
20*2021
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
102020
A more accurate view of the Flat Wall Theorem
I Sau, G Stamoulis, DM Thilikos
arXiv preprint arXiv:2102.06463, 2021
92021
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
62023
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 …, 2023
62023
Block elimination distance
ÖY Diner, AC Giannopoulou, G Stamoulis, DM Thilikos
Graphs and Combinatorics 38 (5), 1-28, 2022
6*2022
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 …, 2020
62020
Fixed-Parameter Tractability of Maximum Colored Path and Beyond
FV Fomin, PA Golovach, T Korhonen, K Simonov, G Stamoulis
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
52023
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
52020
Compound Logics for Modification Problems
FV Fomin, PA Golovach, I Sau, G Stamoulis, DM Thilikos
arXiv preprint arXiv:2111.02755, 2021
42021
Minor obstructions for apex-pseudoforests
A Leivaditis, A Singh, G Stamoulis, DM Thilikos, K Tsatsanis
Discrete Mathematics 344 (10), 112529, 2021
32021
Combing a Linkage in an Annulus
PA Golovach, G Stamoulis, DM Thilikos
SIAM Journal on Discrete Mathematics 37 (4), 2332-2364, 2023
22023
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
N Schirrmacher, S Siebertz, G Stamoulis, DM Thilikos, A Vigny
arXiv preprint arXiv:2302.07033, 2023
22023
Shortest Cycles With Monotone Submodular Costs
FV Fomin, PA Golovach, T Korhonen, D Lokshtanov, G Stamoulis
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
12023
Faster parameterized algorithms for modification problems to minor-closed classes
L Morelle, I Sau, G Stamoulis, DM Thilikos
arXiv preprint arXiv:2210.02167, 2022
12022
Planar Disjoint Paths in Linear Time
PA Golovach, SG Kolliopoulos, G Stamoulis, DM Thilikos
arXiv preprint arXiv:1907.05940, 2019
12019
Elementary first-order model checking for sparse graphs
J Gajarský, M Pilipczuk, M Sokołowski, G Stamoulis, S Toruńczyk
arXiv preprint arXiv:2401.16230, 2024
2024
Branchwidth is (1,g)-self-dual
G Kontogeorgiou, A Leivaditis, KI Psaromiligkos, G Stamoulis, D Zoros
arXiv preprint arXiv:2305.18069, 2023
2023
Computing paths of large rank in planar frameworks deterministically
FV Fomin, PA Golovach, T Korhonen, G Stamoulis
arXiv preprint arXiv:2305.01993, 2023
2023
Decompositions and Algorithms for the Disjoint Paths Problem in Planar Graphs
G Stamoulis
Department of Informatics and Telecommunications, National and Kapodistrian …, 0
The system can't perform the operation now. Try again later.
Articles 1–20