Filter Results:
- Full text PDF available (101)
Publication Year
1978
2019
- This year (17)
- Last 5 years (84)
- Last 10 years (155)
Supplemental Content
Publication Type
Co-author
Journals and Conferences
Learn More
- Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
- SODA
- 2002
Reachability and distance queries in graphs are fundamental to numerous applications, ranging from geographic navigation systems to Internet routing. Some of these applications involve huge graphs… (More)
- Edith Cohen, Haim Kaplan, Tova Milo
- PODS
- 2002
We present algorithms to label the nodes of an XML tree which is subject to insertions and deletions of nodes. The labeling is done such that (1) we label each node immediately when it is inserted… (More)
- Martin Charles Golumbic, Haim Kaplan, Ron Shamir
- CTW
- 1995
Abstract The graph sandwich problem for property Π is defined as follows: Given two graphs G 1 = ( V , E 1 ) and G 2 = ( V , E 2 ) such that E 1 ⊆ E 2 , is there a graph G = ( V , E ) such that E 1 ⊆… (More)
- Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
- J. Comput. Syst. Sci.
- 2004
A recent seminal result of Racke is that for any undirected network there is an oblivious routing algorithm with a polylogarithmic competitive ratio with respect to congestion. Unfortunately, Racke's… (More)
- Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
- ALENEX
- 2006
We study the point-to-point shortest path problem in a setting where preprocessing is allowed. We improve the reach-based approach of Gutman [17] in several ways. In particular, we introduce a… (More)
- Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
- J. ACM
- 2005
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall's theorem, one can represent such a multigraph as a combination of at most n2 cycle… (More)
- Serge Abiteboul, Haim Kaplan, Tova Milo
- SODA
- 2001
We consider the following problem. Give a rooted tree T, label the nodes of T in the most compact way such that given the labels of two nodes one can determine in constant time, by looking only at… (More)
We study markets of indivisible items in which price-based (Walrasian) equilibria often do not exist due to the discrete non-convex setting. Instead we consider Nash equilibria of the market viewed… (More)
- Sanjeev Arora, Alan M. Frieze, Haim Kaplan
- Proceedings of 37th Conference on Foundations of…
- 1996
We present a randomized procedure for rounding fractional perfect matchings to (integral) matchings. If the original fractional matching satisfies any linear inequality, then with high probability,… (More)
- Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
- SPAA
- 2002
Several papers describe linear time algorithms to preprocess a tree, such that one can answer subsequent nearest common ancestor queries in constant time. Here, we survey these algorithms and related… (More)