Zobrazeno 1 - 10
of 81
pro vyhledávání: '"Marcus Schaefer"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
An edge in a drawing of a graph is called $\textit{even}$ if it intersects every other edge of the graph an even number of times. Pach and Tóth proved that a graph can always be redrawn such that its even edges are not involved in any intersections.
Externí odkaz:
https://doaj.org/article/0589acb45eb4485abfb6eabd87447774
Autor:
Marcus Schaefer
Publikováno v:
SIAM Journal on Discrete Mathematics. 36:2959-2974
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb4ea4b4980416f4f0aa6c6e2bb6df30
https://doi.org/10.1137/21m1464749
https://doi.org/10.1137/21m1464749
Autor:
Marcus Schaefer, Daniel Štefankovič
Publikováno v:
Journal of Graph Algorithms and Applications. 26:35-58
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d554b4f466986e2e17cc00684d02e38
https://doi.org/10.7155/jgaa.00580
https://doi.org/10.7155/jgaa.00580
Autor:
Marcus Schaefer
Publikováno v:
Journal of Graph Algorithms and Applications. 25:195-218
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fb5dc6469b33ede359ae7fbba0f7d0c
https://doi.org/10.7155/jgaa.00557
https://doi.org/10.7155/jgaa.00557
Autor:
Marcus Schaefer
Publikováno v:
Journal of Graph Algorithms and Applications. 25:29-41
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae4cf5f55b39c573a1d6206ee5d72c2a
https://doi.org/10.7155/jgaa.00548
https://doi.org/10.7155/jgaa.00548
Autor:
Marcus Schaefer
Publikováno v:
The Electronic Journal of Combinatorics. 28
We show that a plane graph can be embedded with its vertices at arbitrarily assigned locations in the plane and at most $6n-1$ bends per edge. This improves and simplifies a classic result by Pach and Wenger. The proof extends to orthogonal drawings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ed6b20b51c66c7253e553f7b8615c61
https://doi.org/10.37236/10106
https://doi.org/10.37236/10106
Autor:
Marcus Schaefer
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030929305
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::293d746a24560e507426ae6b74166584
https://doi.org/10.1007/978-3-030-92931-2_5
https://doi.org/10.1007/978-3-030-92931-2_5
Autor:
Marcus Schäfer
Bachelorarbeit aus dem Jahr 2020 im Fachbereich Geschichte - Amerika, Note: 1,0, Freie Universität Berlin (Friedrich-Meinecke-Institut), Sprache: Deutsch, Abstract: Im dieser Arbeit wird aus einer körper- bzw. kulturgeschichtlichen Perspektive hera
Publikováno v:
Journal of Knot Theory and Its Ramifications
Journal of Knot Theory and Its Ramifications, World Scientific Publishing, 2020, 29 (06), pp.2050043. ⟨10.1142/S0218216520500431⟩
Journal of Knot Theory and Its Ramifications, World Scientific Publishing, 2020, 29 (06), pp.2050043. ⟨10.1142/S0218216520500431⟩
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::097d7c65d8d7b60582817db58b982bc1
http://arxiv.org/abs/1908.04073
http://arxiv.org/abs/1908.04073