Giannos Stamoulis

Available identifiers

zbMath Open stamoulis.giannosMaRDI QIDQ777433

List of research outcomes

Publication	Date of Publication	Type
Computing paths of large rank in planar frameworks deterministically	2025-01-22	Paper
Compound logics for modification problems	2024-11-14	Paper
Faster parameterized algorithms for modification problems to minor-closed classes	2024-11-14	Paper
Minor-obstructions for apex sub-unicyclic graphs	2024-10-18	Paper
A more accurate view of the flat wall theorem	2024-09-16	Paper
Faster parameterized algorithms for modification problems to minor-closed classes	2024-09-10	Paper
Shortest cycles with monotone submodular costs	2024-05-14	Paper
Model-checking for first-order logic with disjoint paths predicates in proper minor-closed graph classes	2024-05-14	Paper
Fixed-parameter tractability of maximum colored path and beyond	2024-05-14	Paper
Branchwidth is \((1, g)\)-self-dual	2024-04-10	Paper
k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms	2023-10-31	Paper
Combing a Linkage in an Annulus	2023-10-26	Paper
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable	2023-10-23	Paper
\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions	2023-05-02	Paper
https://portal.mardi4nfdi.de/entity/Q5874521	2023-02-07	Paper
Faster parameterized algorithms for modification problems to minor-closed classes	2022-10-05	Paper
Block elimination distance	2022-08-08	Paper
Block elimination distance	2022-06-08	Paper
Compound Logics for Modification Problems	2021-11-04	Paper
Minor obstructions for apex-pseudoforests	2021-08-02	Paper
Block Elimination Distance	2021-03-02	Paper
A more accurate view of the Flat Wall Theorem	2021-02-12	Paper
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable	2021-02-02	Paper
Minor-obstructions for apex sub-unicyclic graphs	2020-07-07	Paper
Planar Disjoint Paths in Linear Time	2019-07-12	Paper
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes	N/A	Paper
Elementary first-order model checking for sparse graphs	N/A	Paper
Minor Containment and Disjoint Paths in almost-linear time	N/A	Paper

Research outcomes over time

This page was built for person: Giannos Stamoulis