Bahareh Banyassady

Orcid: 0000-0002-3422-9028

According to our database1, Bahareh Banyassady authored at least 12 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2019
The Limited Workspace Model for Geometric Algorithms
PhD thesis, 2019

A time-space trade-off for computing the <i>k</i>-visibility region of a point in a polygon.
Theor. Comput. Sci., 2019

2018
Computational Geometry Column 67.
SIGACT News, 2018

Geometric Algorithms with Limited Workspace: A Survey.
CoRR, 2018

Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Time-Space Trade-Off for Finding the <i>k</i>-Visibility Region of a Point in a Polygon.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Obedient Plane Drawings for Disk Intersection Graphs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Improved Time-Space Trade-Offs for Computing Voronoi Diagrams.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Routing in Polygonal Domains.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon.
CoRR, 2016

2013
An optimal algorithm for two robots path planning problem on the grid.
Robotics Auton. Syst., 2013


  Loading...