Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Bahareh Banyassady
@inproceedings{DBLP:conf/compgeom/BanyassadyBBBFH22, author = {Bahareh Banyassady and Mark de Berg and Karl Bringmann and Kevin Buchin and Henning Fernau and Dan Halperin and Irina Kostitsyna and Yoshio Okamoto and Stijn Slot}, editor = {Xavier Goaoc and Michael Kerber}, title = {Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds}, booktitle = {38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany}, series = {LIPIcs}, volume = {224}, pages = {12:1--12:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.SoCG.2022.12}, doi = {10.4230/LIPICS.SOCG.2022.12}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/compgeom/BanyassadyBBBFH22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2205-07777, author = {Bahareh Banyassady and Mark de Berg and Karl Bringmann and Kevin Buchin and Henning Fernau and Dan Halperin and Irina Kostitsyna and Yoshio Okamoto and Stijn Slot}, title = {Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds}, journal = {CoRR}, volume = {abs/2205.07777}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2205.07777}, doi = {10.48550/ARXIV.2205.07777}, eprinttype = {arXiv}, eprint = {2205.07777}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2205-07777.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/BanyassadyCKMRR20, author = {Bahareh Banyassady and Man{-}Kwun Chiu and Matias Korman and Wolfgang Mulzer and Andr{\'{e}} van Renssen and Marcel Roeloffzen and Paul Seiferth and Yannik Stein and Birgit Vogtenhuber and Max Willert}, title = {Routing in polygonal domains}, journal = {Comput. Geom.}, volume = {87}, pages = {101593}, year = {2020}, url = {https://doi.org/10.1016/j.comgeo.2019.101593}, doi = {10.1016/J.COMGEO.2019.101593}, timestamp = {Mon, 09 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/BanyassadyCKMRR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jocg/BanyassadyBM20, author = {Bahareh Banyassady and Luis Barba and Wolfgang Mulzer}, title = {Time-space trade-offs for computing Euclidean minimum spanning trees}, journal = {J. Comput. Geom.}, volume = {11}, number = {1}, pages = {525--547}, year = {2020}, url = {https://doi.org/10.20382/jocg.v11i1a21}, doi = {10.20382/JOCG.V11I1A21}, timestamp = {Mon, 09 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jocg/BanyassadyBM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/basesearch/Banyassady19, author = {Bahareh Banyassady}, title = {The Limited Workspace Model for Geometric Algorithms}, school = {{FU} Berlin, Germany}, year = {2019}, url = {https://refubium.fu-berlin.de/handle/fub188/24954}, doi = {10.17169/REFUBIUM-2714}, urn = {urn:nbn:de:kobv:188-refubium-24954-9}, timestamp = {Fri, 02 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/phd/basesearch/Banyassady19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BahooBBDM19, author = {Yeganeh Bahoo and Bahareh Banyassady and Prosenjit K. Bose and Stephane Durocher and Wolfgang Mulzer}, title = {A time-space trade-off for computing the \emph{k}-visibility region of a point in a polygon}, journal = {Theor. Comput. Sci.}, volume = {789}, pages = {13--21}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.06.017}, doi = {10.1016/J.TCS.2018.06.017}, timestamp = {Mon, 23 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BahooBBDM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jocg/BanyassadyKMRRS18, author = {Bahareh Banyassady and Matias Korman and Wolfgang Mulzer and Andr{\'{e}} van Renssen and Marcel Roeloffzen and Paul Seiferth and Yannik Stein}, title = {Improved time-space trade-offs for computing Voronoi diagrams}, journal = {J. Comput. Geom.}, volume = {9}, number = {1}, pages = {191--212}, year = {2018}, url = {https://doi.org/10.20382/jocg.v9i1a6}, doi = {10.20382/JOCG.V9I1A6}, timestamp = {Thu, 10 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jocg/BanyassadyKMRRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/BanyassadyKM18, author = {Bahareh Banyassady and Matias Korman and Wolfgang Mulzer}, title = {Computational Geometry Column 67}, journal = {{SIGACT} News}, volume = {49}, number = {2}, pages = {77--94}, year = {2018}, url = {https://doi.org/10.1145/3232679.3232692}, doi = {10.1145/3232679.3232692}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigact/BanyassadyKM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/BanyassadyBM18, author = {Bahareh Banyassady and Luis Barba and Wolfgang Mulzer}, editor = {Michael A. Bender and Martin Farach{-}Colton and Miguel A. Mosteiro}, title = {Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees}, booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10807}, pages = {108--119}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-77404-6\_9}, doi = {10.1007/978-3-319-77404-6\_9}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/BanyassadyBM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-05868, author = {Bahareh Banyassady and Matias Korman and Wolfgang Mulzer}, title = {Geometric Algorithms with Limited Workspace: {A} Survey}, journal = {CoRR}, volume = {abs/1806.05868}, year = {2018}, url = {http://arxiv.org/abs/1806.05868}, eprinttype = {arXiv}, eprint = {1806.05868}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-05868.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BanyassadyCKMRR17, author = {Bahareh Banyassady and Man{-}Kwun Chiu and Matias Korman and Wolfgang Mulzer and Andr{\'{e}} van Renssen and Marcel Roeloffzen and Paul Seiferth and Yannik Stein and Birgit Vogtenhuber and Max Willert}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Routing in Polygonal Domains}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {10:1--10:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.10}, doi = {10.4230/LIPICS.ISAAC.2017.10}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BanyassadyCKMRR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BanyassadyKMRRS17, author = {Bahareh Banyassady and Matias Korman and Wolfgang Mulzer and Andr{\'{e}} van Renssen and Marcel Roeloffzen and Paul Seiferth and Yannik Stein}, editor = {Heribert Vollmer and Brigitte Vall{\'{e}}e}, title = {Improved Time-Space Trade-Offs for Computing Voronoi Diagrams}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS} 2017, March 8-11, 2017, Hannover, Germany}, series = {LIPIcs}, volume = {66}, pages = {9:1--9:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.STACS.2017.9}, doi = {10.4230/LIPICS.STACS.2017.9}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/BanyassadyKMRRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BanyassadyHKLM17, author = {Bahareh Banyassady and Michael Hoffmann and Boris Klemz and Maarten L{\"{o}}ffler and Tillmann Miltzow}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Obedient Plane Drawings for Disk Intersection Graphs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {73--84}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_7}, doi = {10.1007/978-3-319-62127-2\_7}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/wads/BanyassadyHKLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/walcom/BahooBBDM17, author = {Yeganeh Bahoo and Bahareh Banyassady and Prosenjit Bose and Stephane Durocher and Wolfgang Mulzer}, editor = {Sheung{-}Hung Poon and Md. Saidur Rahman and Hsu{-}Chun Yen}, title = {Time-Space Trade-Off for Finding the \emph{k}-Visibility Region of a Point in a Polygon}, booktitle = {{WALCOM:} Algorithms and Computation, 11th International Conference and Workshops, {WALCOM} 2017, Hsinchu, Taiwan, March 29-31, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10167}, pages = {308--319}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-53925-6\_24}, doi = {10.1007/978-3-319-53925-6\_24}, timestamp = {Tue, 21 Mar 2023 20:55:51 +0100}, biburl = {https://dblp.org/rec/conf/walcom/BahooBBDM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1708-00814, author = {Bahareh Banyassady and Matias Korman and Wolfgang Mulzer and Andr{\'{e}} van Renssen and Marcel Roeloffzen and Paul Seiferth and Yannik Stein}, title = {Improved Time-Space Trade-offs for Computing Voronoi Diagrams}, journal = {CoRR}, volume = {abs/1708.00814}, year = {2017}, url = {http://arxiv.org/abs/1708.00814}, eprinttype = {arXiv}, eprint = {1708.00814}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1708-00814.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1712-06431, author = {Bahareh Banyassady and Luis Barba and Wolfgang Mulzer}, title = {Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees}, journal = {CoRR}, volume = {abs/1712.06431}, year = {2017}, url = {http://arxiv.org/abs/1712.06431}, eprinttype = {arXiv}, eprint = {1712.06431}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1712-06431.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BahooBBDM16, author = {Yeganeh Bahoo and Bahareh Banyassady and Prosenjit Bose and Stephane Durocher and Wolfgang Mulzer}, title = {Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon}, journal = {CoRR}, volume = {abs/1603.02853}, year = {2016}, url = {http://arxiv.org/abs/1603.02853}, eprinttype = {arXiv}, eprint = {1603.02853}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BahooBBDM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ras/DavoodiABKM13, author = {Mansoor Davoodi and Marjan Abedin and Bahareh Banyassady and Payam Khanteimouri and Ali Mohades}, title = {An optimal algorithm for two robots path planning problem on the grid}, journal = {Robotics Auton. Syst.}, volume = {61}, number = {12}, pages = {1406--1414}, year = {2013}, url = {https://doi.org/10.1016/j.robot.2013.07.012}, doi = {10.1016/J.ROBOT.2013.07.012}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ras/DavoodiABKM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.