var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FEepbBd29toFPBFcfq&jsonp=1&noBootstrap=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FEepbBd29toFPBFcfq&jsonp=1&noBootstrap=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FEepbBd29toFPBFcfq&jsonp=1&noBootstrap=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Dust Source Emission Forecasting using Remote Sensing Time Series Data and Machine Learning.\n \n \n \n\n\n \n Sanisales, M.; Rahmati, Z.; and Darvishi, A.\n\n\n \n\n\n\n Submitting. 2024.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{Sanisales2024DR,\n  title={Dust Source Emission Forecasting using Remote Sensing Time Series Data and Machine Learning},\n  author={Sanisales, Maryam and Rahmati, Zahed and Darvishi, Ali},\n  journal={Submitting},\n  year={2024}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Relational Graph Convolutional Networks for Sentiment Analysis.\n \n \n \n\n\n \n Khosravi, A.; Rahmati, Z.; and Vefghi, A.\n\n\n \n\n\n\n arXiv preprint arXiv:2404.13079. 2024.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{khosravi2024relational,\n  title={Relational Graph Convolutional Networks for Sentiment Analysis},\n  author={Khosravi, Asal and Rahmati, Zahed and Vefghi, Ali},\n  journal={arXiv preprint arXiv:2404.13079},\n  year={2024}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs.\n \n \n \n\n\n \n Bahrami, M.; Kiani, D.; and Rahmati, Z.\n\n\n \n\n\n\n International Journal of Foundations of Computer Science. 2024.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{Bahrami2024KianiRahmati,\n  title={An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs},\n  author={Bahrami, Mahin and Kiani, Dariush and Rahmati, Zahed},\n  journal={International Journal of Foundations of Computer Science},\n  year={2024}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Emanation Graph: A Plane Geometric Spanner with Steiner Points.\n \n \n \n\n\n \n Hamedmohseni, B.; Rahmati, Z.; and Mondal, D.\n\n\n \n\n\n\n Graphs and Combinatorics, 39(2): 38. 2023.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{hamedmohseni2023emanation,\n  title={Emanation Graph: A Plane Geometric Spanner with Steiner Points},\n  author={Hamedmohseni, Bardia and Rahmati, Zahed and Mondal, Debajyoti},\n  journal={Graphs and Combinatorics},\n  volume={39},\n  number={2},\n  pages={38},\n  year={2023},\n  publisher={Springer}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n On Enhancement of Text Classification and Analysis of Text Emotions Using Graph Machine Learning and Ensemble Learning Methods on Non-English Datasets.\n \n \n \n\n\n \n Gholami, F.; Rahmati, Z.; Mofidi, A.; and Abbaszadeh, M.\n\n\n \n\n\n\n Algorithms, 16(10): 470. 2023.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{gholami2023enhancement,\n  title={On Enhancement of Text Classification and Analysis of Text Emotions Using Graph Machine Learning and Ensemble Learning Methods on Non-English Datasets},\n  author={Gholami, Fatemeh and Rahmati, Zahed and Mofidi, Alireza and Abbaszadeh, Mostafa},\n  journal={Algorithms},\n  volume={16},\n  number={10},\n  pages={470},\n  year={2023},\n  publisher={MDPI}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n APPROXIMATE k-NEAREST NEIGHBOR GRAPH ON MOVING POINTS.\n \n \n \n\n\n \n Rahmati, Z.\n\n\n \n\n\n\n Transactions on Combinatorics, 12(2). 2023.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{rahmati2023approximate,\n  title={APPROXIMATE k-NEAREST NEIGHBOR GRAPH ON MOVING POINTS.},\n  author={Rahmati, Zahed},\n  journal={Transactions on Combinatorics},\n  volume={12},\n  number={2},\n  year={2023}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Graph Layout: Converting 1-Stack Layout to 2-Queue Layout.\n \n \n \n\n\n \n Moradi, S.; and Rahmati, Z.\n\n\n \n\n\n\n . 2022.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{moradi2022graph,\n  title={Graph Layout: Converting 1-Stack Layout to 2-Queue Layout},\n  author={Moradi, Sepehr and Rahmati, Zahed},\n  year={2022},\n  publisher={JOURNAL OF NEW RESEARCHES IN MATHEMATICS}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Profiling Irony and Stereotype Spreaders with Encoding Dependency Information using Graph Convolutional Network.\n \n \n \n\n\n \n Giglou, H. B.; Rahgouy, M.; Rahmati, A.; Rahgooy, T.; and Seals, C. D\n\n\n \n\n\n\n In CLEF (Working Notes), pages 2391–2401, 2022. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{giglou2022profiling,\n  title={Profiling Irony and Stereotype Spreaders with Encoding Dependency Information using Graph Convolutional Network.},\n  author={Giglou, Hamed Babaei and Rahgouy, Mostafa and Rahmati, Ali and Rahgooy, Taher and Seals, Cheryl D},\n  booktitle={CLEF (Working Notes)},\n  pages={2391--2401},\n  year={2022}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Ensuring software maintainability at software architecture level using architectural patterns.\n \n \n \n\n\n \n Rahmati, Z.; and Tanhaei, M.\n\n\n \n\n\n\n AUT Journal of Mathematics and Computing, 2(1): 81–102. 2021.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{rahmati2021ensuring,\n  title={Ensuring software maintainability at software architecture level using architectural patterns},\n  author={Rahmati, Zahed and Tanhaei, Mohammad},\n  journal={AUT Journal of Mathematics and Computing},\n  volume={2},\n  number={1},\n  pages={81--102},\n  year={2021},\n  publisher={Amirkabir University of Technology}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Bert-dre: Bert with deep recursive encoder for natural language sentence matching.\n \n \n \n\n\n \n Tavan, E.; Rahmati, A.; Najafi, M.; Bibak, S.; and Rahmati, Z.\n\n\n \n\n\n\n arXiv preprint arXiv:2111.02188. 2021.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{tavan2021bert,\n  title={Bert-dre: Bert with deep recursive encoder for natural language sentence matching},\n  author={Tavan, Ehsan and Rahmati, Ali and Najafi, Maryam and Bibak, Saeed and Rahmati, Zahed},\n  journal={arXiv preprint arXiv:2111.02188},\n  year={2021}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Counting closed billiard paths.\n \n \n \n \n\n\n \n Rahmati, Z.; Farahzad, S.; and Rahmati, A.\n\n\n \n\n\n\n AUT Journal of Mathematics and Computing, 1(2): 171–177. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"CountingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{rahmati2020counting,\n  title={Counting closed billiard paths},\n  author={Rahmati, Zahed and Farahzad, Sina and Rahmati, Ali},\n  journal={AUT Journal of Mathematics and Computing},\n  volume={1},\n  number={2},\n  pages={171--177},\n  year={2020},\n  publisher={Amirkabir University of Technology},\n  url = {https://doi.org/10.22060/ajmc.2020.17320.1026}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Simplified emanation graphs: A sparse plane spanner with steiner points.\n \n \n \n\n\n \n Hamedmohseni, B.; Rahmati, Z.; and Mondal, D.\n\n\n \n\n\n\n In International Conference on Current Trends in Theory and Practice of Informatics, pages 607–616, 2020. Springer\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{hamedmohseni2020simplified,\n  title={Simplified emanation graphs: A sparse plane spanner with steiner points},\n  author={Hamedmohseni, Bardia and Rahmati, Zahed and Mondal, Debajyoti},\n  booktitle={International Conference on Current Trends in Theory and Practice of Informatics},\n  pages={607--616},\n  year={2020},\n  organization={Springer}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n RAC drawings in subcubic area.\n \n \n \n\n\n \n Rahmati, Z.; and Emami, F.\n\n\n \n\n\n\n Information Processing Letters, 159: 105945. 2020.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{rahmati2020rac,\n  title={RAC drawings in subcubic area},\n  author={Rahmati, Zahed and Emami, Fatemeh},\n  journal={Information Processing Letters},\n  volume={159},\n  pages={105945},\n  year={2020},\n  publisher={Elsevier}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Counting closed billiard paths.\n \n \n \n\n\n \n Farahzada, S.; Rahmatib, A.; and Rahmati, Z.\n\n\n \n\n\n\n AUT Journal of Mathematics and Computing, 1(2): 171–177. 2020.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{farahzada2020counting,\n  title={Counting closed billiard paths},\n  author={Farahzada, Sina and Rahmatib, Ali and Rahmati, Zahed},\n  journal={AUT Journal of Mathematics and Computing},\n  volume={1},\n  number={2},\n  pages={171--177},\n  year={2020}\n}
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Kinetic k-semi-Yao graph and its applications.\n \n \n \n\n\n \n Rahmati, Z.; Abam, M. A.; King, V.; and Whitesides, S.\n\n\n \n\n\n\n Computational Geometry, 77: 10–26. 2019.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{rahmati2019kinetic,\n  title={Kinetic k-semi-Yao graph and its applications},\n  author={Rahmati, Zahed and Abam, Mohammad Ali and King, Valerie and Whitesides, Sue},\n  journal={Computational Geometry},\n  volume={77},\n  pages={10--26},\n  year={2019},\n  publisher={Elsevier}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n An improved approximation algorithm for the discrete Fréchet distance.\n \n \n \n\n\n \n Chan, T. M; and Rahmati, Z.\n\n\n \n\n\n\n Information Processing Letters, 138: 72–74. 2018.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{chan2018improved,\n  title={An improved approximation algorithm for the discrete Fr{\\'e}chet distance},\n  author={Chan, Timothy M and Rahmati, Zahed},\n  journal={Information Processing Letters},\n  volume={138},\n  pages={72--74},\n  year={2018},\n  publisher={Elsevier}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Emanation Graph: A New t-Spanner.\n \n \n \n\n\n \n Hamedmohseni, B.; Rahmati, Z.; and Mondal, D.\n\n\n \n\n\n\n In CCCG, pages 311–317, 2018. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{hamedmohseni2018emanation,\n  title={Emanation Graph: A New t-Spanner.},\n  author={Hamedmohseni, Bardia and Rahmati, Zahed and Mondal, Debajyoti},\n  booktitle={CCCG},\n  pages={311--317},\n  year={2018}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A clustering-based approach to kinetic closest pair.\n \n \n \n\n\n \n Rahmati, Z.; and Chan, T. M\n\n\n \n\n\n\n Algorithmica, 80: 2742–2756. 2018.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{rahmati2018clustering,\n  title={A clustering-based approach to kinetic closest pair},\n  author={Rahmati, Zahed and Chan, Timothy M},\n  journal={Algorithmica},\n  volume={80},\n  pages={2742--2756},\n  year={2018},\n  publisher={Springer}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Width and Bounding Box of Imprecise Points.\n \n \n \n\n\n \n Keikha, V.; Löffler, M.; Mohades, A.; and Rahmati, Z.\n\n\n \n\n\n\n In CCCG, pages 142–148, 2018. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{keikha2018width,\n  title={Width and Bounding Box of Imprecise Points.},\n  author={Keikha, Vahideh and L{\\"o}ffler, Maarten and Mohades, Ali and Rahmati, Zahed},\n  booktitle={CCCG},\n  pages={142--148},\n  year={2018}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points.\n \n \n \n\n\n \n Chan, T. M; and Rahmati, Z.\n\n\n \n\n\n\n Computational Geometry, 60: 2–7. 2017.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{chan2017approximating,\n  title={Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points},\n  author={Chan, Timothy M and Rahmati, Zahed},\n  journal={Computational Geometry},\n  volume={60},\n  pages={2--7},\n  year={2017},\n  publisher={Elsevier}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n A Clustering-based approach to kinetic closest pair.\n \n \n \n\n\n \n Chan, T. M; and Rahmati, Z.\n\n\n \n\n\n\n In 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), 2016. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{chan2016clustering,\n  title={A Clustering-based approach to kinetic closest pair},\n  author={Chan, Timothy M and Rahmati, Zahed},\n  booktitle={15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},\n  year={2016},\n  organization={Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A simple, faster method for kinetic proximity problems.\n \n \n \n \n\n\n \n Rahmati, Z.; Abam, M. A.; King, V.; Whitesides, S.; and Zarei, A.\n\n\n \n\n\n\n Computational Geometry, 48(4): 342–359. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{rahmati2015simple,\n  title={A simple, faster method for kinetic proximity problems},\n  author={Rahmati, Zahed and Abam, Mohammad Ali and King, Valerie and Whitesides, Sue and Zarei, Alireza},\n  journal={Computational Geometry},\n  volume={48},\n  number={4},\n  pages={342--359},\n  year={2015},\n  publisher={Elsevier},\n  url = {https://doi.org/10.1016/j.comgeo.2014.12.002}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Online Packing of Equilateral Triangles.\n \n \n \n\n\n \n Kamali, S.; López-Ortiz, A.; and Rahmati, Z.\n\n\n \n\n\n\n In CCCG, 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{kamali2015online,\n  title={Online Packing of Equilateral Triangles.},\n  author={Kamali, Shahin and L{\\'o}pez-Ortiz, Alejandro and Rahmati, Zahed},\n  booktitle={CCCG},\n  year={2015}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n (Reverse) k-nearest neighbors for moving objects.\n \n \n \n\n\n \n Rahmati, Z.; King, V.; and Whitesides, S.\n\n\n \n\n\n\n In Proceedings of the 7th International Conference on Motion in Games, pages 187–187, 2014. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{rahmati2014reverse,\n  title={(Reverse) k-nearest neighbors for moving objects},\n  author={Rahmati, Zahed and King, Valerie and Whitesides, Sue},\n  booktitle={Proceedings of the 7th International Conference on Motion in Games},\n  pages={187--187},\n  year={2014}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Kinetic reverse k-nearest neighbor problem.\n \n \n \n\n\n \n Rahmati, Z.; King, V.; and Whitesides, S.\n\n\n \n\n\n\n In International Workshop on Combinatorial Algorithms, pages 307–317, 2014. Springer\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{rahmati2014kinetic,\n  title={Kinetic reverse k-nearest neighbor problem},\n  author={Rahmati, Zahed and King, Valerie and Whitesides, Sue},\n  booktitle={International Workshop on Combinatorial Algorithms},\n  pages={307--317},\n  year={2014},\n  organization={Springer}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Simple, faster kinetic data structures.\n \n \n \n\n\n \n Rahmati, Z.\n\n\n \n\n\n\n Ph.D. Thesis, 2014.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@phdthesis{rahmati2014simple,\n  title={Simple, faster kinetic data structures},\n  author={Rahmati, Zahed},\n  year={2014}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^ d.\n \n \n \n\n\n \n Rahmati, Z.; Abam, M. A.; King, V.; and Whitesides, S.\n\n\n \n\n\n\n arXiv preprint arXiv:1307.2700. 2013.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{rahmati2013kinetic,\n  title={Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R\\^{} d},\n  author={Rahmati, Zahed and Abam, Mohammad Ali and King, Valerie and Whitesides, Sue},\n  journal={arXiv preprint arXiv:1307.2700},\n  year={2013}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Kinetic data structures for all nearest neighbors and closest pair in the plane.\n \n \n \n\n\n \n Rahmati, Z.; King, V.; and Whitesides, S.\n\n\n \n\n\n\n In Proceedings of the twenty-ninth annual symposium on Computational geometry, pages 137–144, 2013. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{rahmati2013kinetic,\n  title={Kinetic data structures for all nearest neighbors and closest pair in the plane},\n  author={Rahmati, Zahed and King, Valerie and Whitesides, Sue},\n  booktitle={Proceedings of the twenty-ninth annual symposium on Computational geometry},\n  pages={137--144},\n  year={2013}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Kinetic and stationary point-set embeddability for plane graphs.\n \n \n \n\n\n \n Rahmati, Z.; Whitesides, S. H; and King, V.\n\n\n \n\n\n\n In Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers 20, pages 279–290, 2013. Springer\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{rahmati2013kinetic,\n  title={Kinetic and stationary point-set embeddability for plane graphs},\n  author={Rahmati, Zahed and Whitesides, Sue H and King, Valerie},\n  booktitle={Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers 20},\n  pages={279--290},\n  year={2013},\n  organization={Springer}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Kinetic pie delaunay graph and its applications.\n \n \n \n\n\n \n Abam, M. A.; Rahmati, Z.; and Zarei, A.\n\n\n \n\n\n\n In Algorithm Theory–SWAT 2012: 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings 13, pages 48–58, 2012. Springer\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{abam2012kinetic,\n  title={Kinetic pie delaunay graph and its applications},\n  author={Abam, Mohammad Ali and Rahmati, Zahed and Zarei, Alireza},\n  booktitle={Algorithm Theory--SWAT 2012: 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings 13},\n  pages={48--58},\n  year={2012},\n  organization={Springer}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Kinetic Euclidean minimum spanning tree in the plane.\n \n \n \n\n\n \n Rahmati, Z.; and Zarei, A.\n\n\n \n\n\n\n Journal of Discrete Algorithms, 16: 2–11. 2012.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{rahmati2012kinetic,\n  title={Kinetic Euclidean minimum spanning tree in the plane},\n  author={Rahmati, Zahed and Zarei, Alireza},\n  journal={Journal of Discrete Algorithms},\n  volume={16},\n  pages={2--11},\n  year={2012},\n  publisher={Elsevier}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Combinatorial changes of euclidean minimum spanning tree of moving points in the plane.\n \n \n \n\n\n \n Rahmati, Z.; and Zarei, A.\n\n\n \n\n\n\n In CCCG, pages 43–45, 2010. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{rahmati2010combinatorial,\n  title={Combinatorial changes of euclidean minimum spanning tree of moving points in the plane.},\n  author={Rahmati, Zahed and Zarei, Alireza},\n  booktitle={CCCG},\n  pages={43--45},\n  year={2010}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);