On the public citation graph
Using geometry to solve the transportation problem in the plane
0 signed · 23 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/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02574686openalex-snapshot
On the construction of abstract voronoi diagrams
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1137/0206043openalex-snapshot
Location of a Point in a Planar Subdivision and Its Applications
inferredcites →https://doi.org/10.1137/0214034openalex-snapshot
Intersection and Closest-Pair Problems for a Set of Planar Discs
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0218069openalex-snapshot
Faster Scaling Algorithms for Network Problems
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11561071_47openalex-snapshot
Matching Point Sets with Respect to the Earth Mover’s Distance
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_5openalex-snapshot
Geometric Optimization Revisited
inferred← citeshttps://doi.org/10.1007/s11263-006-6993-yopenalex-snapshot
Object Recognition as Many-to-Many Feature Matching
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.10.001openalex-snapshot
Matching point sets with respect to the Earth Mover's Distance
inferred← citeshttps://doi.org/10.1023/a:1008389726910openalex-snapshot
Computing the Kantorovich Distance for Images
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.1145/220279.220284openalex-snapshot
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
inferred← citeshttps://doi.org/10.1145/2582112.2582163openalex-snapshot
Optimal Geometric Flows via Dual Programs
inferred← citeshttps://doi.org/10.1145/997817.997856openalex-snapshot
A near-linear constant-factor approximation for euclidean bipartite matching?
inferred← citeshttps://doi.org/10.17918/etd-656openalex-snapshot
Many-to-many feature matching for structural pattern recognition
inferred← citeshttps://doi.org/10.48550/arxiv.0908.1649openalex-snapshot
Improving the primal-dual algorithm for the transportation problem in the plane
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.