Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Zarrabi-Zadeh, Hamid
44  Ergebnisse:
Personensuche X
?
1

Massively parallel and streaming algorithms for balanced cl..:

Mirjalali, Kian ; Zarrabi-Zadeh, Hamid
Theoretical Computer Science.  983 (2024)  - p. 114296 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Almost Optimal Massively Parallel Algorithms for k-Center C..:

, In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures,
Haqi, Alireza ; Zarrabi-Zadeh, Hamid - p. 239-247 , 2023
Link: https://dl.acm.org/doi/1..
 
?
3

Improved Algorithms for Distributed Balanced Clustering:

, In: Topics in Theoretical Computer Science; Lecture Notes in Computer Science,
Mirjalali, Kian ; Zarrabi-Zadeh, Hamid - p. 72-84 , 2020
Link: https://doi.org/10.1007/..
 
?
4

On the rectangle escape problem:

Ahmadinejad, AmirMahdi ; Assadi, Sepehr ; Emamjomeh-Zadeh, Ehsan..
Theoretical Computer Science.  689 (2017)  - p. 126-136 , 2017
Link: https://doi.org/10.1016/..
 
?
5

A streaming algorithm for 2-center with outliers in high di..:

Hatami, Behnam ; Zarrabi-Zadeh, Hamid
Computational Geometry.  60 (2017)  - p. 26-36 , 2017
Link: https://doi.org/10.1016/..
 
?
6

The Minimum Vulnerability Problem:

Assadi, Sepehr ; Emamjomeh-Zadeh, Ehsan ; Norouzi-Fard, Ashkan..
Algorithmica.  70 (2014)  4 - p. 718-731 , 2014
Link: https://doi.org/10.1007/..
 
?
7

α -Visibility:

Ghodsi, Mohammad ; Maheshwari, Anil ; Nouri-Baygi, Mostafa..
Computational Geometry.  47 (2014)  3 - p. 435-446 , 2014
Link: https://doi.org/10.1016/..
 
?
8

Improved Algorithms for Partial Curve Matching:

Maheshwari, Anil ; Sack, Jörg-Rüdiger ; Shahbaz, Kaveh.
Algorithmica.  69 (2013)  3 - p. 641-657 , 2013
Link: https://doi.org/10.1007/..
 
?
9

Finding paths with minimum shared edges:

Omran, Masoud T. ; Sack, Jörg-Rüdiger ; Zarrabi-Zadeh, Hamid
Journal of Combinatorial Optimization.  26 (2012)  4 - p. 709-722 , 2012
Link: https://doi.org/10.1007/..
 
?
10

Fréchet distance with speed limits:

Maheshwari, Anil ; Sack, Jörg-Rüdiger ; Shahbaz, Kaveh.
Computational Geometry.  44 (2011)  2 - p. 110-120 , 2011
Link: https://doi.org/10.1016/..
 
?
11

Finding Maximum Edge Bicliques in Convex Bipartite Graphs:

Nussbaum, Doron ; Pu, Shuye ; Sack, Jörg-Rüdiger..
Algorithmica.  64 (2011)  2 - p. 311-325 , 2011
Link: https://doi.org/10.1007/..
 
?
12

An Almost Space-Optimal Streaming Algorithm for Coresets in..:

Zarrabi-Zadeh, Hamid
Algorithmica.  60 (2010)  1 - p. 46-59 , 2010
Link: https://doi.org/10.1007/..
 
?
13

Flying over a polyhedral terrain:

Zarrabi-Zadeh, Hamid
Information Processing Letters.  105 (2008)  3 - p. 103-107 , 2008
Link: https://doi.org/10.1016/..
 
?
14

An Improved Algorithm for Online Unit Clustering:

Zarrabi-Zadeh, Hamid ; Chan, Timothy M.
Algorithmica.  54 (2008)  4 - p. 490-500 , 2008
Link: https://doi.org/10.1007/..
 
?
15

A Randomized Algorithm for Online Unit Clustering:

Chan, Timothy M. ; Zarrabi-Zadeh, Hamid
Theory of Computing Systems.  45 (2007)  3 - p. 486-496 , 2007
Link: https://doi.org/10.1007/..
 
1-15