Oksana Firman

Orcid: 0000-0002-9450-7640

Affiliations:
  • University of Würzburg, Germany


According to our database1, Oksana Firman authored at least 9 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Deciding the Feasibility and Minimizing the Height of Tangles.
J. Graph Algorithms Appl., 2025

2024
Bounding the Treewidth of Outer <i>k</i>-Planar Graphs via Triangulations.
CoRR, 2024

Morphing Graph Drawings in the Presence of Point Obstacles.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Outerplanar and Forest Storyplans.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Bounding the Treewidth of Outer k-Planar Graphs via Triangulations.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023
The Complexity of Finding Tangles.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2022
Hypergraph Representation via Axis-Aligned Point-Subspace Cover.
Proceedings of the WALCOM: Algorithms and Computation, 2022

Outside-Obstacle Representations with All Vertices on the Outer Face.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2019
Computing Height-Optimal Tangles Faster.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019


  Loading...