Computing Height-Optimal Tangles Faster. - Oksana Firman; Philipp Kindermann; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (GD, 2019)

Outside-Obstacle Representations with All Vertices on the Outer Face. - Oksana Firman; Philipp Kindermann; Jonathan Klawitter; Boris Klemz; Felix Klesen; Alexander Wolff 001 (GD, 2022)

The Complexity of Finding Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2023)

Deciding the Feasibility and Minimizing the Height of Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2023)

Bounding the Treewidth of Outer k-Planar Graphs via Triangulations. - Oksana Firman; Grzegorz Gutowski; Myroslav Kryven; Yuto Okada; Alexander Wolff 001 (GD, 2024)

Outerplanar and Forest Storyplans. - Jirí Fiala 001; Oksana Firman; Giuseppe Liotta; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2024)

Morphing Graph Drawings in the Presence of Point Obstacles. - Oksana Firman; Tim Hegemann; Boris Klemz; Felix Klesen; Marie Diana Sieper; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2024)

Bounding the Treewidth of Outer k-Planar Graphs via Triangulations. - Oksana Firman; Grzegorz Gutowski; Myroslav Kryven; Yuto Okada; Alexander Wolff 001 (CoRR, 2024)

Hypergraph Representation via Axis-Aligned Point-Subspace Cover. - Oksana Firman; Joachim Spoerhase (Discret. Math. Theor. Comput. Sci., 2025)