piwik-script

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

    • 1.
      Chaplick, S., Förster, H., Kryven, M., Wolff, A.: Drawing Graphs with Circular Arcs and Right-Angle Crossings. In: Albers, S. (ed.) Proc. 17th Scand. Symp. and Workshops on Algorithm Theory (SWAT’20). pp. 21:1–21:14. Schloss Dagstuhl~-- Leibniz-Zentrum für Informatik (2020).
      [ BibTeX ] [ DOI ] [slides] [arxiv] [video]
       
    • 2.
      Chaplick, S., van Dijk, T.C., Kryven, M., Park, J.-W., Ravsky, A., Wolff, A.: Bundled Crossings Revisited. Journal of Graph Algorithms & Applications. 35 pages (2020).
      [ BibTeX ] [ DOI ] [slides]
       

    2019

    • 1.
      Kryven, M., Ravsky, A., Wolff, A.: Drawing Graphs on Few Circles and Few Spheres. Journal of Graph Algorithms & Applications. 23, 371–391 (2019).
      [ BibTeX ] [ DOI ] [slides] [arxiv]
       
    • 2.
      Chaplick, S., Förster, H., Kryven, M., Wolff, A.: On Arrangements of Orthogonal Circles. In: Archambault, D. and Tóth, C.D. (eds.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). pp. 216–229. Springer-Verlag (2019).
      [ BibTeX ] [ DOI ] [slides] [arxiv]
       
    • 3.
      Chaplick, S., van Dijk, T.C., Kryven, M., Park, J.-W., Ravsky, A., Wolff, A.: Bundled Crossings Revisited. In: Archambault, D. and Tóth, C.D. (eds.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). pp. 63–77. Springer-Verlag (2019).
      [ BibTeX ] [ DOI ] [slides] [arxiv]
       
    • 4.
      Chaplick, S., van Dijk, T.C., Kryven, M., Park, J.-W., Ravsky, A., Wolff, A.: Bundled Crossings Revisited. In: Löffler, M. (ed.) Proc. 35th European Workshop on Computational Geometry (EuroCG’19). pp. 57:1–7 (2019).
      [ BibTeX ] [pdf] [arxiv]
       

    2018

    • 1.
      Beck, M., Blum, J., Kryven, M., Löffler, A., Zink, J.: Planar Steiner Orientation is NP-complete. The 34th Symposium on Computational Geometry: Young Researchers Forum (2018).
      [ BibTeX ] [pdf] [arxiv]
       
    • 2.
      Beck, M., Blum, J., Kryven, M., Löffler, A., Zink, J.: Planar Steiner Orientation is NP-complete. Proc. 10th Int. Colloquium on Graph Theory and Combinatorics (ICGT’18) (2018).
      [ BibTeX ] [pdf] [arxiv]
       
    • 3.
      Kryven, M., Ravsky, A., Wolff, A.: Drawing Graphs on Few Circles and Few Spheres. In: Frati, F. and Ma, K.-L. (eds.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17). pp. 591–593. Springer-Verlag (2018).
      [ BibTeX ] [arxiv] [poster]
       
    • 4.
      Kryven, M., Ravsky, A., Wolff, A.: Drawing Graphs on Few Circles and Few Spheres. In: Panda, B.S. and Goswami, P.P. (eds.) Proc. 4th Conf. Algorithms & Discrete Appl. Math. (CALDAM’18). pp. 164–178. Springer-Verlag (2018).
      [ BibTeX ] [ DOI ] [slides] [arxiv]
       
    • 5.
      Chaplick, S., Kryven, M., Liotta, G., Löffler, A., Wolff, A.: Beyond Outerplanarity. In: Frati, F. and Ma, K.-L. (eds.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17). pp. 546–559. Springer-Verlag (2018).
      [ BibTeX ] [ DOI ] [slides] [arxiv]
       

    Masterarbeit

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