Weak epsilon-nets and interval chains
N. Alon, H. Kaplan, G. Nivasch, M. Sharir, and S. Smorodinsky
To appear in Journal of the ACM (Perliminary version in SODA'08)
Guarding a terrain by two watchtowers
P.K. Agarwal, S. Bereg, O. Daescu, H. Kaplan, S. Ntafos, M. Sharir, and B. Zhu
To appear in Algorithmica (Perliminary version in SoCG'05)
Counting colors in boxes
H. Kaplan, N. Rubin, M. Sharir, and E. Verbin
To appear in SIAM J. Comput. (Perliminary version in SODA'07)
Online conflict-free coloring for intervals
K. Chen, A. Fiat, H. Kaplan, M. Levy, J. Matousek, E. Mossel, J. Pach, M. Sharir, S. Smorodinsky, U. Wagner, and E. Welzl
SIAM J. Comput. (2006), 1342-1359
Optimal oblivious routing in polynomial time
Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Räcke
Journal of Computer and System Sciences 69:3 (2004), 383-394 (Special issue of invited papers from STOC 2003)
Predicting and bypassing end-to-end
internet service degradations
A. Bremler-Barr, E. Cohen, H. Kaplan and Y. Mansour
IEEE Journal on Selected Areas in Communications
21:6 (2003), 961-978, Special issue on internet
and WWW measurement, mapping, and modeling (Perliminary version IMW'02)
Connection caching: Model and algorithms
E. Cohen, H. Kaplan, U. Zwick
Journal of Computer and System Sciences 67:1 (2003), 92-126
(Preliminary versions in STOC'99 and SPAA'00)
Purely functional, real-time deques with catenation
H. Kaplan and R. E. Tarjan
journal of the ACM 31:11-16 (1999) 1709-1723
(Preliminary version in STOC'95 titled: "Persistent lists with catenation via recursive slow-down")
Graph sandwich problems
M. C. Golumbic, H. Kaplan, R. Shamir
Journal of Algorithms 19 (1995), 449-473
(Preliminary version in WG'93 titled: "Algorithms and complexity of sandwich problems in graphs")
A case for associative peer to peer overlays
E. Cohen, A. Fiat, and H. Kaplan,
First Workshop on Hot Topics in Networks (HotNets-I), 2002.
(Appeared as a special issue of the Journal Computer
Communication Review 33(1), 95-100 2003.)