Author of the publication

Improved Time-Space Trade-Offs for Computing Voronoi Diagrams.

, , , , , , and . STACS, volume 66 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (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.

No persons found for author name Banyassady, Bahareh
add a person with the name Banyassady, Bahareh
 

Other publications of authors with the same name

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)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)Geometric Algorithms with Limited Workspace: A Survey., , and . CoRR, (2018)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)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-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 and Autonomous Systems, 61 (12): 1406-1414 (2013)Obedient Plane Drawings for Disk Intersection Graphs., , , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 73-84. Springer, (2017)Improved time-space trade-offs for computing Voronoi diagrams., , , , , , and . JoCG, 9 (1): 191-212 (2018)