Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Ignaz Rutter"'
Publikováno v:
Journal of Computational Geometry, Vol 7, Iss 1 (2016)
Dynamic maps that allow continuous map rotations, for example, on mobile devices, encounter new geometric labeling issues unseen in static maps before. We study the following dynamic map labeling problem: The input is an abstract map consisting of a
Externí odkaz:
https://doaj.org/article/51586a3e3ff44862a182b8b3341f7cf3
Publikováno v:
Journal of Computational Geometry, Vol 7, Iss 1 (2016)
An $st$-path in a drawing of a graph is self-approaching if during the traversal of the corresponding curve from $s$ to any point $t'$ on the curve the distance to $t'$ is non-increasing. A path has increasing chords if it is self-approaching in both
Externí odkaz:
https://doaj.org/article/3e9bf30abd5f46b9b04e5ff61c1bc0d7
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783031159138
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2242820ca4bc2370ea672804c76aa2cd
https://doi.org/10.1016/j.jcss.2023.02.007
https://doi.org/10.1016/j.jcss.2023.02.007
Autor:
Ignaz Rutter, Helene Purchase
Publikováno v:
Journal of Graph Algorithms and Applications. 27:45-47
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8e39c44e9b34ace77c2cb65fc7f219f
https://doi.org/10.7155/jgaa.00613
https://doi.org/10.7155/jgaa.00613
Autor:
Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Publikováno v:
Theoretical Computer Science, 919, 66-74. Elsevier Science
A rectangular dual of a graph G is a contact representation of G by axis-aligned rectangles such that (i) no four rectangles share a point and (ii) the union of all rectangles is a rectangle. The partial representation extension problem for rectangul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::171d5e8c7eac6af211ba62d2147677f6
https://linkinghub.elsevier.com/retrieve/pii/S0304397522001797
https://linkinghub.elsevier.com/retrieve/pii/S0304397522001797
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031222023
Lecture Notes in Computer Science ISBN: 9783030687656
Lecture Notes in Computer Science ISBN: 9783030687656
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5956e7054b3886ce6cacd84703b2959
https://doi.org/10.1007/978-3-031-22203-0_33
https://doi.org/10.1007/978-3-031-22203-0_33
Autor:
Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031222023
A mixed graph has a set of vertices, a set of undirected egdes, and a set of directed arcs. A proper coloring of a mixed graph $G$ is a function $c$ that assigns to each vertex in $G$ a positive integer such that, for each edge $uv$ in $G$, $c(u) \ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70d821510da1db569ea7e7f8426a3426
https://ruj.uj.edu.pl/xmlui/handle/item/307964
https://ruj.uj.edu.pl/xmlui/handle/item/307964
Autor:
Simon D. Fink, Ignaz Rutter
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031304477
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a137bde16051ac85cd123f1ec8960f6
https://doi.org/10.1007/978-3-031-30448-4_15
https://doi.org/10.1007/978-3-031-30448-4_15
Autor:
Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen Kobourov, Jan Kratochvíl, Ignaz Rutter
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031222023
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d1ad5f504847d5462316ab8f29983e9
https://doi.org/10.1007/978-3-031-22203-0_27
https://doi.org/10.1007/978-3-031-22203-0_27
Publikováno v:
Journal of Graph Algorithms and Applications. 25:581-602
We study the planar orthogonal drawing style within the framework of partial representation extension. Let $(G,H,{\Gamma}_H )$ be a partial orthogonal drawing, i.e., G is a graph, $H\subseteq G$ is a subgraph and ${\Gamma}_H$ is a planar orthogonal d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ec22184e207533236df9ac8fed49e97
https://doi.org/10.7155/jgaa.00573
https://doi.org/10.7155/jgaa.00573