Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Meike Hatzel"'
Autor:
Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel, Tomáš Masařík, Jana Novotná, Karolina Okrasa
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Graph Theory (2022)
Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjoint triangles, it suffices to delete at most 2k edges to obtain a triangle-free graph. The conjecture holds for graphs with small treewidth or small maximum average degree, inclu
Externí odkaz:
https://doaj.org/article/b9d6277e33dc42659da823f7cc2d8440
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Graph Theory (2022)
A bramble in an undirected graph $G$ is a family of connected subgraphs of $G$ such that for every two subgraphs $H_1$ and $H_2$ in the bramble either $V(H_1) \cap V(H_2) \neq \emptyset$ or there is an edge of $G$ with one endpoint in $V(H_1)$ and th
Externí odkaz:
https://doaj.org/article/3087e4fd424c4c00970f58434b1ea0f0
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 190, Iss Proc. EXPRESS/SOS 2015, Pp 61-75 (2015)
We study encodings from CSP into asynchronous CCS with name passing and matching, so in fact, the asynchronous pi-calculus. By doing so, we discuss two different ways to map the multi-way synchronisation mechanism of CSP into the two-way synchronisat
Externí odkaz:
https://doaj.org/article/9dced4df424f4755abc6ba15356dd29c
Publikováno v:
Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611977585
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f16622206b34c918d238853e85b4c8b1
https://doi.org/10.1137/1.9781611977585.ch15
https://doi.org/10.1137/1.9781611977585.ch15
Autor:
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomáš Masařík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
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_________::c2a5b985f0457293667e2d03642a1b8d
https://doi.org/10.1137/1.9781611977554.ch123
https://doi.org/10.1137/1.9781611977554.ch123
Publikováno v:
Procedia Computer Science. 195:248-256
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24d38266d0ac9145de88e4da65db20fd
https://doi.org/10.1016/j.procs.2021.11.031
https://doi.org/10.1016/j.procs.2021.11.031
Publikováno v:
The Electronic Journal of Combinatorics
We prove a recent conjecture of Beisegel et al. that for every positive integer k, every graph containing an induced P_k also contains an avoidable P_k. Avoidability generalises the notion of simpliciality best known in the context of chordal graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0e1ea27a6f839ec68ba3ef0a071f71a
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030307851
WG
Graph-Theoretic Concepts in Computer Science-45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Graph-Theoretic Concepts in Computer Science
WG
Graph-Theoretic Concepts in Computer Science-45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Graph-Theoretic Concepts in Computer Science
A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition. It was introduced by Norine and intended as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e5ffc3d3b84afd14ad13e60a7994904
https://doi.org/10.1007/978-3-030-30786-8_5
https://doi.org/10.1007/978-3-030-30786-8_5
Publikováno v:
EXPRESS/SOS
Electronic Proceedings in Theoretical Computer Science, Vol 190, Iss Proc. EXPRESS/SOS 2015, Pp 61-75 (2015)
Electronic Proceedings in Theoretical Computer Science, Vol 190, Iss Proc. EXPRESS/SOS 2015, Pp 61-75 (2015)
We study encodings from CSP into asynchronous CCS with name passing and matching, so in fact, the asynchronous pi-calculus. By doing so, we discuss two different ways to map the multi-way synchronisation mechanism of CSP into the two-way synchronisat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da36ad294f3baf157e1556b2e971812b
https://doi.org/10.4204/eptcs.190.5
https://doi.org/10.4204/eptcs.190.5
Autor:
Meike Hatzel, Sebastian Wiederrecht
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030002558
WG
WG
A strong edge colouring is a proper colouring of the edges of a graph such that no two edges that are incident with a common edge receive the same colour. The square of a graph G is obtained from G by adding edges between vertices of distance exactly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f158909a72567b44d157117e0a755cef
https://doi.org/10.1007/978-3-030-00256-5_21
https://doi.org/10.1007/978-3-030-00256-5_21