Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- Yuri Gurevich
- Larry Stockmeyer
- et al.
- 1984
- Journal of the ACM
Publications
Date
Featured collections
Popular topics
15 results for Uzi Vishkin
Towards a first vertical prototyping of an extremely fine-grained parallel programming approach
- D. Naishlos
- J. Nuzman
- et al.
- 2001
- SPAA 2001
Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach
- Dorit Naishlos
- Joseph Nuzman
- et al.
- 2003
- Theory of Computing Systems
A fast parallel algorithm for finding the convex hull of a sorted point set
- Omer Berkman
- Baruch Schieber
- et al.
- 1996
- International Journal of Computational Geometry and Applications
Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values
- Omer Berkman
- Baruch Schieber
- et al.
- 1993
- Journal of Algorithms
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
- Baruch Schieber
- Uzi Vishkin
- 1990
- Discrete Applied Mathematics
On finding a minimum dominating set in a tournament
- Nimrod Megiddo
- Uzi Vishkin
- 1988
- Theoretical Computer Science
Solving NP-hard problems in 'almost trees': Vertex cover
- Don Coppersmith
- Uzi Vishkin
- 1985
- Discrete Applied Mathematics
CONSTANT DEPTH REDUCIBILITY.
- A.K. Chandra
- Larry Stockmeyer
- et al.
- 1984
- SIAM Journal on Computing
Implementation of simultaneous memory address access in models that forbid it
- Uzi Vishkin
- 1983
- Journal of Algorithms