Multidimensional divide-and-conquer
Communications of the ACM
Expected time bounds for selection
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Computational geometry.
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A probabilistic algorithm for the post office problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Algorithms for vertical and orthogonal L1 linear approximation of points
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Stabbing pairwise disjoint translates in linear time
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Output sensitive construction of levels and Voronoi diagrams in Rd of order 1 to k
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Quantitative Steinitz's theorems with applications to multifingered grasping
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Optimal algorithms for some smallest intersection radius problems (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Polynomial algorithms for linear programming over the algebraic numbers
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
Separation and approximation of polyhedral objects
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
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)
Global visibility algorithms for illumination computations
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Bounds for the computational power and learning complexity of analog neural nets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Parallel linear programming in fixed dimension almost surely in constant time
Journal of the ACM (JACM)
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
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
A survey of linear programming in randomized subexponential time
ACM SIGACT News
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
A parallel algorithm for linear programming in fixed dimension
Proceedings of the eleventh annual symposium on Computational geometry
On computing Voronoi diagrams by divide-prune-and-conquer
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
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Optimizing two-phase, level-clocked circuitry
Journal of the ACM (JACM)
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Circular separability of polygon
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh 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
An efficient algorithm for terrain simplification
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
Using separation algorithms in fixed dimension
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A polygon matching problem in computer vision (abstract only)
CSC '87 Proceedings of the 15th annual conference on Computer Science
Linear programming queries revisited
Proceedings of the sixteenth annual symposium on Computational geometry
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
Optimizing the sum of linear fractional functions and applications
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for TSP with neighborhoods in the plane
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Randomizing combinatorial algorithms for linear programming when the dimension is moderately high
SODA '01 Proceedings of the twelfth 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
ACM SIGACT News
Explicit and implicit enforcing: randomized optimization
Computational Discrete Mathematics
Efficient algorithm for transversal of disjoint convex polygons
Information Processing Letters
Transversal of disjoint convex polygons
Information Processing Letters
Minimizing the sum of the k largest functions in linear time
Information Processing Letters
Fast 2-Variable Integer Programming
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Visibility in Discrete Geometry: An Application to Discrete Geodesic Paths
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Reconstruction of Animated Models from Images Using Constrained Deformable Surfaces
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Output-sensitive cell enumeration in hyperplane arrangements
Nordic Journal of Computing
Enumerating extreme points in higher dimensions
Nordic Journal of Computing
Decomposable multi-parameter matroid optimization problems
Theoretical Computer Science - Latin American theoretical informatics
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Information Processing Letters
The smallest enclosing ball of balls: combinatorial structure and algorithms
Proceedings of the nineteenth annual symposium on Computational geometry
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A linear incremental algorithm for naive and standard digital lines and planes recognition
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
2D and 3D visibility in discrete geometry: an application to discrete geodesic paths
Pattern Recognition Letters - Special issue: Discrete geometry for computer imagery (DGCI'2002)
Approximation algorithms for TSP with neighborhoods in the plane
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Longest path selection for delay test under process variation
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Multi-pass geometric algorithms
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A fast deterministic smallest enclosing disk approximation algorithm
Information Processing Letters
A simple linear algorithm for computing rectilinear 3-centers
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Discrete Applied Mathematics
General Polynomial Time Decomposition Algorithms
The Journal of Machine Learning Research
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model
Image and Vision Computing
Algorithmic and explicit determination of the Lovász number for certain circulant graphs
Discrete Applied Mathematics
An optimal randomized algorithm for d-variate zonoid depth
Computational Geometry: Theory and Applications
Output-sensitive algorithms for Tukey depth and related problems
Statistics and Computing
Smoothing method for minimizing the sum of the r largest functions
Optimization Methods & Software
Multi-dimensional dynamic facility location and fast computation at query points
Information Processing Letters
Area-universal rectangular layouts
Proceedings of the twenty-fifth annual symposium on Computational geometry
Geometric pattern matching for point sets in the plane under similarity transformations
Information Processing Letters
Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem
Journal of Scheduling
Measure of circularity for parts of digital boundaries and its fast computation
Pattern Recognition
Efficient computation of a near-optimal primary parting line
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
A simple linear algorithm for computing rectilinear 3-centers
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Approximating centroids for the maximum intersection of spherical polygons
Computer-Aided Design
A fast deterministic smallest enclosing disk approximation algorithm
Information Processing Letters
An efficient and quasi linear worst-case time algorithm for digital plane recognition
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Simplifying 3D polygonal chains under the discrete Fréchet distance
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Weighted rectilinear approximation of points in the plane
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
The 2-center problem in three dimensions
Proceedings of the twenty-sixth annual symposium on Computational geometry
On three constrained versions of the digital circular arc recognition problem
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
An improved algorithm for the solution of the regularization path of support vector machine
IEEE Transactions on Neural Networks
Adaptive algorithms for planar convex hull problems
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Max-min utility fair flow management for networks with route diversity
International Journal of Network Management
Introduction to digital level layers
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Analytical description of digital circles
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Estimation of the derivatives of a digital function with a convergent bounded error
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Reconstructing polygons from scanner data
Theoretical Computer Science
Recognition of digital hyperplanes and level layers with forbidden points
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Arc segmentation in linear time
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
ESA'11 Proceedings of the 19th European conference on Algorithms
SIAM Journal on Scientific Computing
Instant approximate 1-center on road networks via embeddings
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
On the language of standard discrete planes and surfaces
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
New approximation algorithms for minimum enclosing convex shapes
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
General polynomial time decomposition algorithms
COLT'05 Proceedings of the 18th annual conference on Learning Theory
The complexity of geometric problems in high dimension
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A composite and quasi linear time method for digital plane recognition
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Supercover model and digital straight line recognition on irregular isothetic grids
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Efficient computation of the lovász theta function for a class of circulant graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
On the parameterized complexity of d-dimensional point set pattern matching
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Computational aspects of digital plane and hyperplane recognition
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Efficient algorithms for the weighted k-center problem on a real line
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Outlier respecting points approximation
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Minimizing the error of linear separators on linearly inseparable data
Discrete Applied Mathematics
A dual algorithm for the minimum covering ball problem in Rn
Operations Research Letters
Facility location problems with uncertainty on the plane
Discrete Optimization
One-way and round-trip center location problems
Discrete Optimization
Linear time algorithms for some separable quadratic programming problems
Operations Research Letters
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
Operations Research Letters
ε-Approximation minimization of convex functions in fixed dimension
Operations Research Letters
Optimization with additional variables and constraints
Operations Research Letters
Measuring regularity of convex polygons
Computer-Aided Design
Tractable reasoning problems with fully-characterized association rules
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
A practical but rigorous approach to sum-of-ratios optimization in geometric applications
Computational Optimization and Applications
Maximum overlap of convex polytopes under translation
Computational Geometry: Theory and Applications
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Net and prune: a linear time algorithm for euclidean distance problems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.01 |