piwik-script

Deutsch Intern
    Chair of Computer Science I - Algorithms and Complexity

    Oksana Firman, M.Sc.

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

    Room: 01.005, Building M4

    Phone: +49 (0) 931 31-87726

    Email: oksana.firman@uni-wuerzburg.de

    Research interests

    • Graph drawing

    Teaching

    SS 22: Tutorials for Exact Algorithms

    WS 21/22: Tutorials for Approximation Algorithms

    SS 21: Tutorials for Exact Algorithms

    WS 20/21: Tutorials for Advanced Algorithms

    WS 19/20: Tutorials for Computational Geometry

    SS 19: Tutorials for Graph Visualization

    WS 18/19: Tutorials for Computational Geometry

    WS 17/18: Tutorials for Computational Geometry

    Publications

    • 1.
      Firman, O., Spoerhase, J.: Hypergraph Representation via Axis-Aligned Point-Subspace Cover. In: Mutzel, P., Rahman, M.S., and Slamin (eds.) Proceedings of the 16th International Conference and Workshops on Algorithms and Computation. pp. 328–339. Springer-Verlag (2022).
      [ BibTeX ] [slides] [arxiv]
       
    • 2.
      Firman, O., Kindermann, P., Klawitter, J., Klemz, B., Klesen, F., Wolff, A.: Outside-Obstacle Representations with All Vertices on the Outer Face. In: Di Giacomo, E. and Montecchiani, F. (eds.) Proc. 38th European Workshop on Computational Geometry (EuroCG’22). pp. 54:1–8 (2022).
      [ BibTeX ] [ URL ] [pdf] [slides] [arxiv]
       
    • 3.
      Firman, O., Spoerhase, J.: Hypergraph Representation via Axis-Aligned Point-Subspace Cover. In: Arseneva, E. and Mchedlidze, T. (eds.) Proc. 37th European Workshop on Computational Geometry (EuroCG’21). pp. 68:1–7 (2021).
      [ BibTeX ] [ URL ] [pdf] [slides]
       
    • 4.
      Firman, O., Felsner, S., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: The Complexity of Finding Tangles. In: Chaplick, S., Kindermann, P., and Wolff, A. (eds.) Proc. 36th European Workshop on Computational Geometry (EuroCG’20). pp. 67:1–8 (2020).
      [ BibTeX ] [pdf] [slides] [arxiv]
       
    • 5.
      Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing Height-Optimal Tangles Faster. In: Archambault, D. and Tóth, C.D. (eds.) Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19). Springer-Verlag (2019).
      [ BibTeX ] [slides] [arxiv]
       
    • 6.
      Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing Optimal Tangles Faster. In: Löffler, M. (ed.) Proc. 35th Europ. Workshop Comput. Geom. (EuroCG’19). pp. 61:1–7 (2019).
      [ BibTeX ] [ URL ] [slides] [arxiv]
       
    • 7.
      Firman, O., Ravsky, A., Wolff, A.: On the Weak Line Cover Numbers. In: Korman, M. and Mulzer, W. (eds.) Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18). pp. 63:1–5 (2018).
      [ BibTeX ] [ URL ] [slides]
       
    • 8.
      Firman, O.: Optimal Straight-Line Drawings of Non-Planar Graphs, https://www1.pub.informatik.uni-wuerzburg.de/pub/firman/pub/f-osldn-MTh17.pdf, (2017).
      [ BibTeX ] [ URL ]