On the public citation graph
On geometric optimization with few violated constraints
0 signed · 144 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.1006/jagm.1995.1048openalex-snapshot
Static and Dynamic Algorithms for k-Point Clustering Problems
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-55210-3_213openalex-snapshot
A combinatorial bound for linear programming and related problems
inferredcites →https://doi.org/10.1007/3-540-57155-8_254openalex-snapshot
Static and dynamic algorithms for k-point clustering problems
inferredcites →https://doi.org/10.1007/3-540-57155-8_259openalex-snapshot
Computing the smallest k-enclosing circle and related problems
inferredcites →https://doi.org/10.1007/3-540-57785-8_127openalex-snapshot
The nature and meaning of perturbations in geometric computing
inferredcites →https://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1007/bf02573988openalex-snapshot
A bound on local minima of arrangements that implies the upper bound theorem
inferredcites →https://doi.org/10.1007/bf02574012openalex-snapshot
Iterated nearest neighbors and finding minimal polytopes
inferredcites →https://doi.org/10.1007/bf02574379openalex-snapshot
Helly-type theorems and Generalized Linear Programming
inferredcites →https://doi.org/10.1007/bf02574381openalex-snapshot
Counting triangle crossings and halving planes
inferredcites →https://doi.org/10.1007/bf02574692openalex-snapshot
On levels in arrangements and voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02574700openalex-snapshot
Points and triangles in the plane and halving planes in space
inferredcites →https://doi.org/10.1016/0020-0190(94)00190-aopenalex-snapshot
On enclosing k points by a circle
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0022-0000(90)90016-eopenalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferredcites →https://doi.org/10.1016/0196-6774(91)90022-qopenalex-snapshot
Finding k points with minimum diameter and related problems
inferredcites →https://doi.org/10.1016/0304-3975(78)90006-3openalex-snapshot
The densest hemisphere problem
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.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1988.21961openalex-snapshot
A Las Vegas algorithm for linear programming when the dimension is small
inferredcites →https://doi.org/10.1109/sfcs.1992.267805openalex-snapshot
A subexponential algorithm for abstract optimization problems
inferredcites →https://doi.org/10.1145/129712.129759openalex-snapshot
A subexponential randomized simplex algorithm (extended abstract)
inferredcites →https://doi.org/10.1145/142675.142678openalex-snapshot
A subexponential bound for linear programming
inferredcites →https://doi.org/10.1145/142675.142694openalex-snapshot
An efficient approach to removing geometric degeneracies
inferredcites →https://doi.org/10.1145/160985.160994openalex-snapshot
An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
inferredcites →https://doi.org/10.1145/160985.161141openalex-snapshot
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
inferredcites →https://doi.org/10.1145/177424.177521openalex-snapshot
Constructing levels in arrangements and higher order Voronoi diagrams
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.1287/moor.8.4.498openalex-snapshot
The Weighted Euclidean 1-Center Problem
inferredcites →https://doi.org/10.5555/313559.313612openalex-snapshot
Iterated nearest neighbors and finding minimal polytypes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11841036_36openalex-snapshot
Violator Spaces: Structure and Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_1openalex-snapshot
The Anatomy of a Geometric Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_78openalex-snapshot
Geometric Applications of Posets
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_6openalex-snapshot
Randomized Algorithms for Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-01258-8_43openalex-snapshot
Robust Fitting in Computer Vision: Easy or Hard?
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_38openalex-snapshot
Algorithms for Radon Partitions with Tolerance
inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_13openalex-snapshot
Cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_46openalex-snapshot
On the k-colored Rainbow Sets in Fixed Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_13openalex-snapshot
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_36openalex-snapshot
Computing a Minimum-Width Square or Rectangular Annulus with Outliers
inferred← citeshttps://doi.org/10.1007/978-3-319-44403-1_2openalex-snapshot
General Purpose Index-Based Method for Efficient MaxRS Query
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_27openalex-snapshot
Fast Algorithms for Computing the Smallest k-Enclosing Disc
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_6openalex-snapshot
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_24openalex-snapshot
Approximating Points by a Piecewise Linear Function: I
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_5openalex-snapshot
The Complexity of Geometric Problems in High Dimension
inferred← citeshttps://doi.org/10.1007/978-3-642-21931-3_7openalex-snapshot
k-Enclosing Axis-Parallel Square
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_61openalex-snapshot
Outlier Respecting Points Approximation
inferred← citeshttps://doi.org/10.1007/978-81-322-2250-7_33openalex-snapshot
Smallest Square Covering k Points for Large Value of k
inferred← citeshttps://doi.org/10.1007/pl00009305openalex-snapshot
A Helly-Type Theorem for Unions of Convex Sets
inferred← citeshttps://doi.org/10.1007/pl00009478openalex-snapshot
Geometric Applications of a Randomized Optimization Technique
inferred← citeshttps://doi.org/10.1007/s00453-004-1123-0openalex-snapshot
Fast Algorithms for Computing the Smallest k-Enclosing Circle
inferred← citeshttps://doi.org/10.1007/s00453-012-9658-yopenalex-snapshot
Approximating Points by a Piecewise Linear Function
inferred← citeshttps://doi.org/10.1007/s00453-012-9738-zopenalex-snapshot
Outlier Respecting Points Approximation
inferred← citeshttps://doi.org/10.1007/s00453-016-0263-3openalex-snapshot
Geometric Path Problems with Violations
inferred← citeshttps://doi.org/10.1007/s00453-020-00673-yopenalex-snapshot
Shortest Paths in the Plane with Obstacle Violations
inferred← citeshttps://doi.org/10.1007/s00454-001-0006-2openalex-snapshot
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization
inferred← citeshttps://doi.org/10.1007/s00454-006-1267-6openalex-snapshot
On the Least Median Square Problem
inferred← citeshttps://doi.org/10.1007/s00454-007-9013-2openalex-snapshot
Robust Shape Fitting via Peeling and Grating Coresets
inferred← citeshttps://doi.org/10.1007/s00454-008-9085-7openalex-snapshot
Removing Degeneracy in LP-Type Problems Revisited
inferred← citeshttps://doi.org/10.1007/s00454-009-9177-zopenalex-snapshot
On Approximate Range Counting and Depth
inferred← citeshttps://doi.org/10.1007/s10957-010-9754-6openalex-snapshot
A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality
inferred← citeshttps://doi.org/10.1007/s11222-008-9054-2openalex-snapshot
Output-sensitive algorithms for Tukey depth and related problems
inferred← citeshttps://doi.org/10.1007/s11263-019-01207-yopenalex-snapshot
Robust Fitting in Computer Vision: Easy or Hard?
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50021-8openalex-snapshot
Closest-Point Problems in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.automatica.2008.09.004openalex-snapshot
Interval predictor models: Identification and reliability
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.09.003openalex-snapshot
Clarkson's algorithm for violator spaces
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.10.002openalex-snapshot
Covering points by disjoint boxes with outliers
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.07.002openalex-snapshot
A streaming algorithm for 2-center with outliers in high dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.08.002openalex-snapshot
Computing a minimum-width square or rectangular annulus with outliers
inferred← citeshttps://doi.org/10.1016/j.dam.2007.08.048openalex-snapshot
Violator spaces: Structure and algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2021.09.014openalex-snapshot
Algorithms for Radon partitions with tolerance
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.019openalex-snapshot
Removing degeneracy may require unbounded dimension increase
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.02.013openalex-snapshot
Smallest k-point enclosing rectangle and square of arbitrary orientation
inferred← citeshttps://doi.org/10.1016/j.jda.2008.12.002openalex-snapshot
Algorithms for optimal outlier removal
inferred← citeshttps://doi.org/10.1016/j.sysconle.2010.05.003openalex-snapshot
Learning noisy functions via interval models
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00212-3openalex-snapshot
Enclosing k points in the smallest axis parallel rectangle
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00031-5openalex-snapshot
Geometric applications of posets
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)56701-4openalex-snapshot
Minimization with few violated constraints and its application in set-membership identification
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80337-8openalex-snapshot
On a Simple Sampling Lemma
inferred← citeshttps://doi.org/10.1023/a:1016567327455openalex-snapshot
An Optimization Based Robust Identification Algorithm in the Presence of Outliers
inferred← citeshttps://doi.org/10.1080/00207160211923openalex-snapshot
Computing the Smallest T-Shaped Polygon Containing k Points
inferred← citeshttps://doi.org/10.1109/cacsd.2010.5612829openalex-snapshot
Random convex programs part 2
inferred← citeshttps://doi.org/10.1109/cacsd.2010.5612842openalex-snapshot
Random convex programs part 1
inferred← citeshttps://doi.org/10.1109/cdc.1999.831288openalex-snapshot
A robust stochastic identification algorithm in the presence of outliers
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434314openalex-snapshot
Modulating robustness in robust control: Making it easy through randomization
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717086openalex-snapshot
Random convex programs: Dealing with the non-existing solution nuisance
inferred← citeshttps://doi.org/10.1109/cvpr.2018.00318openalex-snapshot
A Fast Resection-Intersection Method for the Known Rotation Problem
inferred← citeshttps://doi.org/10.1109/dicta.2017.8227480openalex-snapshot
RATSAC - Random Tree Sampling for Maximum Consensus Estimation
inferred← citeshttps://doi.org/10.1109/iccv.2017.105openalex-snapshot
Quasiconvex Plane Sweep for Triangulation with Outliers
inferred← citeshttps://doi.org/10.1109/iccv.2019.00172openalex-snapshot
Consensus Maximization Tree Search Revisited
inferred← citeshttps://doi.org/10.1109/icectech.2011.5941652openalex-snapshot
K-enclosing square or rectangle problem revisited
inferred← citeshttps://doi.org/10.1109/icectech.2011.5941660openalex-snapshot
Classical knapsack to geometric knapsack: A journey
inferred← citeshttps://doi.org/10.1109/jstars.2021.3078516openalex-snapshot
A Geometric Estimation Technique Based on Adaptive M-Estimators: Algorithm and Applications
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892109openalex-snapshot
On levels in arrangements of curves
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181981openalex-snapshot
Low-dimensional linear programming with violations
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814581openalex-snapshot
Dynamic planar convex hull operations in near-logarithmic amortized time
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814602openalex-snapshot
Setting parameters by example
inferred← citeshttps://doi.org/10.1109/tac.2002.800644openalex-snapshot
Optimization with few violated constraints for linear bounded error parameter estimation
inferred← citeshttps://doi.org/10.1109/tgrs.2020.2972982openalex-snapshot
Robust Geometric Model Estimation Based on Scaled Welsch q-Norm
inferred← citeshttps://doi.org/10.1109/tpami.2016.2631531openalex-snapshot
Efficient Globally Optimal Consensus Maximisation with Tree Search
inferred← citeshttps://doi.org/10.1109/tpami.2017.2663859openalex-snapshot
Guest Editorial: Best of CVPR 2015
inferred← citeshttps://doi.org/10.1137/060669474openalex-snapshot
On Approximating the Depth and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539700370084openalex-snapshot
Setting Parameters by Example
inferred← citeshttps://doi.org/10.1137/s0097539703427963openalex-snapshot
Shape Fitting with Outliers
inferred← citeshttps://doi.org/10.1137/s0097539703439404openalex-snapshot
Low-Dimensional Linear Programming with Violations
inferred← citeshttps://doi.org/10.1137/s0097539795295936openalex-snapshot
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
inferred← citeshttps://doi.org/10.1142/s0218195902000840openalex-snapshot
COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND
inferred← citeshttps://doi.org/10.1142/s0218195915500156openalex-snapshot
Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points
inferred← citeshttps://doi.org/10.1145/1007352.1007436openalex-snapshot
Lower bounds for linear degeneracy testing
inferred← citeshttps://doi.org/10.1145/1059513.1059515openalex-snapshot
Lower bounds for linear degeneracy testing
inferred← citeshttps://doi.org/10.1145/1247069.1247129openalex-snapshot
On approximate range counting and depth
inferred← citeshttps://doi.org/10.1145/1706591.1706596openalex-snapshot
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
inferred← citeshttps://doi.org/10.1145/220279.220281openalex-snapshot
Output-sensitive results on convex hulls, extreme points, and related problems
inferred← citeshttps://doi.org/10.1145/220279.220284openalex-snapshot
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
inferred← citeshttps://doi.org/10.1145/237218.237397openalex-snapshot
Fixed-dimensional linear programming queries made easy
inferred← citeshttps://doi.org/10.1145/2582112.2582121openalex-snapshot
Sampling with Removal in LP-type Problems
inferred← citeshttps://doi.org/10.1145/276884.276915openalex-snapshot
Geometric applications of a randomized optimization technique
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/336154.336186openalex-snapshot
Random sampling in geometric optimization
inferred← citeshttps://doi.org/10.1145/363647.363652openalex-snapshot
Dynamic planar convex hull operations in near-logarithmic amortized time
inferred← citeshttps://doi.org/10.1145/997817.997859openalex-snapshot
On the least median square problem
inferred← citeshttps://doi.org/10.20382/jocg.v3i1a4openalex-snapshot
Weighted geometric set cover problems revisited
inferred← citeshttps://doi.org/10.2200/s00757ed1v01y201702cov011openalex-snapshot
The Maximum Consensus Problem: Recent Algorithmic Advances
inferred← citeshttps://doi.org/10.22215/etd/2009-06397openalex-snapshot
A ubiquitous GIS: framework, services and algorithms, development
inferred← citeshttps://doi.org/10.22215/etd/2023-15445openalex-snapshot
Constrained Geometric Optimization Problems
inferred← citeshttps://doi.org/10.3182/20050703-6-cz-1902.00418openalex-snapshot
NEW RESULTS ON THE IDENTIFICATION OF INTERVAL PREDICTOR MODELS
inferred← citeshttps://doi.org/10.4236/ajcm.2014.43016openalex-snapshot
Variations of Enclosing Problem Using Axis Parallel Square(s): A General Approach
inferred← citeshttps://doi.org/10.48550/arxiv.1609.07709openalex-snapshot
Depth contours in arrangements of halfplanes
inferred← citeshttps://doi.org/10.5555/1070432.1070556openalex-snapshot
On approximating the depth and related problems
inferred← citeshttps://doi.org/10.5555/1109557.1109579openalex-snapshot
Robust shape fitting via peeling and grating coresets
inferred← citeshttps://doi.org/10.5555/1109557.1109689openalex-snapshot
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
inferred← citeshttps://doi.org/10.5555/982792.982853openalex-snapshot
An optimal randomized algorithm for maximum Tukey depth
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.