Zobrazeno 1 - 10
of 349
pro vyhledávání: '"Bidimensionality"'
Autor:
Daniel Lokshtanov, Michał Pilipczuk, Saket Saurabh, Fedor V. Fomin, Marcin Pilipczuk, Dániel Marx
Publikováno v:
FOCS
We prove the following theorem. Given a planar graph $G$ and an integer $k$, it is possible in polynomial time to randomly sample a subset $A$ of vertices of $G$ with the following properties: (i) $A$ induces a subgraph of $G$ of treewidth $\mathcal{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e28b4032f1abc99174e82c6ff0e8e487
https://doi.org/10.1137/19m1262504
https://doi.org/10.1137/19m1262504
Autor:
Julien Baste, Dimitrios M. Thilikos
Publikováno v:
Algorithmica
Algorithmica, 2022, 84 (2), pp.510-531. ⟨10.1007/s00453-021-00912-w⟩
Algorithmica, 2022, 84 (2), pp.510-531. ⟨10.1007/s00453-021-00912-w⟩
12th International Symposium on Parameterized and Exact Computation (IPEC 2017); International audience; Given a graph G, we define bcg(G) as the minimum k for which G can be contracted to the uniformly triangulated grid Γk. A graph class G has the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25d0bb2e07e118719bcb57b82f206aee
https://doi.org/10.1007/s00453-021-00912-w
https://doi.org/10.1007/s00453-021-00912-w
Autor:
Basso Monteverde, Leticia
Publikováno v:
Areté. 26(2):273-293
From a reading of Sein und Zeit and contemporary courses, we are interested in examining the transcendental structure of Dasein to explain what we understand as its bidimensional character. For this, we analyze the function of the mood in the dynamic
Externí odkaz:
http://repositorio.pucp.edu.pe/index/handle/123456789/112881
http://revistas.pucp.edu.pe/index.php/arete/article/view/11109/11624
http://revistas.pucp.edu.pe/index.php/arete/article/view/11109/11624
Autor:
Salim Hirèche
Publikováno v:
Inquiry (2021) pp. 1-36
It is widely accepted that necessity comes in different varieties, often called ‘kinds': metaphysical necessity, logical necessity, natural necessity, conceptual necessity, moral necessity, to name but a few – and the same goes for the varieties
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bfffdae38fbd12538979c06d171f46df
https://doi.org/10.1080/0020174x.2021.1883106
https://doi.org/10.1080/0020174x.2021.1883106
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
SIAM journal on computing
SIAM Journal on Computing
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2020, 49 (6), pp.1397-1422. ⟨10.1137/16M1080264⟩
Scopus-Elsevier
SIAM Journal on Computing
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2020, 49 (6), pp.1397-1422. ⟨10.1137/16M1080264⟩
Scopus-Elsevier
Bidimensionality Theory was introduced by [E.D. Demaine, F.V. Fomin, M.Hajiaghayi, and D.M. Thilikos. Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, J. ACM, 52 (2005), pp.866--893] as a tool to obtain sub-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::215713813f049079cc8c22427a0d244e
https://doi.org/10.1137/16m1080264
https://doi.org/10.1137/16m1080264
Autor:
Eglantine Camby
Publikováno v:
Graphs and Combinatorics. 35:103-118
The vertex cover problem and the dominating set problem are two well-known problems in graph theory. Their goal is to find the minimum size of a vertex subset satisfying some properties. Both hold a connected version, which imposes that the vertex su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3539109f8184d55ade7c847d8d97a7c
https://doi.org/10.1007/s00373-018-1981-x
https://doi.org/10.1007/s00373-018-1981-x
Publikováno v:
G|A|M|E The Italian Journal of Game Studies (2013)
Game developers, even during the early years of game design, have always searched for new and interesting ways of creating more elaborate, immersive and realistic environments for their video games.
Externí odkaz:
https://doaj.org/article/e01031edf3174f89ace8ac3e6754a218
Publikováno v:
SODA
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.951-970, ⟨10.1137/1.9781611975994.57⟩
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.951-970, ⟨10.1137/1.9781611975994.57⟩
International audience; For a fixed connected graph H, the {H}-M-Deletion problem asks, given a graph G, for the minimum number of vertices that intersect all minor models of H in G. It is known that this problem can be solved in time f (tw) · n O(1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16b7f735c53cf70f725309463fed26d0
https://doi.org/10.1137/1.9781611975994.57
https://doi.org/10.1137/1.9781611975994.57
Autor:
Dimitrios M. Thilikos
Publikováno v:
Treewidth, Kernels, and Algorithms ISBN: 9783030420703
Treewidth, Kernels, and Algorithms
Treewidth, Kernels, and Algorithms, 12160, pp.222-246, 2020, Lecture Notes in Computer Science, 978-3-030-42070-3. ⟨10.1007/978-3-030-42071-0_16⟩
Treewidth, Kernels, and Algorithms
Treewidth, Kernels, and Algorithms, 12160, pp.222-246, 2020, Lecture Notes in Computer Science, 978-3-030-42070-3. ⟨10.1007/978-3-030-42071-0_16⟩
International audience; In parameterized complexity, a {\em kernelization algorithm} can be seen as a reduction of a parameterized problem to itself, so that the produced equivalent instance has size depending exclusively on the parameter. If this si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06bb4a9a4b021b0fc9c691fda99024ca
https://doi.org/10.1007/978-3-030-42071-0_16
https://doi.org/10.1007/978-3-030-42071-0_16