Bahareh Banyassady

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds.

Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2020

Time-space trade-offs for computing Euclidean minimum spanning trees.

Bahareh Banyassady, Luis Barba, Wolfgang Mulzer

J. Comput. Geom., 2020

Routing in polygonal domains.

Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert

Comput. Geom., 2020

2019

The Limited Workspace Model for Geometric Algorithms

Bahareh Banyassady

PhD thesis, 2019

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

Yeganeh Bahoo, Bahareh Banyassady, Prosenjit K. Bose, Stephane Durocher, Wolfgang Mulzer

Theor. Comput. Sci., 2019

2018

Computational Geometry Column 67.

Bahareh Banyassady, Matias Korman, Wolfgang Mulzer

SIGACT News, 2018

Improved time-space trade-offs for computing Voronoi diagrams.

Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein

J. Comput. Geom., 2018

Geometric Algorithms with Limited Workspace: A Survey.

Bahareh Banyassady, Matias Korman, Wolfgang Mulzer

CoRR, 2018

2017

Time-Space Trade-Off for Finding the <i>k</i>-Visibility Region of a Point in a Polygon.

Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer

Proceedings of the WALCOM: Algorithms and Computation, 2017

Obedient Plane Drawings for Disk Intersection Graphs.

Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

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

Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer

CoRR, 2016

2013

An optimal algorithm for two robots path planning problem on the grid.

Mansoor Davoodi, Marjan Abedin, Bahareh Banyassady, Payam Khanteimouri, Ali Mohades

Robotics Auton. Syst., 2013