Zobrazeno 1 - 10 of 10 pro vyhledávání: '"Giannos Stamoulis"'
1
k-apices of minor-closed graph classes. I. Bounding the obstructions
Autor: Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Publikováno v: Journal of Combinatorial Theory, Series B. 161:180-227
Let $\mathcal{G}$ be a minor-closed graph class. We say that a graph $G$ is a $k$-apex of $\mathcal{G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to $\mathcal{G}.$ We denote by $\mathcal{A}_k (\mathcal{G})$ th
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5763b1ef6a800a29db7e3f806bee05bb
https://doi.org/10.1016/j.jctb.2023.02.012
Zobrazit plný text záznamu
2
k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
Autor: Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Publikováno v: ACM Transactions on Algorithms. 18:1-30
Let 𝒢 be a minor-closed graph class. We say that a graph G is a k -apex of 𝒢 if G contains a set S of at most k vertices such that G\S belongs to 𝒢 . We denote by 𝒜 k ( 𝒢 ) the set of all graphs that are k -apices of 𝒢 . In the firs
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::774495d0c76f936bba9934907fafe95f
https://doi.org/10.1145/3519028
Zobrazit plný text záznamu
5
Minor obstructions for apex-pseudoforests
Autor: Alexandros Singh, Giannos Stamoulis, Alexandros Leivaditis, Dimitrios M. Thilikos, Konstantinos Tsatsanis
Publikováno v: Discrete Mathematics
Discrete Mathematics, Elsevier, 2021, 344 (10), pp.112529. ⟨10.1016/j.disc.2021.112529⟩
International audience; A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one of its vertices. We identify 33 graphs that for
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c099727d59b857239d1247e37ee79af
https://hal.archives-ouvertes.fr/hal-03327317
Zobrazit plný text záznamu
6
Block Elimination Distance
Autor: Giannos Stamoulis, Archontia C. Giannopoulou, Dimitrios M. Thilikos, Öznur Yaşar Diner
Publikováno v: Graph-Theoretic Concepts in Computer Science
Graph-Theoretic Concepts in Computer Science, 12911, Springer International Publishing, pp.28-38, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86838-3_3⟩
Graph-Theoretic Concepts in Computer Science ISBN: 9783030868376
WG
We introduce the parameter of block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class \(\mathcal{G}\), the class \(\mathcal{B}(\mathcal{G})\) contains all graphs whose blocks belon
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a619ed758332c43d6592f3444cb566b6
https://hal.archives-ouvertes.fr/hal-03389973/document
Zobrazit plný text záznamu
7
Block Elimination Distance
Autor: Öznur Yaşar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
We introduce the block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class ${\cal G}$, the class ${\cal B}({\cal G})$ contains all graphs whose blocks belong to ${\cal G}$ and the cl
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c058a8853d70dab257f4eb0aa86b6e5
http://arxiv.org/abs/2103.01872
Zobrazit plný text záznamu
8
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
Autor: Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Publikováno v: Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms
31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 2020, Salt Lake City, UT, United States. pp.931-950, ⟨10.5555/3381089.3381145⟩
For a finite collection of graphs ${\cal F}$, the \textsc{${\cal F}$-TM-Deletion} problem has as input an $n$-vertex graph $G$ and an integer $k$ and asks whether there exists a set $S \subseteq V(G)$ with $|S| \leq k$ such that $G \setminus S$ does
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f27c950837469fd21ec4e6a4ea439c0
https://hdl.handle.net/11250/2755661
Zobrazit plný text záznamu
9
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
Autor: Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Publikováno v: 28th Annual European Symposium on Algorithms (ESA)
28th Annual European Symposium on Algorithms (ESA), Sep 2020, Pisa, Italy. pp.51:1-51:17, ⟨10.4230/LIPIcs.ESA.2020.51⟩
Leibniz International Proceedings in Informatics
51:1-51:17
In general, a graph modification problem is defined by a graph modification operation ⊠ and a target graph property 𝒫. Typically, the modification operation ⊠ may be vertex deletion , edge deletion , edge contraction , or edge addition and the
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e83319e4ed6f4a1066474b9da1f9aa3
Zobrazit plný text záznamu
10
Minor-Obstructions for Apex Sub-unicyclic Graphs
Autor: Konstantinos Tsatsanis, Dimitrios M. Thilikos, Giannos Stamoulis, Alexandros Leivaditis, Vasiliki Velona, Alexandros Singh
Publikováno v: Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2020, 284, pp.538-555. ⟨10.1016/j.dam.2020.04.019⟩
A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph $G$ is $k$-apex sub-unicyclic if it can become sub-unicyclic by removing $k$ of its vertices. We identify 29 graphs that are the minor-obstructions of the class of $1
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c8cdcd5768540004fe80f6d90de55f2
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje