Hamid Zarrabi-Zadeh

Orcid: 0000-0002-2279-4775

Affiliations:
  • Sharif University of Technology, Tehran, Iran


According to our database1, Hamid Zarrabi-Zadeh authored at least 38 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Massively parallel and streaming algorithms for balanced clustering.
Theor. Comput. Sci., February, 2024

2023
Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

2022
Simple Streaming Algorithms for Edge Coloring.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

On the Biplanar and k-Planar Crossing Numbers.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Minimum Enclosing Spherical/Cylindrical Shells in High-Dimensional Streams.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2020
Improved Algorithms for Distributed Balanced Clustering.
Proceedings of the Topics in Theoretical Computer Science, 2020

Blind Voronoi Game.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
New Bounds on k-Planar Crossing Numbers.
CoRR, 2019

Distributed Unit Clustering.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

A Simple Randomized Algorithm for All Nearest Neighbors.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2017
On the rectangle escape problem.
Theor. Comput. Sci., 2017

Finding Maximum Disjoint Set of Boundary Rectangles With Application to PCB Routing.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2017

Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Optimal Orientation of Symmetric Directional Antennas on a Line.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
The Maximum Disjoint Routing Problem.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
A Streaming Algorithm for 2-Center with Outliers in High Dimensions.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Diversity Maximization via Composable Coresets.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
The Maximum Disjoint Set of Boundary Rectangles.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
On the Rectangle Escape Problem.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
α-Visibility.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

The Minimum Vulnerability Problem.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011
Fréchet distance with speed limits.
Comput. Geom., 2011

Improved Algorithms for Partial Curve Matching.
Proceedings of the Algorithms - ESA 2011, 2011

Finding Paths with Minimum Shared Edges.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Staying Close to a Curve.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Finding Maximum Edge Bicliques in Convex Bipartite Graphs.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Speed-constrained geodesic fréchet distance inside a simple polygon.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Streaming 1-Center with Outliers in High Dimensions.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Geometric Approximation Algorithms in the Online and Data Stream Models.
PhD thesis, 2008

Flying over a polyhedral terrain.
Inf. Process. Lett., 2008

An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions.
Proceedings of the Algorithms, 2008

Core-Preserving Algorithms.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
An Improved Algorithm for Online Unit Clustering.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

On the Complexity of Finding an Unknown Cut Via Vertex Queries.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
A Randomized Algorithm for Online Unit Clustering.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Path Planning above a Polyhedral Terrain.
Proceedings of the 2006 IEEE International Conference on Robotics and Automation, 2006

A Simple Streaming Algorithm for Minimum Enclosing Balls.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Small Weak Epsilon-Nets in Three Dimensions.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006


  Loading...