On k-hulls and related problems
SIAM Journal on Computing
Sorting in c log n parallel steps
Combinatorica
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A deterministic algorithm for partitioning arrangements of lines and its application
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Selecting distances in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Optimal algorithms for tree partitioning
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Planar geometric location problems and maintaining the width of a planar set
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Finding the repeated median regression line
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Incidence and nearest-neighbor problems for lines in 3-space
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing a centerpoint of a finite planar set of points in linear time
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Finding a minimum weight K-link path in graphs with Monge property and applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An expander-based approach to geometric optimization
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
On enumerating and selecting distances
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Approximate Geometric Pattern Matching Under Rigid Motions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Iterated nearest neighbors and finding minimal polytypes
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Computing a minimum-weight k-link path in graphs with the concave Monge property
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The 2-center problem with obstacles
Proceedings of the sixteenth annual symposium on Computational geometry
An optimal algorithm for hyperplane depth in the plane
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Minimax parametric optimization problems and multi-dimensional parametric searching
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Efficient list-approximation techniques for floorplan area minimization
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Parametric search made practical
Proceedings of the eighteenth annual symposium on Computational geometry
The 2-center problem with obstacles
Journal of Algorithms
On the ordinary line problem in computational geometry
Nordic Journal of Computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for the Minimum Diameter Bridge Problem
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Matching Polygonal Curves with Respect to the Fréchet Distance
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Efficient Algorithms for Two-Center Problems for a Convex Polygon
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Labeling Points with Rectangles of Various Shapes
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
Improved algorithms for several network location problems with equality measures
Discrete Applied Mathematics
Journal of Algorithms
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Finding r-Dominating Sets and p-Centers of Trees in Parallel
IEEE Transactions on Parallel and Distributed Systems
Parametric search made practical
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Continuous bottleneck tree partitioning problems
Discrete Applied Mathematics
Guarding a terrain by two watchtowers
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Computing the Fréchet distance between piecewise smooth curves
Computational Geometry: Theory and Applications
Efficient algorithms for center problems in cactus networks
Theoretical Computer Science
The Minmax Relative Regret Median Problem on Networks
INFORMS Journal on Computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A generalized model of equality measures in network location problems
Computers and Operations Research
Computing the Fréchet distance between simple polygons
Computational Geometry: Theory and Applications
Walking your dog in the woods in polynomial time
Proceedings of the twenty-fourth annual symposium on Computational geometry
New Upper Bounds on Continuous Tree Edge-Partition Problem
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Center location problems on tree graphs with subtree-shaped customers
Discrete Applied Mathematics
Algorithms for center and Tverberg points
ACM Transactions on Algorithms (TALG)
Dynamic ham-sandwich cuts in the plane
Computational Geometry: Theory and Applications
Minimax Regret Single-Facility Ordered Median Location Problems on Networks
INFORMS Journal on Computing
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Computational Geometry: Theory and Applications
Optimal movement of mobile sensors for barrier coverage of a planar region
Theoretical Computer Science
Locating an Obnoxious Line among Planar Objects
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Efficient algorithms for the sum selection problem and k maximum sums problem
Theoretical Computer Science
Discrete Applied Mathematics
New results on minimax regret single facility ordered median location problems on networks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Data transmission and base-station placement for optimizing network lifetime
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Geodesic Fréchet distance inside a simple polygon
ACM Transactions on Algorithms (TALG)
New algorithms for barrier coverage with mobile sensors
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Fréchet distance with speed limits
Computational Geometry: Theory and Applications
Some variations on constrained minimum enclosing circle problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Link distance and shortest path problems in the plane
Computational Geometry: Theory and Applications
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Computing the Fréchet distance between folded polygons
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
SIAM Journal on Discrete Mathematics
Efficient algorithms for the sum selection problem and k maximum sums problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
An optimal algorithm for the continuous/discrete weighted 2-center problem in trees
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Fréchet-Distance on road networks
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Efficient algorithms for the weighted k-center problem on a real line
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Backup 2-center on interval graphs
Theoretical Computer Science
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Operations Research Letters
Locating two obnoxious facilities using the weighted maximin criterion
Operations Research Letters
An inverse model for the most uniform problem
Operations Research Letters
One-way and round-trip center location problems
Discrete Optimization
Strongly polynomial-time approximation for a class of bicriteria problems
Operations Research Letters
Algorithmic results for ordered median problems
Operations Research Letters
A polynomial time solution for protein chain pair simplification under the discrete fréchet distance
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Optimal algorithms for the weighted p-center problems on the real line for small p
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A deterministic algorithm for fitting a step function to a weighted point-set
Information Processing Letters
Some variations on constrained minimum enclosing circle problem
Journal of Combinatorial Optimization
Matroid and knapsack center problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
A note on searching line arrangements and applications
Information Processing Letters
Protein Chain Pair Simplification under the Discrete Fréchet Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.01 |
Megiddo introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. This paper provides a general method that trims a factor of O(log n) time (or more) for many applications of this technique.