default search action
Myroslav Kryven
Person information
- affiliation: University of Würzburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, Alexander Wolff:
Bounding the Treewidth of Outer k-Planar Graphs via Triangulations. GD 2024: 14:1-14:17 - [c10]Stephane Durocher, Myroslav Kryven, Maarten Löffler:
String Graph with Cop Number 4 (Poster Abstract). GD 2024: 53:1-53:3 - [i10]Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, Alexander Wolff:
Bounding the Treewidth of Outer k-Planar Graphs via Triangulations. CoRR abs/2408.04264 (2024) - 2023
- [c9]Stephane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa, Timothy Zapp:
Cops and Robbers on 1-Planar Graphs. GD (2) 2023: 3-17 - [c8]Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf:
On the 2-Layer Window Width Minimization Problem. SOFSEM 2023: 209-221 - [i9]Stephane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa, Timothy Zapp:
Cops and Robbers on 1-Planar Graphs. CoRR abs/2309.01001 (2023) - 2022
- [b1]Myroslav Kryven:
Optimizing Crossings in Circular-Arc Drawings and Circular Layouts. Julius Maximilians University Würzburg, Germany, 2022, ISBN 978-3-95826-174-7, pp. 1-129 - [c7]Abu Reyan Ahmed, Stephen G. Kobourov, Myroslav Kryven:
An FPT Algorithm for Bipartite Vertex Splitting. GD 2022: 261-268 - [c6]Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink:
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. WG 2022: 271-286 - [i8]Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink:
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. CoRR abs/2202.11604 (2022) - [i7]Abu Reyan Ahmed, Stephen G. Kobourov, Myroslav Kryven:
An FPT Algorithm for Bipartite Vertex Splitting. CoRR abs/2208.12898 (2022) - 2020
- [j2]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. J. Graph Algorithms Appl. 24(4): 621-655 (2020) - [c5]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
Drawing Graphs with Circular Arcs and Right-Angle Crossings. SWAT 2020: 21:1-21:14 - [i6]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
Drawing Graphs with Circular Arcs and Right Angle Crossings. CoRR abs/2003.04740 (2020)
2010 – 2019
- 2019
- [j1]Myroslav Kryven, Alexander Ravsky, Alexander Wolff:
Drawing Graphs on Few Circles and Few Spheres. J. Graph Algorithms Appl. 23(2): 371-391 (2019) - [c4]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. GD 2019: 63-77 - [c3]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
On Arrangements of Orthogonal Circles. GD 2019: 216-229 - [i5]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
On Arrangements of Orthogonal Circles. CoRR abs/1907.08121 (2019) - 2018
- [c2]Myroslav Kryven, Alexander Ravsky, Alexander Wolff:
Drawing Graphs on Few Circles and Few Spheres. CALDAM 2018: 164-178 - [i4]Moritz Beck, Johannes Blum, Myroslav Kryven, Andre Löffler, Johannes Zink:
Planar Steiner Orientation is NP-complete. CoRR abs/1804.07496 (2018) - [i3]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. CoRR abs/1812.04263 (2018) - 2017
- [c1]Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff:
Beyond Outerplanarity. GD 2017: 546-559 - [i2]Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff:
Beyond Outerplanarity. CoRR abs/1708.08723 (2017) - [i1]Myroslav Kryven, Alexander Ravsky, Alexander Wolff:
Drawing Graphs on Few Circles and Few Spheres. CoRR abs/1709.06965 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint