Myroslav Kryven, M.Sc.

Lehrstuhl für Informatik I
Universität Würzburg
Am Hubland
D-97074 Würzburg
Raum: 01.007, Gebäude M4
Tel.: +49 (0) 931-31-80407
Forschungsinteressen
- Graphenzeichnen
- Geometrische Netzwerke
- Algorithmische Geometrie
- Graphalgorithmen
Auszeichnungen
- Ersten Platz auf Graph Drawing Contest 2018: Graph Drawing Live Challenge (manual category), mit Johannes Zink.
- Best Student Paper Presentation Award auf the 4th International Conference on Algorithms and Discrete Applied Mathematics 2018. Für das Paper “Drawing Graphs
on Few Circles and Few Spheres”.
Lehre
Wintersemester 2020/21:
- Übungen zu Algorithmische Geometrie
Sommersemester 2020:
- Übungen zu Visualisierung von Graphen
Wintersemester 2019/20:
- Übungen zu Approximationsalgorithmen
Sommersemester 2019:
Wintersemester 2018/19:
- Übungen zu Approximationsalgorithmen
Sommersemester 2018:
- Übungen zu Visualisierung von Graphen
Wintersemester 2017/18:
- Übungen zu Exakte Algorithmen
- Seminar Visualisierung von Graphen
Sommersemester 2017:
- Übungen zu Visualisierung von Graphen
Veröffentlichungen
2020[ to top ]
-
Drawing Graphs with Circular Arcs and Right-Angle Crossings in Proc. 17th Scand. Symp. and Workshops on Algorithm Theory (SWAT’20), LIPIcs, S. Albers (ed.) (2020). (Vol. 162) 21:1–21:14.
-
Bundled Crossings Revisited in Journal of Graph Algorithms \& Applications (2020). 35 pages.
2019[ to top ]
-
Drawing Graphs on Few Circles and Few Spheres in Journal of Graph Algorithms \& Applications (2019). 23(2) 371–391.
-
On Arrangements of Orthogonal Circles in Proc. 27th Int. Symp. Graph Drawing \& Network Vis. (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T{\’o}th (eds.) (2019). (Vol. 11904) 216–229.
-
Bundled Crossings Revisited in Proc. 27th Int. Symp. Graph Drawing \& Network Vis. (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T{\’o}th (eds.) (2019). (Vol. 11904) 63–77.
-
Bundled Crossings Revisited in Proc. 35th European Workshop on Computational Geometry (EuroCG’19), M. L{\"o}ffler (ed.) (2019). 57:1–7.
2018[ to top ]
-
Planar Steiner Orientation is NP-complete in The 34th Symposium on Computational Geometry: Young Researchers Forum (2018).
-
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), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.) (2018). (Vol. 10692) 591–593.
-
Drawing Graphs on Few Circles and Few Spheres in Proc. 4th Conf. Algorithms \& Discrete Appl. Math. (CALDAM’18), Lecture Notes in Computer Science, B. S. Panda, P. P. Goswami (eds.) (2018). (Vol. 10743) 164–178.
-
Beyond Outerplanarity in Proc. 25th Int. Symp. Graph Drawing \& Network Vis. (GD’17), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.) (2018). (Vol. 10692) 546–559.
Masterarbeit
- Qualocation method for the Cauchy problem in a doubly connected domain. University of Lviv (2015)