Deutsch Intern
    Chair of Computer Science I - Algorithms and Complexity

    Disputation of Myroslav Kryven


    Myroslav Kryven has defended his doctoral thesis entitled "Optimizing Crossings in Circular-Arc Drawings and Circular Layouts" in a public disputation on October 2.

    In his thesis Myroslav Kryven studied visualizations of abstract networks called graphs. Most graphs require crossings to be drawn. The more crossings a drawing has, the more difficult it is to perceive by a human. Therefore, graphs that can be drawn with few crossings are of particular interest. Such graphs are called beyond-planar graphs. Myroslav defined and studied different beyond-planar graph classes and developed algorithms for their recognition and visualization.

    Congratulations, Myroslav, for the last successful step towards the Ph.D.!