English Intern
Lehrstuhl für Informatik I - Algorithmen und Komplexität

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

Email: myroslav.kryven@uni-wuerzburg.de

Forschungsinteressen

  • Graphenzeichnen
  • Geometrische Netzwerke
  • Algorithmische Geometrie
  • Graphalgorithmen

Auszeichnungen

Lehre

Wintersemester 2020/21:

Sommersemester 2020:

Wintersemester 2019/20:

Sommersemester 2019:

Wintersemester 2018/19:

Sommersemester 2018:

Wintersemester 2017/18:

Sommersemester 2017:

Veröffentlichungen

2020[ to top ]
  • Drawing Graphs with Circular Arcs and Right-Angle Crossings. Chaplick, Steven; F{ö}rster, Henry; Kryven, Myroslav; Wolff, Alexander. 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. Chaplick, Steven; van Dijk, Thomas C.; Kryven, Myroslav; Park, Ji-Won; Ravsky, Alexander; Wolff, Alexander. In Journal of Graph Algorithms \& Applications, p. 35 pages. 2020.
2019[ to top ]
  • Bundled Crossings Revisited. Chaplick, Steven; van Dijk, Thomas C.; Kryven, Myroslav; Park, Ji-Won; Ravsky, Alexander; Wolff, Alexander. 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.
  • Drawing Graphs on Few Circles and Few Spheres. Kryven, Myroslav; Ravsky, Alexander; Wolff, Alexander. In Journal of Graph Algorithms \& Applications, 23(2), pp. 371–391. 2019.
  • On Arrangements of Orthogonal Circles. Chaplick, Steven; F{ö}rster, Henry; Kryven, Myroslav; Wolff, Alexander. 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.
  • Bundled Crossings Revisited. Chaplick, Steven; van Dijk, Thomas C.; Kryven, Myroslav; Park, Ji-Won; Ravsky, Alexander; Wolff, Alexander. 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. Beck, Moritz; Blum, Johannes; Kryven, Myroslav; Löffler, Andre; Zink, Johannes. In Proc. 10th Int. Colloquium on Graph Theory and Combinatorics (ICGT’18). 2018.
  • Drawing Graphs on Few Circles and Few Spheres. Kryven, Myroslav; Ravsky, Alexander; Wolff, Alexander. 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. Beck, Moritz; Blum, Johannes; Kryven, Myroslav; Löffler, Andre; Zink, Johannes. In The 34th Symposium on Computational Geometry: Young Researchers Forum. 2018.
  • Drawing Graphs on Few Circles and Few Spheres. Kryven, Myroslav; Ravsky, Alexander; Wolff, Alexander. 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. Chaplick, Steven; Kryven, Myroslav; Liotta, Giuseppe; L{ö}ffler, Andre; Wolff, Alexander. 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.

Masterarbeit

  • Qualocation method for the Cauchy problem in a doubly connected domain. University of Lviv (2015)