An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Shifting Algorithm for Min-Max Tree Partitioning
Journal of the ACM (JACM)
Parametric Combinatorial Computing and a Problem of Program Module Distribution
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Generating and Searching Sets Induced by Networks
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Sensitivity analysis for combinatorial optimization
Sensitivity analysis for combinatorial optimization
An o(nm log n) algorithm for maximum network flow
An o(nm log n) algorithm for maximum network flow
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Linear programming with two variables per inequality in poly-log time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Fast parallel algorithms for chordal graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
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
Extremal polygon containment problems
SCG '91 Proceedings of the seventh 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
Minimizing capacity violations in a transshipment network
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
Measuring the resemblance of polygonal curves
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
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
Journal of the ACM (JACM)
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
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A deterministic algorithm for the three-dimensional diameter problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Finding minimum-quotient cuts in planar graphs
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
SCG '94 Proceedings of the tenth 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
Computing envelopes in four dimensions with applications
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)
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Efficient collision detection for moving polyhedra
Proceedings of the eleventh annual symposium on Computational geometry
Efficient randomized algorithms for some geometric optimization problems
Proceedings of the eleventh annual symposium on Computational geometry
The Normalized String Editing Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
A near-linear algorithm for the planar 2-center problem
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Rectilinear p-piercing problems
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Computing the minimum diameter for moving points: an exact implementation using parametric search
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the fourteenth 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
Efficiently approximating polygonal paths in three and higher dimensions
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
A polynomial combinatorial algorithm for generalized minimum cost flow
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Iterated nearest neighbors and finding minimal polytypes
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Efficient randomized algorithms for the repeated median line estimator
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Optimal edge ranking to trees in polynomial time
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
Line transversals of balls and smallest enclosing cylinders in three dimensions
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal point placement for mesh smoothing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A near-linear algorithm for the planar segment center problem
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for the three-dimensional diameter problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for the quickest transshipment problem with zero transit times
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Applying parallel processing techniques to classification problems in constructive solid geometry
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Using separation algorithms in fixed dimension
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for projective clustering
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Dynamic planar convex hull operations in near-logarithmic amortized time
Journal of the ACM (JACM)
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Notes on computing peaks in k-levels and parametric spanning trees
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
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
Packing two disks in a polygon
Computational Geometry: Theory and Applications
Efficient algorithms for the minimum diameter bridge problem
Computational Geometry: Theory and Applications - Special issue on Discrete and computational geometry
On the ordinary line problem in computational geometry
Nordic Journal of Computing
Optimal height reduction problems for tree-structured hierarchies
Nordic Journal of Computing
A fast algorithm for the alpha-connected two-center decision problem
Information Processing Letters
Optimal Facility Location under Various Distance Functions
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Efficient Algorithms for the Minimum Diameter Bridge Problem
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Matching Polygonal Curves with Respect to the Fréchet Distance
STACS '01 Proceedings of the 18th 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
On the Planar Two-Watchtower Problem
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Packing Two Disks into a Polygonal Environment
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Inverse Parametric Sequence Alignment
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
The Anatomy of a Geometric Algorithm
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
Labeling Points with Rectangles of Various Shapes
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Two-Center Problems for a Convex Polygon (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip
Discrete Applied Mathematics
Decomposable multi-parameter matroid optimization problems
Theoretical Computer Science - Latin American theoretical informatics
Building bridges between convex regions
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Hausdorff distance under translation for points and balls
Proceedings of the nineteenth annual symposium on Computational geometry
Approximation algorithms for projective clustering
Journal of Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On k-hulls and related problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem
Information Processing Letters
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for center and Tverberg points
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
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
Inverse parametric sequence alignment
Journal of Algorithms
Guarding a terrain by two watchtowers
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Pianos are not flat: rigid motion planning in three dimensions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Calculating the meeting point of scattered robots on weighted terrain surfaces
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Optimal spanners for axis-aligned rectangles
Computational Geometry: Theory and Applications
Journal of Global Optimization
Three problems about simple polygons
Computational Geometry: Theory and Applications
Simple algorithms for partial point set pattern matching under rigid motion
Pattern Recognition
Computing the Fréchet distance between piecewise smooth curves
Computational Geometry: Theory and Applications
Approximation algorithms for spreading points
Journal of Algorithms
Efficient algorithms for center problems in cactus networks
Theoretical Computer Science
The Minmax Relative Regret Median Problem on Networks
INFORMS Journal on Computing
On finding widest empty curved corridors
Computational Geometry: Theory and Applications
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
Succinct approximate convex pareto curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
Single facility collection depots location problem in the plane
Computational Geometry: Theory and Applications
Minimax Regret Single-Facility Ordered Median Location Problems on Networks
INFORMS Journal on Computing
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Earliest Arrival Flows with Multiple Sources
Mathematics of Operations Research
Traffic Networks and Flows over Time
Algorithmics of Large and Complex Networks
Optimal Embedding into Star Metrics
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
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
Three problems about simple polygons
Computational Geometry: Theory and Applications
Journal of Discrete Algorithms
Efficient algorithms for the sum selection problem and k maximum sums problem
Theoretical Computer Science
Discrete Applied Mathematics
Cylindrical hierarchy for deforming necklaces
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
An improved algorithm for point set pattern matching under rigid motion
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
New results on minimax regret single facility ordered median location problems on networks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Farthest-polygon Voronoi diagrams
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Hausdorff distance under translation for points and balls
ACM Transactions on Algorithms (TALG)
IEEE Transactions on Information Theory
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
Farthest-polygon Voronoi diagrams
Computational Geometry: Theory and Applications
Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling
Computers and Industrial Engineering
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
Semialgebraic Range Reporting and Emptiness Searching with Applications
SIAM Journal on Computing
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A polynomial-time approximation algorithm for a geometric dispersion problem
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
In-place randomized slope selection
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Approximation algorithms for spreading points
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Efficient algorithms for the sum selection problem and k maximum sums problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Fréchet-Distance on road networks
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Online team formation in social networks
Proceedings of the 21st international conference on World Wide Web
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Matroids and integrality gaps for hypergraphic steiner tree relaxations
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
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
On some geometric selection and optimization problems via sorted matrices
Computational Geometry: Theory and Applications
A strongly polynomial algorithm for line search in submodular polyhedra
Discrete Optimization
One-way and round-trip center location problems
Discrete Optimization
A linear-time algorithm for solving continuous maximin knapsack problems
Operations Research Letters
Constructing the minimization diagram of a two-parameter problem
Operations Research Letters
Strongly polynomial-time approximation for a class of bicriteria problems
Operations Research Letters
Optimization with additional variables and constraints
Operations Research Letters
Algorithmic results for ordered median problems
Operations Research Letters
A simple framework for the generalized nearest neighbor problem
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
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
Note: A note on periodic schedules for linear precedence constraints
Discrete Applied Mathematics
Parametric search visualization
Proceedings of the twenty-ninth annual symposium on Computational geometry
Net and prune: a linear time algorithm for euclidean distance problems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A note on searching line arrangements and applications
Information Processing Letters
Algorithms for hotspot computation on trajectory data
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.07 |