On the public citation graph
Algorithmic techniques for geometric optimization
0 signed · 123 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1520-6750(198704)34:2<229::aid-nav3220340207>3.0.co;2-1openalex-snapshot
On the rectangularp-center problem
inferredcites →https://doi.org/10.1002/rsa.3240050408openalex-snapshot
Lower bounds for a subexponential optimization algorithm
inferredcites →https://doi.org/10.1006/jagm.1993.1043openalex-snapshot
Computing a Segment Center for a Planar Point Set
inferredcites →https://doi.org/10.1006/jagm.1994.1038openalex-snapshot
Applications of Parametric Searching in Geometric Optimization
inferredcites →https://doi.org/10.1006/jagm.1996.0060openalex-snapshot
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
inferredcites →https://doi.org/10.1007/3-540-07407-4_17openalex-snapshot
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
inferredcites →https://doi.org/10.1007/3-540-50335-8_34openalex-snapshot
On the detection of a common intersection of κ convex polyhedra
inferredcites →https://doi.org/10.1007/3-540-55210-3_213openalex-snapshot
A combinatorial bound for linear programming and related problems
inferredcites →https://doi.org/10.1007/3-540-55706-7_28openalex-snapshot
Improvements on geometric pattern matching problems
inferredcites →https://doi.org/10.1007/3-540-57155-8_278openalex-snapshot
Repetitive hidden-surface-removal for polyhedral scenes
inferredcites →https://doi.org/10.1007/3-540-60220-8_47openalex-snapshot
The two-line center problem from a polar view: a new algorithm and data structure
inferredcites →https://doi.org/10.1007/3-540-60220-8_48openalex-snapshot
On some geometric selection and optimization problems via sorted matrices
inferredcites →https://doi.org/10.1007/3-540-60313-1_149openalex-snapshot
Geometric pattern matching in d-dimensional space
inferredcites →https://doi.org/10.1007/978-3-642-58043-7_7openalex-snapshot
Hyperplane Approximation and Related Topics
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferredcites →https://doi.org/10.1007/bf01182771openalex-snapshot
Algorithms for bichromatic line-segment problems and polyhedral terrains
inferredcites →https://doi.org/10.1007/bf01182774openalex-snapshot
Planar geometric location problems
inferredcites →https://doi.org/10.1007/bf01185430openalex-snapshot
Parametric optimization of sequence alignment
inferredcites →https://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferredcites →https://doi.org/10.1007/bf01530830openalex-snapshot
Approximate matching of polygonal shapes
inferredcites →https://doi.org/10.1007/bf01587088openalex-snapshot
A randomized algorithm for fixed-dimensional linear programming
inferredcites →https://doi.org/10.1007/bf01696777openalex-snapshot
Über Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten
inferredcites →https://doi.org/10.1007/bf01940877openalex-snapshot
A subexponential bound for linear programming
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02573973openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferredcites →https://doi.org/10.1007/bf02574015openalex-snapshot
On range searching with semialgebraic sets
inferredcites →https://doi.org/10.1007/bf02574379openalex-snapshot
Helly-type theorems and Generalized Linear Programming
inferredcites →https://doi.org/10.1007/bf02574699openalex-snapshot
Small-dimensional linear programming and convex hulls made easy
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02711511openalex-snapshot
A near-linear algorithm for the planar segment-center problem
inferredcites →https://doi.org/10.1007/bfb0038202openalex-snapshot
Smallest enclosing disks (balls and ellipsoids)
inferredcites →https://doi.org/10.1016/0020-0190(86)90037-2openalex-snapshot
Linear programming in O(n × 3d) time
inferredcites →https://doi.org/10.1016/0020-0190(88)90127-5openalex-snapshot
On the detection of a common intersection of k convex objects in the plane
inferredcites →https://doi.org/10.1016/0020-0190(89)90166-xopenalex-snapshot
L-infinity interdistance selection by parametric search
inferredcites →https://doi.org/10.1016/0020-0190(91)90177-jopenalex-snapshot
Randomized optimal algorithm for slope selection
inferredcites →https://doi.org/10.1016/0020-0190(93)90149-4openalex-snapshot
Approximate parametric searching
inferredcites →https://doi.org/10.1016/0020-0190(93)90153-zopenalex-snapshot
A faster algorithm for the two-center decision problem
inferredcites →https://doi.org/10.1016/0020-0190(93)90234-zopenalex-snapshot
Optimal slope selection via expanders
inferredcites →https://doi.org/10.1016/0020-0255(91)90050-5openalex-snapshot
On weighted rectilinear 2-center and 3-center problems
inferredcites →https://doi.org/10.1016/0022-0000(82)90048-4openalex-snapshot
The complexity of selection and ranking in X + Y and matrices with sorted columns
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0196-6774(83)90035-4openalex-snapshot
Finding kth paths and p-centers by generating and searching good data structures
inferredcites →https://doi.org/10.1016/0196-6774(85)90011-2openalex-snapshot
Partitioning with two lines in the plane
inferredcites →https://doi.org/10.1016/0196-6774(92)90006-xopenalex-snapshot
Using separation algorithms in fixed dimension
inferredcites →https://doi.org/10.1016/0925-7721(91)90001-uopenalex-snapshot
Off-line dynamic maintenance of the width of a planar point set
inferredcites →https://doi.org/10.1016/0925-7721(93)90001-mopenalex-snapshot
A convex polygon among polygonal obstacles: placement and high-clearance motion
inferredcites →https://doi.org/10.1016/0925-7721(94)90003-5openalex-snapshot
Computing the smallest k-enclosing circle and related problems
inferredcites →https://doi.org/10.1016/0925-7721(94)90011-6openalex-snapshot
External polygon containment problems
inferredcites →https://doi.org/10.1016/s0747-7171(86)80020-7openalex-snapshot
Computing a ham-sandwich cut in two dimensions
inferredcites →https://doi.org/10.1016/s0925-7721(00)00026-2openalex-snapshot
Hamilton cycles in the path graph of a set of points in convex position
inferredcites →https://doi.org/10.1057/jors.1984.150openalex-snapshot
The p-Centre Problem—Heuristic and Optimal Algorithms
inferredcites →https://doi.org/10.1090/dimacs/006/14openalex-snapshot
Computing the center of planar point sets
inferredcites →https://doi.org/10.1109/istcs.1995.377043openalex-snapshot
Improved algorithms in geometric optimization via expanders
inferredcites →https://doi.org/10.1109/sfcs.1992.267805openalex-snapshot
A subexponential algorithm for abstract optimization problems
inferredcites →https://doi.org/10.1109/sfcs.1993.366847openalex-snapshot
Product range spaces, sensitive sampling, and derandomization
inferredcites →https://doi.org/10.1137/0212052openalex-snapshot
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
inferredcites →https://doi.org/10.1137/0213002openalex-snapshot
Generalized Selection and Ranking: Sorted Matrices
inferredcites →https://doi.org/10.1137/0213014openalex-snapshot
On the Complexity of Some Common Geometric Location Problems
inferredcites →https://doi.org/10.1137/0215052openalex-snapshot
On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
inferredcites →https://doi.org/10.1137/0218055openalex-snapshot
An Optimal-Time Algorithm for Slope Selection
inferredcites →https://doi.org/10.1137/s0097539792241928openalex-snapshot
Weighted Multidimensional Search and Its Application to Convex Optimization
inferredcites →https://doi.org/10.1142/9789814354363_0005openalex-snapshot
Maximizing Concave Functions in Fixed Dimension
inferredcites →https://doi.org/10.1142/9789814354363_0019openalex-snapshot
Maximizing Non-Linear Concave Functions in Fixed Dimension
inferredcites →https://doi.org/10.1145/109648.109669openalex-snapshot
Approximate matching of polygonal shapes (extended abstract)
inferredcites →https://doi.org/10.1145/129712.129744openalex-snapshot
A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension
inferredcites →https://doi.org/10.1145/129712.129759openalex-snapshot
A subexponential randomized simplex algorithm (extended abstract)
inferredcites →https://doi.org/10.1145/142675.142681openalex-snapshot
A class of convex programs with applications to computational geometry
inferredcites →https://doi.org/10.1145/142675.142703openalex-snapshot
Incidence and nearest-neighbor problems for lines in 3-space
inferredcites →https://doi.org/10.1145/160985.161002openalex-snapshot
Geometric partitioning made easier, even in parallel
inferredcites →https://doi.org/10.1145/160985.161003openalex-snapshot
Computing a centerpoint of a finite planar set of points in linear time
inferredcites →https://doi.org/10.1145/160985.161004openalex-snapshot
Approximating center points with iterated radon points
inferredcites →https://doi.org/10.1145/160985.161137openalex-snapshot
An expander-based approach to geometric optimization
inferredcites →https://doi.org/10.1145/167088.167217openalex-snapshot
A deterministic algorithm for the three-dimensional diameter problem
inferredcites →https://doi.org/10.1145/177424.178038openalex-snapshot
An efficient algorithm for the Euclidean two-center problem
inferredcites →https://doi.org/10.1145/177424.178039openalex-snapshot
On geometric optimization with few violated constraints
inferredcites →https://doi.org/10.1145/177424.178064openalex-snapshot
Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem
inferredcites →https://doi.org/10.1145/177424.178081openalex-snapshot
Computing envelopes in four dimensions with applications
inferredcites →https://doi.org/10.1145/201019.201036openalex-snapshot
Las Vegas algorithms for linear and integer programming when the dimension is small
inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1145/220279.220284openalex-snapshot
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
inferredcites →https://doi.org/10.1145/220279.220314openalex-snapshot
Efficient randomized algorithms for some geometric optimization problems
inferredcites →https://doi.org/10.1145/237218.237251openalex-snapshot
A near-linear algorithm for the planar 2-center problem
inferredcites →https://doi.org/10.1145/2402.322391openalex-snapshot
Parametric Combinatorial Computing and a Problem of Program Module Distribution
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/321978.321982openalex-snapshot
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/7531.7537openalex-snapshot
Slowing down sorting networks to obtain faster sorting algorithms
inferredcites →https://doi.org/10.1145/98524.98599openalex-snapshot
Computing the minimum Hausdorff distance for point sets under translation
inferredcites →https://doi.org/10.1201/9781420010749-38openalex-snapshot
Sensitivity Analysis in Combinatorial Optimization
inferredcites →https://doi.org/10.1287/moor.4.4.414openalex-snapshot
Combinatorial Optimization with Rational Objective Functions
inferredcites →https://doi.org/10.1287/moor.8.4.498openalex-snapshot
The Weighted Euclidean 1-Center Problem
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.5555/127787.127822openalex-snapshot
Optimal algorithms for tree partitioning
inferredcites →https://doi.org/10.5555/313559.313614openalex-snapshot
Efficient randomized algorithms for the repeated median line estimator
inferredcites →https://doi.org/10.5555/313559.313764openalex-snapshot
Ray shooting amidst convex polytopes in three dimensions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10719839_22openalex-snapshot
Multi-parameter Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_5openalex-snapshot
Geometric Optimization Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_6openalex-snapshot
How to Cover a Point Set with a V-Shape of Minimum Width
inferred← citeshttps://doi.org/10.1007/978-3-642-22616-8_29openalex-snapshot
Improved Algorithms for Farthest Colored Voronoi Diagram of Segments
inferred← citeshttps://doi.org/10.1007/pl00009455openalex-snapshot
Motion Planning for a Convex Polygon in a Polygonal Environment
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.09.006openalex-snapshot
How to cover a point set with a V-shape of minimum width
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.017openalex-snapshot
An algorithm to find maximum area polygons circumscribed about a convex polygon
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.008openalex-snapshot
Improved algorithms for the farthest colored Voronoi diagram of segments
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00049-5openalex-snapshot
Linear approximation of simple objects
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00638-2openalex-snapshot
Decomposable multi-parameter matroid optimization problems
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743510openalex-snapshot
Parametric and kinetic minimum spanning trees
inferred← citeshttps://doi.org/10.1145/237218.237255openalex-snapshot
Rectilinear and polygonal p -piercing and p -center problems
inferred← citeshttps://doi.org/10.48550/arxiv.1108.2063openalex-snapshot
How to Cover a Point Set with a V-Shape of Minimum Width
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.