piwik-script

Deutsch Intern
    Chair of Computer Science I - Algorithms, Complexity, and Knowledge-Based Systems

    Kryven, Myroslav

    Myroslav Kryven, M.Sc.

    Lehrstuhl für Informatik I
    Universität Würzburg
    Am Hubland
    D-97074 Würzburg

    Room: E15

    Phone: +49 (0) 931-31-80407

    Email: myroslav.kryven@uni-wuerzburg.de


    Research interests

    • Graph Drawing
    • Geometric Networks
    • Computational Geometry
    • Graph Algorithms

    Awards


    Teaching

    Winter term 2019/20:

    Summer term 2019:

    Winter term 2018/19:

    Summer term 2018:

    Winter term 2017/18:

    Summer term 2017:


    Publications

    2019

    • Kryven, M., Ravsky, A., Wolff, A.: Drawing Graphs on Few Circles and Few Spheres. J. Graph Algorithms Appl. 23, 371-391 (2019).
       
    • 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). Springer-Verlag (2019).
       
    • 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). Springer-Verlag (2019).
       

    2018

    • 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).
       
    • 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). Springer-Verlag (2018).
       

    2017

    • 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). Springer-Verlag (2017).
       
    • 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). Springer-Verlag (2017).
       

    Master thesis

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