Hamid Zarrabi-Zadeh

Conference Papers

• Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization
  Alireza Haqi and Hamid Zarrabi-Zadeh

  In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2023), pages 239-247, Orlando, Florida, United States, June 2023. (Outstanding Paper Award).[doi]
• Simple Streaming Algorithms for Edge Coloring
  Mohammad Ansari, Mohammad Saneian, and Hamid Zarrabi-Zadeh

  In Proceedings of the 30th Annual European Symposium on Algorithms (ESA 2022), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 8:1-8:4, Potsdam, Germany, September 2022. [doi]
• Minimum Enclosing Spherical/Cylindrical Shells in High-Dimensional Streams
  Mohammad Javad Eslami-Bidgoli and Hamid Zarrabi-Zadeh

  In Proceedings of the 34th Canadian Conference on Computational Geometry (CCCG 2022), pages 151–155, Toronto, Ontario, Canada, August 2022.
• On the Biplanar and k-Planar Crossing Numbers
  Alireza Shavali and Hamid Zarrabi-Zadeh

  In Proceedings of the 34th Canadian Conference on Computational Geometry (CCCG 2022), pages 293–297, Toronto, Ontario, Canada, August 2022.
• Blind Voronoi Game
  Omid Gheibi and Hamid Zarrabi-Zadeh

  In Proceedings of the 32nd Canadian Conference on Computational Geometry (CCCG 2020), pages 322–326, Saskatoon, Saskatchewan, Canada, August 2020.
• Improved Algorithms for Distributed Balanced Clustering
  Kian Mirjalali and Hamid Zarrabi-Zadeh

  In Proceedings of the 3rd International Conference on Topics in Theoretical Computer Science (TTCS 2020), volume 12281 of Lecture Notes in Computer Science, pages 72–84, Tehran, Iran, July 2020. [doi]
• A Simple Randomized Algorithm for All Nearest Neighbors
  Soroush Ebadian and Hamid Zarrabi-Zadeh

  In Proceedings of the 31st Canadian Conference on Computational Geometry (CCCG 2019), pages 94–98, Edmonton, Alberta, Canada, August 2019.
• Distributed Unit Clustering
  Kian Mirjalali, Seyed Ali Tabatabaee, and Hamid Zarrabi-Zadeh

  In Proceedings of the 31st Canadian Conference on Computational Geometry (CCCG 2019), pages 236–241, Edmonton, Alberta, Canada, August 2019.
• On the Maximum Triangle Problem
  Afrouz Jabalameli and Hamid Zarrabi-Zadeh

  In Proceedings of the 2nd Iranian Conference on Computational Geometry (ICCG 2019), pages 21–23, Tehran, Iran, February 2019.
• Routing in Well-Separated Pair Decomposition Spanners
  Fatemeh Baharifard, Majid Farhadi, and Hamid Zarrabi-Zadeh

  In Proceedings of the 1st Iranian Conference on Computational Geometry (ICCG 2018), pages 25–28, Tehran, Iran, February 2018.
• Optimal Orientation of Symmetric Directional Antennas on a Line
  AmirMahdi Ahmadinejad, Fatemeh Baharifard, Khadijeh Sheikhan, and Hamid Zarrabi-Zadeh

  In Proceedings of the 29th Canadian Conference on Computational Geometry (CCCG 2017), pages 120–125, Ottawa, Ontario, Canada, July 2017.
• Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas
  Mohammad-Ali Abam, Fatemeh Baharifard, Mohammad S. Borouny, and Hamid Zarrabi-Zadeh

  In Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), volume 10167 of Lecture Notes in Computer Science, pages 266–278, Hsinchu, Taiwan, March 2017. [doi]
• The Maximum Disjoint Routing Problem
  Farhad Shahmohammadi, Amir Sharif-Zadeh, and Hamid Zarrabi-Zadeh

  In Proceedings of the 22nd Annual International Computing and Combinatorics Conference (COCOON 2016), volume 9797 of Lecture Notes in Computer Science, pages 319–329, Ho Chi Minh, Vietnam, August 2016. [doi]
• A Streaming Algorithm for 2-Center with Outliers in High Dimensions
  Behnam Hatami and Hamid Zarrabi-Zadeh

  In Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG 2015), pages 165–170, Kingston, Ontario, Canada, August 2015.
• Diversity Maximization via Composable Coresets
  Sepideh Aghamolaei, Majid Farhadi, and Hamid Zarrabi-Zadeh

  In Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG 2015), pages 43–48, Kingston, Ontario, Canada, August 2015.
• The Maximum Disjoint Set of Boundary Rectangles
  AmirMahdi Ahmadinejad and Hamid Zarrabi-Zadeh

  In Proceedings of the 26th Canadian Conference on Computational Geometry (CCCG 2014), pages 302–307, Halifax, Nova Scotia, Canada, August 2014.
• On the Rectangle Escape Problem
  Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, and Hamid Zarrabi-Zadeh

  In Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), pages 235–240, Waterloo, Ontario, Canada, August 2013.
• The Minimum Vulnerability Problem
  Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, and Hamid Zarrabi-Zadeh

  In Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC 2012), volume 7676 of Lecture Notes in Computer Science, pages 382–391, Taipei, Taiwan, December 2012. [doi]
• α-Visibility
  Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri-Baygi, Jörg-Rüdiger Sack, and Hamid Zarrabi-Zadeh

  In Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012), volume 7357 of Lecture Notes in Computer Science, pages 1-12, Helsinki, Finland, July 2012. [doi]
• Improved Algorithms for Partial Curve Matching
  Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, and Hamid Zarrabi-Zadeh

  In Proceedings of the 19th Annual European Symposium on Algorithms (ESA 2011), volume 6942 of Lecture Notes in Computer Science, pages 518–529, Saarbrücken, Germany, September 2011. [doi]
• Staying Close to a Curve
  Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, and Hamid Zarrabi-Zadeh

  In Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), pages 55–58, Toronto, Ontario, Canada, August 2011.
• Finding Paths with Minimum Shared Edges
  Masoud T. Omran, Jörg-Rüdiger Sack, and Hamid Zarrabi-Zadeh

  In Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON 2011), volume 6842 of Lecture Notes in Computer Science, pages 567–578, Dallas, Texas, United States, August 2011. [doi]
• Speed-Constrained Geodesic Fréchet Distance Inside a Simple Polygon
  Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, and Hamid Zarrabi-Zadeh

  In Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), pages 179–182, Winnipeg, Manitoba, Canada, August 2010.
• Finding Maximum Edge Bicliques in Convex Bipartite Graphs
  Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, and Hamid Zarrabi-Zadeh

  In Proceedings of the 16th Annual International Computing and Combinatorics Conference (COCOON 2010), volume 6196 of Lecture Notes in Computer Science, pages 140-149, Nha Trang, Vietnam, July 2010. [doi]
• Streaming 1-Center with Outliers in High Dimensions
  Hamid Zarrabi-Zadeh and Asish Mukhopadhyay

  In Proceedings of the 21st Canadian Conference on Computational Geometry (CCCG 2009), pages 83-86, Vancouver, Canada, August 2009.
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
  Hamid Zarrabi-Zadeh

  In Proceedings of the 16th Annual European Symposium on Algorithms (ESA 2008), volume 5193 of Lecture Notes in Computer Science, pages 817–829, Karlsruhe, Germany, September 2008. [doi]
• Core-Preserving Algorithms
  Hamid Zarrabi-Zadeh

  In Proceedings of the 20th Canadian Conference on Computational Geometry (CCCG 2008), pages 159–162, Montréal, Québec, Canada, August 2008.
• An Improved Algorithm for Online Unit Clustering
  Hamid Zarrabi-Zadeh and Timothy M. Chan

  In Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON 2007), volume 4598 of Lecture Notes in Computer Science, pages 383–393, Banff, Alberta, Canada, July 2007. [doi]
• On the Complexity of Finding an Unknown Cut Via Vertex Queries
  Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, and Hamid Zarrabi-Zadeh

  In Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON 2007), volume 4598 of Lecture Notes in Computer Science, pages 459–469, Banff, Alberta, Canada, July 2007. [doi]
• Online Coloring Co-interval Graphs
  Hamid Zarrabi-Zadeh

  In Proceedings of the 12th International CSI Computer Conference (CSICC 2007), pages 1328–1332, Tehran, Iran, February 2007.
• A Randomized Algorithm for Online Unit Clustering
  Timothy M. Chan and Hamid Zarrabi-Zadeh

  In Proceedings of the 4th Workshop on Approximation and Online Algorithms (WAOA 2006), volume 4368 of Lecture Notes in Computer Science, pages 121–131, Zurich, Switzerland, September 2006. [doi]
• A Simple Streaming Algorithm for Minimum Enclosing Balls
  Hamid Zarrabi-Zadeh and Timothy M. Chan

  In Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG 2006), pages 139–142, Kingston, Ontario, Canada, August 2006.
• Small Weak Epsilon-Nets in Three Dimensions
  Maryam Babazadeh and Hamid Zarrabi-Zadeh

  In Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG 2006), pages 47–50, Kingston, Ontario, Canada, August 2006.
• Path Planning above a Polyhedral Terrain
  Hamid Zarrabi-Zadeh

  In Proceedings of the 2006 IEEE International Conference on Robotics and Automation (ICRA 2006), pages 873–876, Orlando, Florida, United States, May 2006. [doi]

Journal Papers

• Massively Parallel and Streaming Algorithms for Balanced Clustering
  Kian Mirjalali and Hamid Zarrabi-Zadeh

  Theoretical Computer Science, 983:114296, 2024.
• On the Maximum Triangle Problem
  Afrouz Jabal Ameli and Hamid Zarrabi-Zadeh

  Scientia Iranica, 2024, to appear.
• A Streaming Algorithm for 2-Center with Outliers in High Dimensions
  Behnam Hatami and Hamid Zarrabi-Zadeh

  Computational Geometry: Theory and Applications, 60(1):26–36, 2017.
• Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas
  Mohammad-Ali Abam, Fatemeh Baharifard, Mohammad S. Borouny, and Hamid Zarrabi-Zadeh

  Theoretical Computer Science, 704:18–27, 2017.
• Finding Maximum Disjoint Set of Boundary Rectangles with Application to PCB Routing
  AmirMahdi Ahmadinejad and Hamid Zarrabi-Zadeh

  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 36(3):412–420, 2017.
• On the Rectangle Escape Problem
  AmirMahdi Ahmadinejad, Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, and Hamid Zarrabi-Zadeh

  Theoretical Computer Science, 689:126–136, 2017.
• The Minimum Vulnerability Problem
  Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, and Hamid Zarrabi-Zadeh

  Algorithmica, 70(4):718–731, 2014.
• α-Visibility
  Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri-Baygi, Jörg-Rüdiger Sack, and Hamid Zarrabi-Zadeh

  Computational Geometry: Theory and Applications, 47(3):435–446, 2014.
• Improved Algorithms for Partial Curve Matching
  Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, and Hamid Zarrabi-Zadeh

  Algorithmica, 69(3):641–657, 2014.
• Finding Paths with Minimum Shared Edges
  Masoud T. Omran, Jörg-Rüdiger Sack, and Hamid Zarrabi-Zadeh

  Journal of Combinatorial Optimization, 26(4):709–722, 2013.
• Finding Maximum Edge Bicliques in Convex Bipartite Graphs
  Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, and Hamid Zarrabi-Zadeh

  Algorithmica, 64(2):311–325, 2012.
• Fréchet Distance with Speed Limits
  Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, and Hamid Zarrabi-Zadeh

  Computational Geometry: Theory and Applications, 44(2):110–120, 2011.
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
  Hamid Zarrabi-Zadeh

  Algorithmica, 60(1):46–59, 2011.
• An Improved Algorithm for Online Unit Clustering
  Hamid Zarrabi-Zadeh and Timothy M. Chan

  Algorithmica, 54(4):490–500, 2009.
• Online Coloring Co-interval Graphs
  Hamid Zarrabi-Zadeh

  Scientia Iranica, 16(1):1–7, 2009.
• A Randomized Algorithm for Online Unit Clustering
  Timothy M. Chan and Hamid Zarrabi-Zadeh

  Theory of Computing Systems, 45(3):486–496, 2009.
• Flying over a Polyhedral Terrain
  Hamid Zarrabi-Zadeh

  Information Processing Letters, 105(3):103–107, 2008.