Haim Kaplan

Publications
Influence

Reachability and distance queries via 2-hop labels

E. Cohen, E. Halperin, Haim Kaplan, U. Zwick
Mathematics, Computer Science
SODA '02
6 January 2002

We propose a new data structure for representing all distances in a graph that is based on 2-hop covers of the shortest paths, or of all paths, in the graph. Expand

Labeling dynamic XML trees

E. Cohen, Haim Kaplan, T. Milo
Computer Science
PODS '02
3 June 2002

We present algorithms to label the nodes of an XML tree which is subject to insertions and deletions of nodes. Expand

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Haim Kaplan, Moshe Lewenstein, Nira Shafrir, M. Sviridenko
Mathematics, Computer Science
JACM
1 July 2005

We prove that if the d-regular multigraph does not contain more than ⌊d/2⌋ copies of any 2-cycles then we can find a similar decomposition into n2 pairs of cycle covers where each 2-cycle occurs in at most one component of each pair. Expand

Compact labeling schemes for ancestor queries

S. Abiteboul, Haim Kaplan, T. Milo
Computer Science
SODA '01
9 January 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… Expand

Nearest common ancestors: a survey and a new distributed algorithm

Stephen Alstrup, C. Gavoille, Haim Kaplan, Theis Rauhe
Computer Science
SPAA
10 August 2002

A new algorithm that labels the nodes of a rooted tree such that from the labels of two nodes alone one can compute in constant time the label of their nearest common ancestor. Expand

Reach for A*: Efficient Point-to-Point Shortest Path Algorithms

A. Goldberg, Haim Kaplan, Renato F. Werneck
Computer Science
ALENEX
21 January 2006

We study the point-to-point shortest path problem in a setting where preprocessing is allowed. Expand

Four Strikes Against Physical Mapping of DNA

P. Goldberg, M. Golumbic, Haim Kaplan, R. Shamir
Mathematics, Computer Science
J. Comput. Biol.
1995

We show that four simplified models of the problem lead to NP-complete decision problems: Colored unit interval graph completion, the maximum interval (or unit interval) subgraph, the pathwidth of a bipartite graph, and the k-consecutive ones problem. Expand

Non-price equilibria in markets of discrete goods

Avinatan Hassidim, Haim Kaplan, Y. Mansour, N. Nisan
Economics, Computer Science
EC '11
21 March 2011

We study markets of indivisible items in which price-based (Walrasian) equilibria often do not exist due to the discrete non-convex setting. Expand

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

Haim Kaplan, R. Shamir, R. Tarjan
Computer Science, Mathematics
SIAM J. Comput.
1 May 1999

We study the parameterized complexity of three NP-hard graph completion problems. The minimum fill-in problem asks if a graph can be triangulated by adding at most k edges. We develop O(ck m) and… Expand

Faster and simpler algorithm for sorting signed permutations by reversals

Haim Kaplan, R. Shamir, R. Tarjan
Mathematics, Computer Science
SODA '97
5 January 1997

We give a quadratic algorithm for finding the minimum number of reversals needed to sort a signed permutation. Expand

Recommended Authors