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

  • Hypergraph Representation via Axis-Aligned Point-Subspace Cover Firman, Oksana; Spoerhase, Joachim in Proceedings of the 16th International Conference and Workshops on Algorithms and Computation, Lecture Notes in Computer Science, P. Mutzel, M. S. Rahman, Slamin (eds.) (2022). 328–339.
  • Outside-Obstacle Representations with All Vertices on the Outer Face Firman, Oksana; Kindermann, Philipp; Klawitter, Jonathan; Klemz, Boris; Klesen, Felix; Wolff, Alexander in Proc. 38th European Workshop on Computational Geometry (EuroCG’22), E. Di Giacomo, F. Montecchiani (eds.) (2022). 54:1–8.
  • Hypergraph Representation via Axis-Aligned Point-Subspace Cover Firman, Oksana; Spoerhase, Joachim in Proc. 37th European Workshop on Computational Geometry (EuroCG’21), E. Arseneva, T. Mchedlidze (eds.) (2021). 68:1–7.
  • The Complexity of Finding Tangles Firman, Oksana; Felsner, Stefan; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proc. 36th European Workshop on Computational Geometry (EuroCG’20), S. Chaplick, P. Kindermann, A. Wolff (eds.) (2020). 67:1–8.
  • Computing Height-Optimal Tangles Faster Firman, Oksana; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.) (2019).
  • Computing Optimal Tangles Faster Firman, Oksana; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proc. 35th Europ. Workshop Comput. Geom. (EuroCG’19), M. Löffler (ed.) (2019). 61:1–7.
  • On the Weak Line Cover Numbers Firman, Oksana; Ravsky, Alexander; Wolff, Alexander in Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18), M. Korman, W. Mulzer (eds.) (2018). 63:1–5.
  • Optimal Straight-Line Drawings of Non-Planar Graphs Firman, Oksana PhD thesis, Ivan Franko National University of Lviv. (2017, May).