default search action
Giannos Stamoulis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Georgios Kontogeorgiou, Alexandros Leivaditis, Kostas I. Psaromiligkos, Giannos Stamoulis
, Dimitris Zoros:
Branchwidth is (1,g)-self-dual. Discret. Appl. Math. 350: 1-9 (2024) - [j11]Fedor V. Fomin
Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms 20(1): 2:1-2:16 (2024) - [j10]Fedor V. Fomin
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. ACM Trans. Algorithms 20(4): 36:1-36:48 (2024) - [j9]Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster parameterized algorithms for modification problems to minor-closed classes. TheoretiCS 3 (2024) - [c13]Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis:
Minor Containment and Disjoint Paths in Almost-Linear Time. FOCS 2024: 53-61 - [c12]Jakub Gajarský
Elementary first-order model checking for sparse graphs. LICS 2024: 36:1-36:14 - [c11]Nicole Schirrmacher
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. LICS 2024: 68:1-68:12 - [i16]Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk:
Elementary first-order model checking for sparse graphs. CoRR abs/2401.16230 (2024) - [i15]Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis:
Minor Containment and Disjoint Paths in almost-linear time. CoRR abs/2404.03958 (2024) - [i14]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. CoRR abs/2406.18465 (2024) - 2023
- [j8]Ignasi Sau
k-apices of minor-closed graph classes. I. Bounding the obstructions. J. Comb. Theory B 161: 180-227 (2023) - [j7]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Combing a Linkage in an Annulus. SIAM J. Discret. Math. 37(4): 2332-2364 (2023) - [j6]Petr A. Golovach
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. ACM Trans. Algorithms 19(3): 23:1-23:29 (2023) - [c10]Fedor V. Fomin
Compound Logics for Modification Problems. ICALP 2023: 61:1-61:21 - [c9]Laure Morelle
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. ICALP 2023: 93:1-93:19 - [c8]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Computing Paths of Large Rank in Planar Frameworks Deterministically. ISAAC 2023: 32:1-32:15 - [c7]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Shortest Cycles With Monotone Submodular Costs. SODA 2023: 2214-2227 - [c6]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. SODA 2023: 3684-3699 - [c5]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. SODA 2023: 3700-3712 - [i13]Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny:
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. CoRR abs/2302.07033 (2023) - [i12]Fedor V. Fomin
Computing paths of large rank in planar frameworks deterministically. CoRR abs/2305.01993 (2023) - 2022
- [j5]Öznur Yasar Diner
Block Elimination Distance. Graphs Comb. 38(5): 133 (2022) - [j4]Ignasi Sau, Giannos Stamoulis
k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms. ACM Trans. Algorithms 18(3): 21:1-21:30 (2022) - [j3]Fedor V. Fomin
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ACM Trans. Comput. Theory 14(3-4): 1-29 (2022) - [i11]Fedor V. Fomin
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. CoRR abs/2207.07449 (2022) - [i10]Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster parameterized algorithms for modification problems to minor-closed classes. CoRR abs/2210.02167 (2022) - [i9]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. CoRR abs/2211.01723 (2022) - [i8]Fedor V. Fomin
Shortest Cycles With Monotone Submodular Costs. CoRR abs/2211.04797 (2022) - 2021
- [j2]Alexandros Leivaditis
Minor obstructions for apex-pseudoforests. Discret. Math. 344(10): 112529 (2021) - [c4]Öznur Yasar Diner
Block Elimination Distance. WG 2021: 28-38 - [i7]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
A more accurate view of the Flat Wall Theorem. CoRR abs/2102.06463 (2021) - [i6]Ignasi Sau
k-apices of minor-closed graph classes. I. Bounding the obstructions. CoRR abs/2103.00882 (2021) - [i5]Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. CoRR abs/2103.01872 (2021) - [i4]Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. CoRR abs/2106.03425 (2021) - [i3]Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Compound Logics for Modification Problems. CoRR abs/2111.02755 (2021) - 2020
- [j1]Alexandros Leivaditis
Minor-obstructions for apex sub-unicyclic graphs. Discret. Appl. Math. 284: 538-555 (2020) - [c3]Fedor V. Fomin
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ESA 2020: 51:1-51:17 - [c2]Ignasi Sau
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. ICALP 2020: 95:1-95:20 - [c1]Petr A. Golovach, Giannos Stamoulis
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. SODA 2020: 931-950 - [i2]Ignasi Sau
k-apices of minor-closed graph classes. II. Parameterized algorithms. CoRR abs/2004.12692 (2020)
2010 – 2019
- 2019
- [i1]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. CoRR abs/1907.02919 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: