Small Weak Epsilon-Nets in Three Dimensions. - Maryam Babazadeh; Hamid Zarrabi-Zadeh (CCCG, 2006)

A Simple Streaming Algorithm for Minimum Enclosing Balls. - Hamid Zarrabi-Zadeh; Timothy M. Chan (CCCG, 2006)

Path Planning above a Polyhedral Terrain. - Hamid Zarrabi-Zadeh (ICRA, 2006)

On the Complexity of Finding an Unknown Cut Via Vertex Queries. - Peyman Afshani; Ehsan Chiniforooshan; Reza Dorrigiv; Arash Farzan; Mehdi Mirzazadeh; Narges Simjour; Hamid Zarrabi-Zadeh (COCOON, 2007)

Core-Preserving Algorithms. - Hamid Zarrabi-Zadeh (CCCG, 2008)

Flying over a polyhedral terrain. - Hamid Zarrabi-Zadeh (Inf. Process. Lett., 2008)

Geometric Approximation Algorithms in the Online and Data Stream Models. - Hamid Zarrabi-Zadeh (2008)

Streaming 1-Center with Outliers in High Dimensions. - Hamid Zarrabi-Zadeh; Asish Mukhopadhyay (CCCG, 2009)

An Improved Algorithm for Online Unit Clustering. - Hamid Zarrabi-Zadeh; Timothy M. Chan (Algorithmica, 2009)

A Randomized Algorithm for Online Unit Clustering. - Timothy M. Chan; Hamid Zarrabi-Zadeh (Theory Comput. Syst., 2009)

Speed-constrained geodesic fréchet distance inside a simple polygon. - Anil Maheshwari; Jörg-Rüdiger Sack; Kaveh Shahbaz; Hamid Zarrabi-Zadeh (CCCG, 2010)

Staying Close to a Curve. - Anil Maheshwari; Jörg-Rüdiger Sack; Kaveh Shahbaz; Hamid Zarrabi-Zadeh (CCCG, 2011)

An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions. - Hamid Zarrabi-Zadeh (Algorithmica, 2011)

Fréchet distance with speed limits. - Anil Maheshwari; Jörg-Rüdiger Sack; Kaveh Shahbaz; Hamid Zarrabi-Zadeh (Comput. Geom., 2011)

Finding Maximum Edge Bicliques in Convex Bipartite Graphs. - Doron Nussbaum; Shuye Pu; Jörg-Rüdiger Sack; Takeaki Uno; Hamid Zarrabi-Zadeh (Algorithmica, 2012)

On the Rectangle Escape Problem. - Sepehr Assadi; Ehsan Emamjomeh-Zadeh; Sadra Yazdanbod; Hamid Zarrabi-Zadeh (CCCG, 2013)

Finding paths with minimum shared edges. - Masoud T. Omran; Jörg-Rüdiger Sack; Hamid Zarrabi-Zadeh (J. Comb. Optim., 2013)

The Maximum Disjoint Set of Boundary Rectangles. - AmirMahdi Ahmadinejad; Hamid Zarrabi-Zadeh (CCCG, 2014)

The Minimum Vulnerability Problem. - Sepehr Assadi; Ehsan Emamjomeh-Zadeh; Ashkan Norouzi-Fard; Sadra Yazdanbod; Hamid Zarrabi-Zadeh (Algorithmica, 2014)

Improved Algorithms for Partial Curve Matching. - Anil Maheshwari; Jörg-Rüdiger Sack; Kaveh Shahbaz; Hamid Zarrabi-Zadeh (Algorithmica, 2014)

α-Visibility. - Mohammad Ghodsi; Anil Maheshwari; Mostafa Nouri Baygi; Jörg-Rüdiger Sack; Hamid Zarrabi-Zadeh (Comput. Geom., 2014)

Diversity Maximization via Composable Coresets. - Sepideh Aghamolaei; Majid Farhadi; Hamid Zarrabi-Zadeh (CCCG, 2015)

The Maximum Disjoint Routing Problem. - Farhad Shahmohammadi; Amir Sharif-Zadeh; Hamid Zarrabi-Zadeh (COCOON, 2016)

Optimal Orientation of Symmetric Directional Antennas on a Line. - AmirMahdi Ahmadinejad; Fatemeh Baharifard; Khadijeh Sheikhan; Hamid Zarrabi-Zadeh (CCCG, 2017)

A streaming algorithm for 2-center with outliers in high dimensions. - Behnam Hatami; Hamid Zarrabi-Zadeh (Comput. Geom., 2017)

Finding Maximum Disjoint Set of Boundary Rectangles With Application to PCB Routing. - AmirMahdi Ahmadinejad; Hamid Zarrabi-Zadeh (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2017)

Fault-tolerant spanners in networks with symmetric directional antennas. - Mohammad Ali Abam; Fatemeh Baharifard; Mohammad Sadegh Borouny; Hamid Zarrabi-Zadeh (Theor. Comput. Sci., 2017)

On the rectangle escape problem. - AmirMahdi Ahmadinejad; Sepehr Assadi; Ehsan Emamjomeh-Zadeh; Sadra Yazdanbod; Hamid Zarrabi-Zadeh (Theor. Comput. Sci., 2017)

A Simple Randomized Algorithm for All Nearest Neighbors. - Soroush Ebadian; Hamid Zarrabi-Zadeh (CCCG, 2019)

Distributed Unit Clustering. - Kian Mirjalali; Seyed Ali Tabatabaee; Hamid Zarrabi-Zadeh (CCCG, 2019)

New Bounds on k-Planar Crossing Numbers. - Alireza Shavali; Hamid Zarrabi-Zadeh (CoRR, 2019)

Blind Voronoi Game. - Omid Gheibi; Hamid Zarrabi-Zadeh (CCCG, 2020)

Improved Algorithms for Distributed Balanced Clustering. - Kian Mirjalali; Hamid Zarrabi-Zadeh (TTCS, 2020)

Minimum Enclosing Spherical/Cylindrical Shells in High-Dimensional Streams. - Mohammad Javad Eslamibidgoli; Hamid Zarrabi-Zadeh (CCCG, 2022)

Simple Streaming Algorithms for Edge Coloring. - Mohammad Ansari; Mohammad Saneian; Hamid Zarrabi-Zadeh (ESA, 2022)

Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization. - Alireza Haqi; Hamid Zarrabi-Zadeh (SPAA, 2023)

Massively parallel and streaming algorithms for balanced clustering. - Kian Mirjalali; Hamid Zarrabi-Zadeh (Theor. Comput. Sci., 2024)

On the biplanar and k-planar crossing numbers. - Alireza Shavali; Hamid Zarrabi-Zadeh (Discret. Appl. Math., 2025)