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)

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)

Obedient Plane Drawings for Disk Intersection Graphs. - Bahareh Banyassady; Michael Hoffmann 001; Boris Klemz; Maarten Löffler; Tillmann Miltzow (WADS, 2017)

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 (WALCOM, 2017)

Geometric Algorithms with Limited Workspace: A Survey. - Bahareh Banyassady; Matias Korman; Wolfgang Mulzer (CoRR, 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)

Computational Geometry Column 67. - Bahareh Banyassady; Matias Korman; Wolfgang Mulzer (SIGACT News, 2018)

A time-space trade-off for computing the k-visibility region of a point in a polygon. - Yeganeh Bahoo; Bahareh Banyassady; Prosenjit K. Bose; Stephane Durocher; Wolfgang Mulzer (Theor. Comput. Sci., 2019)

The Limited Workspace Model for Geometric Algorithms - Bahareh Banyassady (2019)

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)

Time-space trade-offs for computing Euclidean minimum spanning trees. - Bahareh Banyassady; Luis Barba; Wolfgang Mulzer (J. Comput. Geom., 2020)

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 (SoCG, 2022)