( en | de | ru )

 

Disambiguation of "Firman, Oksana"

Author of the publication

copydeleteadd this publication to your clipboard
Computing Optimal-Height Tangles Faster

, , , , and . Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD'19), volume 11904 of Lecture Notes in Computer Science, page 203--215. Springer-Verlag, (2019)
DOI: 10.1007/978-3-030-35802-0_16

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Paul Firman

Oksana Balajan

Oksana Lisec

Oksana Möller

Oksana Schaeffer

 

Other publications of authors with the same name

Optimal Straight-Line Drawings of Non-Planar Graphs. Ivan Franko National University of Lviv, (May 2017)Computing Height-Optimal Tangles Faster., , , , and . GD, volume 11904 of Lecture Notes in Computer Science, page 203-215. Springer, (2019)Outerplanar and Forest Storyplans., , , , and . CoRR, (2023)Morphing Graph Drawings in the Presence of Point Obstacles., , , , , , and . CoRR, (2023)Hypergraph Representation via Axis-Aligned Point-Subspace Cover., and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 328-339. Springer, (2022)The Complexity of Finding Tangles, , , , , and . Proc. 36th European Workshop on Computational Geometry (EuroCG'20), page 67:1--8. (2020)Computing Optimal Tangles Faster, , , , and . Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19), page 61:1-7. (2019)Hypergraph Representation via Axis-Aligned Point-Subspace Cover, and . Proc. 37th European Workshop on Computational Geometry (EuroCG'21), page 68:1--7. (2021)