( en | de | ru )

 

Disambiguation of "Banyassady, Bahareh"

Author of the publication

copydeleteadd this publication to your clipboard
Routing in polygonal domains.

, , , , , , , , , and . Comput. Geom., (2020)

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.

Bahareh Vojdani

Bahareh Talebloo

Bahareh Nazari

 

Other publications of authors with the same name

Routing in polygonal domains., , , , , , , , , and . Comput. Geom., (2020)Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees., , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 108-119. Springer, (2018)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., , , , and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 308-319. Springer, (2017)Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds., , , , , , , , and . SoCG, volume 224 of LIPIcs, page 12:1-12:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Routing in Polygonal Domains., , , , , , , , , and . ISAAC, volume 92 of LIPIcs, page 10:1-10:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Improved Time-Space Trade-Offs for Computing Voronoi Diagrams., , , , , , and . STACS, volume 66 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Time-space trade-offs for computing Euclidean minimum spanning trees., , and . J. Comput. Geom., 11 (1): 525-547 (2020)