( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Obedient Plane Drawings for Disk Intersection Graphs.

, , , , и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 73-84. Springer, (2017)

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.

Bahareh Vojdani

Bahareh Talebloo

Bahareh Nazari

 

Другие публикации лиц с тем же именем

Routing in polygonal domains., , , , , , , , , и . Comput. Geom., (2020)Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees., , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 108-119. Springer, (2018)Improved Time-Space Trade-Offs for Computing Voronoi Diagrams., , , , , , и . STACS, том 66 из LIPIcs, стр. 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Routing in Polygonal Domains., , , , , , , , , и . ISAAC, том 92 из LIPIcs, стр. 10:1-10:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Time-space trade-offs for computing Euclidean minimum spanning trees., , и . J. Comput. Geom., 11 (1): 525-547 (2020)The Limited Workspace Model for Geometric Algorithms. FU Berlin, Germany, (2019)base-search.net (ftfuberlin:oai:refubium.fu-berlin.de:fub188/24954).Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon., , , , и . WALCOM, том 10167 из Lecture Notes in Computer Science, стр. 308-319. Springer, (2017)Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds., , , , , , , , и . SoCG, том 224 из LIPIcs, стр. 12:1-12:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)