default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHamid Zarrabi-Zadeh
Person information
- affiliation: Sharif University of Technology, Tehran, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Kian Mirjalali, Hamid Zarrabi-Zadeh
:
Massively parallel and streaming algorithms for balanced clustering. Theor. Comput. Sci. 983: 114296 (2024)- 2023
- [c31]Alireza Haqi, Hamid Zarrabi-Zadeh:
Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization. SPAA 2023: 239-247 - 2022
- [c30]Mohammad Javad Eslamibidgoli, Hamid Zarrabi-Zadeh:
Minimum Enclosing Spherical/Cylindrical Shells in High-Dimensional Streams. CCCG 2022: 151-155 - [c29]Alireza Shavali, Hamid Zarrabi-Zadeh:
On the Biplanar and k-Planar Crossing Numbers. CCCG 2022: 293-297 - [c28]Mohammad Ansari, Mohammad Saneian, Hamid Zarrabi-Zadeh:
Simple Streaming Algorithms for Edge Coloring. ESA 2022: 8:1-8:4 - 2020
- [c27]Omid Gheibi, Hamid Zarrabi-Zadeh:
Blind Voronoi Game. CCCG 2020: 312-316 - [c26]Kian Mirjalali, Hamid Zarrabi-Zadeh:
Improved Algorithms for Distributed Balanced Clustering. TTCS 2020: 72-84
2010 – 2019
- 2019
- [c25]Soroush Ebadian, Hamid Zarrabi-Zadeh:
A Simple Randomized Algorithm for All Nearest Neighbors. CCCG 2019: 94-98 - [c24]Kian Mirjalali, Seyed Ali Tabatabaee, Hamid Zarrabi-Zadeh:
Distributed Unit Clustering. CCCG 2019: 236-241 - [i1]Alireza Shavali, Hamid Zarrabi-Zadeh:
New Bounds on k-Planar Crossing Numbers. CoRR abs/1911.06403 (2019) - 2017
- [j14]Behnam Hatami, Hamid Zarrabi-Zadeh:
A streaming algorithm for 2-center with outliers in high dimensions. Comput. Geom. 60: 26-36 (2017) - [j13]AmirMahdi Ahmadinejad, Hamid Zarrabi-Zadeh:
Finding Maximum Disjoint Set of Boundary Rectangles With Application to PCB Routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 36(3): 412-420 (2017) - [j12]AmirMahdi Ahmadinejad, Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
On the rectangle escape problem. Theor. Comput. Sci. 689: 126-136 (2017) - [j11]Mohammad Ali Abam, Fatemeh Baharifard, Mohammad Sadegh Borouny, Hamid Zarrabi-Zadeh:
Fault-tolerant spanners in networks with symmetric directional antennas. Theor. Comput. Sci. 704: 18-27 (2017) - [c23]AmirMahdi Ahmadinejad, Fatemeh Baharifard, Khadijeh Sheikhan, Hamid Zarrabi-Zadeh:
Optimal Orientation of Symmetric Directional Antennas on a Line. CCCG 2017: 120-125 - [c22]Mohammad Ali Abam, Fatemeh Baharifard, Mohammad Sadegh Borouny, Hamid Zarrabi-Zadeh:
Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas. WALCOM 2017: 266-278 - 2016
- [c21]Farhad Shahmohammadi, Amir Sharif-Zadeh, Hamid Zarrabi-Zadeh:
The Maximum Disjoint Routing Problem. COCOON 2016: 319-329 - 2015
- [c20]Sepideh Aghamolaei, Majid Farhadi, Hamid Zarrabi-Zadeh:
Diversity Maximization via Composable Coresets. CCCG 2015 - [c19]Behnam Hatami, Hamid Zarrabi-Zadeh:
A Streaming Algorithm for 2-Center with Outliers in High Dimensions. CCCG 2015 - 2014
- [j10]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Improved Algorithms for Partial Curve Matching. Algorithmica 69(3): 641-657 (2014) - [j9]Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
The Minimum Vulnerability Problem. Algorithmica 70(4): 718-731 (2014) - [j8]Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri Baygi, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. Comput. Geom. 47(3): 435-446 (2014) - [c18]AmirMahdi Ahmadinejad, Hamid Zarrabi-Zadeh:
The Maximum Disjoint Set of Boundary Rectangles. CCCG 2014 - 2013
- [j7]Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
Finding paths with minimum shared edges. J. Comb. Optim. 26(4): 709-722 (2013) - [c17]Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
On the Rectangle Escape Problem. CCCG 2013 - 2012
- [j6]Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Algorithmica 64(2): 311-325 (2012) - [c16]Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
The Minimum Vulnerability Problem. ISAAC 2012: 382-391 - [c15]Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. SWAT 2012: 1-12 - 2011
- [j5]Hamid Zarrabi-Zadeh:
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions. Algorithmica 60(1): 46-59 (2011) - [j4]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Fréchet distance with speed limits. Comput. Geom. 44(2): 110-120 (2011) - [c14]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Staying Close to a Curve. CCCG 2011 - [c13]Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
Finding Paths with Minimum Shared Edges. COCOON 2011: 567-578 - [c12]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Improved Algorithms for Partial Curve Matching. ESA 2011: 518-529 - 2010
- [c11]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Speed-constrained geodesic fréchet distance inside a simple polygon. CCCG 2010: 179-182 - [c10]Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. COCOON 2010: 140-149
2000 – 2009
- 2009
- [j3]Hamid Zarrabi-Zadeh, Timothy M. Chan:
An Improved Algorithm for Online Unit Clustering. Algorithmica 54(4): 490-500 (2009) - [j2]Timothy M. Chan, Hamid Zarrabi-Zadeh:
A Randomized Algorithm for Online Unit Clustering. Theory Comput. Syst. 45(3): 486-496 (2009) - [c9]Hamid Zarrabi-Zadeh, Asish Mukhopadhyay:
Streaming 1-Center with Outliers in High Dimensions. CCCG 2009: 83-86 - 2008
- [b1]Hamid Zarrabi-Zadeh:
Geometric Approximation Algorithms in the Online and Data Stream Models. University of Waterloo, Ontario, Canada, 2008 - [j1]Hamid Zarrabi-Zadeh:
Flying over a polyhedral terrain. Inf. Process. Lett. 105(3): 103-107 (2008) - [c8]Hamid Zarrabi-Zadeh:
Core-Preserving Algorithms. CCCG 2008 - [c7]Hamid Zarrabi-Zadeh:
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions. ESA 2008: 817-829 - 2007
- [c6]Hamid Zarrabi-Zadeh, Timothy M. Chan:
An Improved Algorithm for Online Unit Clustering. COCOON 2007: 383-393 - [c5]Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh:
On the Complexity of Finding an Unknown Cut Via Vertex Queries. COCOON 2007: 459-469 - 2006
- [c4]Maryam Babazadeh, Hamid Zarrabi-Zadeh:
Small Weak Epsilon-Nets in Three Dimensions. CCCG 2006 - [c3]Hamid Zarrabi-Zadeh, Timothy M. Chan:
A Simple Streaming Algorithm for Minimum Enclosing Balls. CCCG 2006 - [c2]Hamid Zarrabi-Zadeh:
Path Planning above a Polyhedral Terrain. ICRA 2006: 873-876 - [c1]Timothy M. Chan, Hamid Zarrabi-Zadeh:
A Randomized Algorithm for Online Unit Clustering. WAOA 2006: 121-131
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
