On the public citation graph
Helly-type theorems and Generalized Linear Programming
0 signed · 95 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.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/978-3-642-58043-7_8openalex-snapshot
Geometric Transversal Theory
inferredcites →https://doi.org/10.1007/bf02187722openalex-snapshot
Proof of grünbaum's conjecture on common transversals for translates
inferredcites →https://doi.org/10.1016/0024-3795(89)90004-9openalex-snapshot
Systems of linear interval equations
inferredcites →https://doi.org/10.1016/0166-218x(90)90127-xopenalex-snapshot
Algorithms for high dimensional stabbing problems
inferredcites →https://doi.org/10.1090/pspum/007/0157289openalex-snapshot
Helly’s theorem and its relatives
inferredcites →https://doi.org/10.1090/s0002-9939-1961-0159262-6openalex-snapshot
On Components in Some Families of Sets
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.1111/j.1749-6632.1979.tb32803.xopenalex-snapshot
BINDING CONSTRAINTS AND HELLY NUMBERS
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/0215052openalex-snapshot
On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
inferredcites →https://doi.org/10.1137/0613003openalex-snapshot
The Componentwise Distance to the Nearest Singular Matrix
inferredcites →https://doi.org/10.1142/s0218195995000222openalex-snapshot
COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
inferredcites →https://doi.org/10.1145/109648.109668openalex-snapshot
Extremal polygon containment 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.142681openalex-snapshot
A class of convex programs with applications to computational geometry
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/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/73833.73873openalex-snapshot
Stabbing pairwise disjoint translates in linear time
inferredcites →https://doi.org/10.1145/98524.98570openalex-snapshot
Linear programming and convex hulls made easy
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0849openalex-snapshot
Choosing Subsets with Maximum Weighted Average
inferred← citeshttps://doi.org/10.1006/jagm.1998.0984openalex-snapshot
Optimal Point Placement for Mesh Smoothing
inferred← citeshttps://doi.org/10.1007/11841036_36openalex-snapshot
Violator Spaces: Structure and Algorithms
inferred← citeshttps://doi.org/10.1007/11944836_37openalex-snapshot
Validity Checking for Finite Automata over Linear Arithmetic Constraints
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_3openalex-snapshot
Optimal Möbius Transformations for Information Visualization and Meshing
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_54openalex-snapshot
Linear programming — Randomization and abstract frameworks
inferred← citeshttps://doi.org/10.1007/978-1-4419-0999-2_3openalex-snapshot
Some Discrete Properties of the Space of Line Transversals to Disjoint Balls
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-319-44479-6_17openalex-snapshot
Bounding Helly Numbers via Betti Numbers
inferred← citeshttps://doi.org/10.1007/978-3-319-54427-4_12openalex-snapshot
An Efficient Meta-Algorithm for Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-319-66272-5_24openalex-snapshot
Reconstructions of Noisy Digital Contours with Maximal Primitives Based on Multi-scale/Irregular Geometric Representation and Generalized Linear Programming
inferred← citeshttps://doi.org/10.1007/bf01940877openalex-snapshot
A subexponential bound for linear programming
inferred← citeshttps://doi.org/10.1007/bf02570713openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1007/bfb0015247openalex-snapshot
Algorithmic techniques for geometric optimization
inferred← citeshttps://doi.org/10.1007/bfb0038202openalex-snapshot
Smallest enclosing disks (balls and ellipsoids)
inferred← citeshttps://doi.org/10.1007/pl00009427openalex-snapshot
Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00453-007-0175-3openalex-snapshot
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems
inferred← citeshttps://doi.org/10.1007/s00453-008-9210-2openalex-snapshot
On the Planar Piecewise Quadratic 1-Center Problem
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-001-0016-0openalex-snapshot
A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets
inferred← citeshttps://doi.org/10.1007/s00454-007-9028-8openalex-snapshot
Discrete and Lexicographic Helly-Type Theorems
inferred← citeshttps://doi.org/10.1007/s00454-009-9167-1openalex-snapshot
Helly-Type Theorems for Approximate Covering
inferred← citeshttps://doi.org/10.1007/s00454-020-00193-0openalex-snapshot
Random Sampling with Removal
inferred← citeshttps://doi.org/10.1007/s00493-015-3266-9openalex-snapshot
A quantitative Doignon-Bell-Scarf theorem
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00018-6openalex-snapshot
Average case analysis of dynamic geometric optimization
inferred← citeshttps://doi.org/10.1016/j.aim.2013.11.004openalex-snapshot
Helly numbers of acyclic families
inferred← citeshttps://doi.org/10.1016/j.cad.2010.12.007openalex-snapshot
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
inferred← citeshttps://doi.org/10.1016/j.dam.2007.08.048openalex-snapshot
Violator spaces: Structure and algorithms
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.ifacol.2020.12.317openalex-snapshot
A Sequential Algorithm for Sampled Mixed-integer Optimization Problems
inferred← citeshttps://doi.org/10.1016/j.ins.2023.03.061openalex-snapshot
A sequential deep learning algorithm for sampled mixed-integer optimisation problems
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.01.001openalex-snapshot
Random sampling in computational algebra: Helly numbers and violator spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113690openalex-snapshot
Distance problems within Helly graphs and k-Helly graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00379-xopenalex-snapshot
Helly-type theorems for polygonal curves
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00019-3openalex-snapshot
Approximation of convex figures by pairs of rectangles
inferred← citeshttps://doi.org/10.1080/16864360.2005.10738378openalex-snapshot
Computing the Minimum Enclosing Circle of a Set of Planar Curves
inferred← citeshttps://doi.org/10.1090/conm/685/13718openalex-snapshot
Helly’s theorem: New variations and applications
inferred← citeshttps://doi.org/10.1090/s0002-9939-02-06722-9openalex-snapshot
Helly-type theorems for homothets of planar convex curves
inferred← citeshttps://doi.org/10.1093/imrn/rnae056openalex-snapshot
Bounding Radon Numbers via Betti Numbers
inferred← citeshttps://doi.org/10.1109/cdc.2008.4739337openalex-snapshot
Distributed minimum time servicing for a team of Dubins vehicles
inferred← citeshttps://doi.org/10.1109/focs.2004.47openalex-snapshot
On the Power of Discrete and of Lexicographic Helly-Type Theorems
inferred← citeshttps://doi.org/10.1109/tcns.2020.3024483openalex-snapshot
Randomized Constraints Consensus for Distributed Robust Mixed-Integer Programming
inferred← citeshttps://doi.org/10.1109/tpami.2017.2750672openalex-snapshot
Coresets for Triangulation
inferred← citeshttps://doi.org/10.1137/060656309openalex-snapshot
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
inferred← citeshttps://doi.org/10.1142/s0218195998000047openalex-snapshot
An Output-Sensitive Convex Hull Algorithm for Planar Objects
inferred← citeshttps://doi.org/10.1145/1064092.1064097openalex-snapshot
Hadwiger and Helly-type theorems for disjoint unit spheres in R 3
inferred← citeshttps://doi.org/10.1145/1198513.1198515openalex-snapshot
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
inferred← citeshttps://doi.org/10.1145/1377676.1377696openalex-snapshot
Helly-type theorems for approximate covering
inferred← citeshttps://doi.org/10.1145/142675.142678openalex-snapshot
A subexponential bound for linear programming
inferred← citeshttps://doi.org/10.1145/177424.178039openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1145/1998196.1998272openalex-snapshot
No dimension independent core-sets for containment under homothetics
inferred← citeshttps://doi.org/10.1145/2261250.2261282openalex-snapshot
Multinerves and helly numbers of acyclic families
inferred← citeshttps://doi.org/10.1145/237218.237255openalex-snapshot
Rectilinear and polygonal p -piercing and p -center problems
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/3186990openalex-snapshot
Faster Algorithms for Computing Plurality Points
inferred← citeshttps://doi.org/10.1145/336154.336178openalex-snapshot
A Helly-type theorem for hyperplane transversals to well-separated convex sets
inferred← citeshttps://doi.org/10.1561/2600000020openalex-snapshot
Distributed Optimization for Smart Cyber-Physical Networks
inferred← citeshttps://doi.org/10.3929/ethz-a-005084315openalex-snapshot
Smallest enclosing balls of balls: Combinatorial structure & algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.0906.2924openalex-snapshot
Lower Bounds for Pinning Lines by Balls
inferred← citeshttps://doi.org/10.48550/arxiv.1405.2480openalex-snapshot
A Quantitative Doignon-Bell-Scarf Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0101006openalex-snapshot
Optimal Moebius Transformations for Information Visualization and Meshing
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0304018openalex-snapshot
Quasiconvex Analysis of Backtracking Algorithms
inferred← citeshttps://doi.org/10.5282/edoc.13294openalex-snapshot
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
inferred← citeshttps://doi.org/10.5555/314161.314383openalex-snapshot
Optimal point placement for mesh smoothing
inferred← citeshttps://doi.org/10.68381/jca25012openalex-snapshot
Chance-Constrained Convex Mixed-Integer Optimization and Beyond: Two Sampling Algorithms within S-optimization
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.