Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Oksana Firman
Observed name:
Firman, Oksana
Institution:
University of Würzburg
Observed institution:
University of Würzburg
ORCID:
0000-0002-9450-7640
Observed ORCID:
0000-0002-9450-7640
OpenAlex ID:
A5023807201
Bounding the Treewidth of Outer k-Planar Graphs via Triangulations
2024
·
Firman, Oksana
, Gutowski, Grzegorz
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
7
PDF
Outerplanar and Forest Storyplans
2024
·
Jiří Fiala
, Oksana Firman
, et al.
·
Lecture notes in computer science
·
6
PDF
Outside-Obstacle Representations with All Vertices on the Outer Face
2022
·
Firman, Oksana
, Kindermann, Philipp
, et al.
·
arXiv (Cornell University)
·
5
PDF
Computing Height-Optimal Tangles Faster
2019
·
Oksana Firman
, Philipp Kindermann
, et al.
·
Lecture notes in computer science
·
5
Outside-Obstacle Representations with All Vertices on the Outer Face
2023
·
Oksana Firman
, Philipp Kindermann
, et al.
·
Lecture notes in computer science
·
3
The Complexity of Finding Tangles
2022
·
Oksana Firman
, Philipp Kindermann
, et al.
·
Lecture notes in computer science
·
3
Hypergraph Representation via Axis-Aligned Point-Subspace Cover
2025
·
Oksana Firman
, Joachim Spoerhase
·
Discrete Mathematics & Theoretical Computer Science
·
2
PDF
Morphing Graph Drawings in the Presence of Point Obstacles
2024
·
Oksana Firman
, Tim Hegemann
, et al.
·
Lecture notes in computer science
·
2
Morphing graph drawings in the presence of point obstacles
2026
·
Oksana Firman
, Tim Hegemann
, et al.
·
Journal of Computer and System Sciences
·
1
Deciding the Feasibility and Minimizing the Height of Tangles
2025
·
Oksana Firman
, Philipp Kindermann
, et al.
·
Journal of Graph Algorithms and Applications
·
1
PDF
Outerplanar and Forest Storyplans
2026
·
Fiala, Jiří
, Firman, Oksana
, et al.
·
DOAJ (DOAJ: Directory of Open Access Journals)
Hypergraph Representation via Axis-Aligned Point-Subspace Cover
2022
·
Oksana Firman
, Joachim Spoerhase
·
Lecture notes in computer science
Computing Optimal Tangles Faster
2019
·
Oksana Firman
, Philipp Kindermann
, et al.
·
arXiv (Cornell University)
Show more works
View as search
Works count:
14
Citation count:
35
H-index:
4
I10-index:
Year
Topic
Type