Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Myroslav Kryven"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031222023
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ab8287b311a7d310d45ad3374089b7f
https://doi.org/10.1007/978-3-031-22203-0_19
https://doi.org/10.1007/978-3-031-22203-0_19
Autor:
Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031231001
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1036a3166ddf30d77e417b1c2871c415
https://doi.org/10.1007/978-3-031-23101-8_14
https://doi.org/10.1007/978-3-031-23101-8_14
Autor:
Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783031159138
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::974d58935f273bf6e0bc46b905036caf
https://doi.org/10.1007/978-3-031-15914-5_20
https://doi.org/10.1007/978-3-031-15914-5_20
Publikováno v:
Journal of Graph Algorithms and Applications. 23:371-391
Given a drawing of a graph, its \emph{visual complexity} is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in 2D). Recently
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783319741796
CALDAM
CALDAM
Given a drawing of a graph, its visual complexity is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in 2D). Recently, Chapl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::847862694fdd2d91da1a994a441d9720
https://doi.org/10.1007/978-3-319-74180-2_14
https://doi.org/10.1007/978-3-319-74180-2_14
Publikováno v:
Maastricht University
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with nice convex drawings: outer $k$-planar graphs, where each edge is crossed b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53c835feb056f3a821ddc293d89dd2d7
https://cris.maastrichtuniversity.nl/en/publications/9c2eb6ae-706a-44be-b8af-a6422aa70775
https://cris.maastrichtuniversity.nl/en/publications/9c2eb6ae-706a-44be-b8af-a6422aa70775
Autor:
Alexander Wolff, Ji-Won Park, Myroslav Kryven, Alex Ravsky, Thomas C. van Dijk, Steven Chaplick
Publikováno v:
Maastricht University
Journal of Graph Algorithms and Applications, 24(4), 621-655. Brown University
Journal of Graph Algorithms and Applications
Journal of Graph Algorithms and Applications, 2020, ⟨10.7155/jgaa.00534⟩
Journal of Graph Algorithms and Applications, Brown University, 2020, ⟨10.7155/jgaa.00534⟩
Journal of Graph Algorithms and Applications, 24(4), 621-655. Brown University
Journal of Graph Algorithms and Applications
Journal of Graph Algorithms and Applications, 2020, ⟨10.7155/jgaa.00534⟩
Journal of Graph Algorithms and Applications, Brown University, 2020, ⟨10.7155/jgaa.00534⟩
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many such bundles. Any crossing in this bundled graph occurs between two bundl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::026dea209581a8e19c3cdeb04866b648
https://cris.maastrichtuniversity.nl/en/publications/5dbd0e22-edd6-45a7-bf7f-b0bedb300dd7
https://cris.maastrichtuniversity.nl/en/publications/5dbd0e22-edd6-45a7-bf7f-b0bedb300dd7