Myroslav Kryven, M.Sc.
Lehrstuhl für Informatik I
Universität Würzburg
Am Hubland
D-97074 Würzburg
Room: 01.007, Building M4
Phone: +49 (0) 931-31-80407
Awards
- First place at Graph Drawing Contest 2018: Graph Drawing Live Challenge (manual category), with Johannes Zink.
- Best Student Paper Presentation Award at the 4th International Conference on Algorithms and Discrete Applied Mathematics 2018. For the paper “Drawing Graphs
on Few Circles and Few Spheres”.
Teaching
Winter term 2020/21:
- Tutorials for Computational Geometry
Summer term 2020:
- Tutorials for Graph Visualisation
Winter term 2019/20:
- Tutorials for Approximation Algorithms
Summer term 2019:
- Seminar on Algorithmic Programming
Winter term 2018/19:
- Tutorials for Approximation Algorithms
Summer term 2018:
- Tutorials for Graph Visualisation
Winter term 2017/18:
- Tutorials for Exact Algorithms
- Seminar on Graph Visualisation
Summer term 2017:
- Tutorials for Graph Visualisation
Publications
2020[ to top ]
-
Drawing Graphs with Circular Arcs and Right-Angle Crossings. . In Proc. 17th Scand. Symp. and Workshops on Algorithm Theory (SWAT’20), Vol. 162 of LIPIcs, S. Albers (ed.), pp. 21:1–21:14. Schloss Dagstuhl~-- Leibniz-Zentrum f{ü}r Informatik, 2020.
-
Bundled Crossings Revisited. . In Journal of Graph Algorithms \& Applications, p. 35 pages. 2020.
2019[ to top ]
-
Bundled Crossings Revisited. . In Proc. 27th Int. Symp. Graph Drawing \& Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. T{ó}th (eds.), pp. 63–77. Springer-Verlag, 2019.
-
On Arrangements of Orthogonal Circles. . In Proc. 27th Int. Symp. Graph Drawing \& Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. T{ó}th (eds.), pp. 216–229. Springer-Verlag, 2019.
-
Drawing Graphs on Few Circles and Few Spheres. . In Journal of Graph Algorithms \& Applications, 23(2), pp. 371–391. 2019.
-
Bundled Crossings Revisited. . In Proc. 35th European Workshop on Computational Geometry (EuroCG’19), M. L{ö}ffler (ed.), pp. 57:1–7. 2019.
2018[ to top ]
-
Planar Steiner Orientation is NP-complete. . In Proc. 10th Int. Colloquium on Graph Theory and Combinatorics (ICGT’18). 2018.
-
Drawing Graphs on Few Circles and Few Spheres. . In Proc. 25th Int. Symp. Graph Drawing \& Network Vis. (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 591–593. Springer-Verlag, 2018.
-
Planar Steiner Orientation is NP-complete. . In The 34th Symposium on Computational Geometry: Young Researchers Forum. 2018.
-
Drawing Graphs on Few Circles and Few Spheres. . In Proc. 4th Conf. Algorithms \& Discrete Appl. Math. (CALDAM’18), Vol. 10743 of Lecture Notes in Computer Science, B. S. Panda, P. P. Goswami (eds.), pp. 164–178. Springer-Verlag, 2018.
-
Beyond Outerplanarity. . In Proc. 25th Int. Symp. Graph Drawing \& Network Vis. (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 546–559. Springer-Verlag, 2018.
