Giannos Stamoulis

From MaRDI portal
(Redirected from Person:777433)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
An FPT-algorithm for recognizing \(k\)-apices of minor-closed graph classes2026-03-18Paper
Computing paths of large rank in planar frameworks deterministically
SIAM Journal on Discrete Mathematics
2025-01-22Paper
Compound logics for modification problems2024-11-14Paper
Faster parameterized algorithms for modification problems to minor-closed classes2024-11-14Paper
Minor-obstructions for apex sub-unicyclic graphs
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
A more accurate view of the flat wall theorem
Journal of Graph Theory
2024-09-16Paper
Faster parameterized algorithms for modification problems to minor-closed classes
TheoretiCS
2024-09-10Paper
Shortest cycles with monotone submodular costs2024-05-14Paper
Model-checking for first-order logic with disjoint paths predicates in proper minor-closed graph classes2024-05-14Paper
Fixed-parameter tractability of maximum colored path and beyond2024-05-14Paper
Branchwidth is \((1, g)\)-self-dual
Discrete Applied Mathematics
2024-04-10Paper
k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
ACM Transactions on Algorithms
2023-10-31Paper
Combing a Linkage in an Annulus
SIAM Journal on Discrete Mathematics
2023-10-26Paper
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
ACM Transactions on Algorithms
2023-10-23Paper
\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
Journal of Combinatorial Theory. Series B
2023-05-02Paper
An algorithmic meta-theorem for graph modification to planarity and FOL
(available as arXiv preprint)
2023-02-07Paper
Faster parameterized algorithms for modification problems to minor-closed classes2022-10-05Paper
Block elimination distance
Graphs and Combinatorics
2022-08-08Paper
Block elimination distance
Graph-Theoretic Concepts in Computer Science
2022-06-08Paper
Compound Logics for Modification Problems2021-11-04Paper
Minor obstructions for apex-pseudoforests
Discrete Mathematics
2021-08-02Paper
Block Elimination Distance
(available as arXiv preprint)
2021-03-02Paper
A more accurate view of the Flat Wall Theorem2021-02-12Paper
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
2021-02-02Paper
Minor-obstructions for apex sub-unicyclic graphs
Discrete Applied Mathematics
2020-07-07Paper
Planar Disjoint Paths in Linear Time2019-07-12Paper
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
(available as arXiv preprint)
N/APaper
Elementary first-order model checking for sparse graphs
(available as arXiv preprint)
N/APaper
Minor Containment and Disjoint Paths in almost-linear time
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Giannos Stamoulis