On the public citation graph
On the ball spanned by balls
0 signed · 60 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.1007/bf02187751openalex-snapshot
Computing the geodesic center of a simple polygon
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/0167-6377(82)90009-8openalex-snapshot
The weighted euclidean 1-center problem
inferredcites →https://doi.org/10.1016/0196-6774(86)90027-1openalex-snapshot
An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
inferredcites →https://doi.org/10.1109/focs.2004.4openalex-snapshot
Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science
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/0213003openalex-snapshot
Linear Time Algorithms for Two- and Three-Variable Linear Programs
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.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/7531.7537openalex-snapshot
Slowing down sorting networks to obtain faster sorting algorithms
inferredcites →https://doi.org/10.1287/moor.8.4.498openalex-snapshot
The Weighted Euclidean 1-Center Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_7openalex-snapshot
Computing the furthest site voronoi diagram for a set of discs
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-79987-8_12openalex-snapshot
Covering Convex Polygons by Two Congruent Disks
inferred← citeshttps://doi.org/10.1007/978-3-031-08751-6_52openalex-snapshot
Simple and Efficient Acceleration of the Smallest Enclosing Ball for Large Data Sets in $$E^2$$: Analysis and Comparative Results
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_16openalex-snapshot
Approximating Smallest Enclosing Balls
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_39openalex-snapshot
Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
inferred← citeshttps://doi.org/10.1007/978-3-642-21931-3_4openalex-snapshot
Non-uniform Geometric Matchings
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_7openalex-snapshot
Covering and Piercing Disks with Two Centers
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_27openalex-snapshot
The 2-Center Problem in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/bf02187751openalex-snapshot
Computing the geodesic center of a simple polygon
inferred← citeshttps://doi.org/10.1007/bf02574379openalex-snapshot
Helly-type theorems and Generalized Linear Programming
inferred← citeshttps://doi.org/10.1007/bfb0015247openalex-snapshot
Algorithmic techniques for geometric optimization
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-016-9796-0openalex-snapshot
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00454-025-00768-9openalex-snapshot
The Geodesic Edge Center of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s10589-021-00283-6openalex-snapshot
A dual simplex-type algorithm for the smallest enclosing ball of balls
inferred← citeshttps://doi.org/10.1016/j.amc.2019.124626openalex-snapshot
QuickhullDisk: A faster convex hull algorithm for disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.03.007openalex-snapshot
Largest bounding box, smallest diameter, and related problems on imprecise points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.09.002openalex-snapshot
Covering and piercing disks with two centers
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.02.008openalex-snapshot
The geodesic 2-center problem in a simple polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.10.007openalex-snapshot
Assigning weights to minimize the covering radius in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101936openalex-snapshot
Covering convex polygons by two congruent disks
inferred← citeshttps://doi.org/10.1016/j.cor.2012.10.005openalex-snapshot
Minimizing ordered weighted averaging of rational functions with applications to continuous location
inferred← citeshttps://doi.org/10.1016/j.disopt.2004.12.001openalex-snapshot
Facility location problems with uncertainty on the plane
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.08.001openalex-snapshot
Prune-and-search with limited workspace
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00102-3openalex-snapshot
Fuzzy versions of the covering circle problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00430-2openalex-snapshot
Fuzzy disk for covering fuzzy points
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00006-6openalex-snapshot
Recognizing weakly convex visible polygons
inferred← citeshttps://doi.org/10.1103/physreva.81.062304openalex-snapshot
Qubit state discrimination
inferred← citeshttps://doi.org/10.1142/s0218195904001500openalex-snapshot
THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
inferred← citeshttps://doi.org/10.1142/s0218195909003039openalex-snapshot
APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
inferred← citeshttps://doi.org/10.1142/s0218195911003536openalex-snapshot
ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
inferred← citeshttps://doi.org/10.1145/142675.142681openalex-snapshot
A class of convex programs with applications to computational geometry
inferred← citeshttps://doi.org/10.1145/160985.161000openalex-snapshot
Helly theorems and generalized linear programming
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/777792.777836openalex-snapshot
The smallest enclosing ball of balls
inferred← citeshttps://doi.org/10.1287/ijoc.1080.0315openalex-snapshot
An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem
inferred← citeshttps://doi.org/10.17169/refubium-8271openalex-snapshot
Stabbing and Covering Geometric Objects in the Plane
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/2016-11514openalex-snapshot
On Proximity Problems In Euclidean Spaces
inferred← citeshttps://doi.org/10.3929/ethz-a-005084315openalex-snapshot
Smallest enclosing balls of balls: Combinatorial structure & algorithms
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.65openalex-snapshot
The Visibility Center of a Simple Polygon
inferred← citeshttps://doi.org/10.48550/arxiv.1201.1198openalex-snapshot
Covering and Piercing Disks with Two Centers
inferred← citeshttps://doi.org/10.48550/arxiv.1501.00561openalex-snapshot
A linear-time algorithm for the geodesic center of a simple polygon
inferred← citeshttps://doi.org/10.48550/arxiv.1812.01236openalex-snapshot
A dual Simplex-type algorithm for the smallest enclosing ball of balls and related problems
inferred← citeshttps://doi.org/10.48550/arxiv.1908.11260openalex-snapshot
A Time-space Trade-off for Computing the Geodesic Center of a Simple Polygon
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.