Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Archontia C. Giannopoulou"'
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::738186f398b732605f622f5c0fb9201a
https://doi.org/10.1137/1.9781611977554.ch81
https://doi.org/10.1137/1.9781611977554.ch81
Publikováno v:
European Journal of Combinatorics
European Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167. ⟨10.1016/j.ejc.2017.05.009⟩
European Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167. 〈10.1016/j.ejc.2017.05.009〉
European Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167. ⟨10.1016/j.ejc.2017.05.009⟩
European Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167. 〈10.1016/j.ejc.2017.05.009〉
International audience; A graph H is an immersion of a graph G if H can be obtained by some subgraph G after lifting incident edges. We prove that there is a polynomial function f : N × N → N, such that if H is a connected planar sub-cubic graph o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3e2785f5ed49f1741f0014abe1ae01e
https://doi.org/10.1016/j.ejc.2017.05.009
https://doi.org/10.1016/j.ejc.2017.05.009
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
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
https://hal.archives-ouvertes.fr/hal-03389973/document
Publikováno v:
Journal of Combinatorial Theory, Series B
Journal of Combinatorial Theory, Series B, Elsevier, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩
Journal of Combinatorial Theory, Series B, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩
Journal of Combinatorial Theory, Series B, Elsevier, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩
Journal of Combinatorial Theory, Series B, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩
In 1990, Thomas proved that every graph admits a tree decomposition of minimum width that additionally satisfies a certain vertex-connectivity condition called leanness [A Menger-like property of tree-width: The finite case. Journal of Combinatorial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0893f2fbaf828770c424bfa41cf3c88d
https://hal.archives-ouvertes.fr/hal-03094586
https://hal.archives-ouvertes.fr/hal-03094586
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
http://arxiv.org/abs/2103.01872
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
Matching minors are a specialised version of minors fit for the study of graphs with perfect matchings. The first major appearance of matching minors was in a result by Little who showed that a bipartite graph is Pfaffian if and only if it does not c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ef8812256a0924eff829931df401225
https://doi.org/10.1007/978-3-030-83823-2_67
https://doi.org/10.1007/978-3-030-83823-2_67
Autor:
Fedor V. Fomin, Nancy E. Clarke, Spyros Angelopoulos, Roman Rabinovich, Archontia C. Giannopoulou
Publikováno v:
Theoretical Computer Science. 858:145-146
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f0a35cf62fb3b3d38ed2da943b39aa2
https://doi.org/10.1016/j.tcs.2021.01.036
https://doi.org/10.1016/j.tcs.2021.01.036
Publikováno v:
Theoretical computer science, 2017, Vol.689, pp.67-95 [Peer Reviewed Journal]
Husfeldt, Thore & Kanj, Iyad (Eds.). (2015). 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). : Leibniz International Proceedings in Informatics, pp. 102-113, LIPIcs : Leibniz international proceedings in informatics(43)
Husfeldt, Thore & Kanj, Iyad (Eds.). (2015). 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). : Leibniz International Proceedings in Informatics, pp. 102-113, LIPIcs : Leibniz international proceedings in informatics(43)
We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time. The main motivation is to get more efficient algorithms for problems with unattractive polynomial running times. Here, we focus on a funda
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56f7b46c7ac4d3d97b1d5a1e76aa8cae
https://doi.org/10.1016/j.tcs.2017.05.017
https://doi.org/10.1016/j.tcs.2017.05.017
Publikováno v:
ACM Transactions on Algorithms, 13(3):35, 1-35. Association for Computing Machinery, Inc
The F-Minor-Free Deletion problem asks, for a fixed set F and an input consisting of a graph G and integer k, whether k vertices can be removed from G such that the resulting graph does not contain any member of F as a minor. This paper analyzes to w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::37ec555dc7e01cb86c85bb2d733fc1b5
https://doi.org/10.1145/3029051
https://doi.org/10.1145/3029051