( en | de | ru )

 

Disambiguation of "Banyassady, Bahareh"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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

Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees., , and . CoRR, (2017)Computational Geometry Column 67., , and . SIGACT News, 49 (2): 77-94 (2018)Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon., , , , and . CoRR, (2016)An optimal algorithm for two robots path planning problem on the grid., , , , and . Robotics Auton. Syst., 61 (12): 1406-1414 (2013)A time-space trade-off for computing the k-visibility region of a point in a polygon., , , , and . Theor. Comput. Sci., (2019)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)Routing in polygonal domains., , , , , , , , , and . Comput. Geom., (2020)Geometric Algorithms with Limited Workspace: A Survey., , and . CoRR, (2018)The Limited Workspace Model for Geometric Algorithms. FU Berlin, Germany, (2019)base-search.net (ftfuberlin:oai:refubium.fu-berlin.de:fub188/24954).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)