On the public citation graph
Approximating the Distortion
0 signed · 32 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/jcss.1999.1682openalex-snapshot
Approximating the Bandwidth via Volume Respecting Embeddings
inferredcites →https://doi.org/10.1007/3-540-68530-8_39openalex-snapshot
Fitting Points on the Real Line and Its Application to RH Mapping
inferredcites →https://doi.org/10.1007/978-1-4613-0039-7openalex-snapshot
Lectures on Discrete Geometry
inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1007/bf02776078openalex-snapshot
On lipschitz embedding of finite metric spaces in Hilbert space
inferredcites →https://doi.org/10.1016/s0166-218x(02)00282-2openalex-snapshot
Point matching under non-uniform distortions
inferredcites →https://doi.org/10.1016/s0196-6774(03)00083-xopenalex-snapshot
Fitting points on the real line and its application to RH mapping
inferredcites →https://doi.org/10.1109/focs.2004.70openalex-snapshot
Triangulation and Embedding Using Small Sets of Beacons
inferredcites →https://doi.org/10.1109/sfcs.2001.959878openalex-snapshot
Algorithmic applications of low-distortion geometric embeddings
inferredcites →https://doi.org/10.1145/1007352.1007398openalex-snapshot
Low distortion maps between point sets
inferredcites →https://doi.org/10.5555/1070432.1070448openalex-snapshot
The complexity of low-distortion embeddings between point sets
inferredcites →https://doi.org/10.5555/1070432.1070522openalex-snapshot
Distributed approaches to triangulation and embedding
inferredcites →https://doi.org/10.5555/644108.644178openalex-snapshot
Approximation algorithm for embedding metrics into a two-dimensional space
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_5openalex-snapshot
Pattern Matching in Doubling Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_39openalex-snapshot
Distortion Is Fixed Parameter Tractable
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_45openalex-snapshot
Computing the Gromov-Hausdorff Distance for Metric Trees
inferred← citeshttps://doi.org/10.1090/s0002-9947-2010-05186-4openalex-snapshot
Inapproximability for metric embeddings into $\mathbb{R}^{d}$
inferred← citeshttps://doi.org/10.1109/focs.2008.21openalex-snapshot
Inapproximability for Metric Embeddings into R^d
inferred← citeshttps://doi.org/10.1109/focs.2015.50openalex-snapshot
Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line
inferred← citeshttps://doi.org/10.1137/1.9781611973075.20openalex-snapshot
Inapproximability for planar embedding problems
inferred← citeshttps://doi.org/10.1145/1007352.1007398openalex-snapshot
Low distortion maps between point sets
inferred← citeshttps://doi.org/10.1145/1377676.1377683openalex-snapshot
Circular partitions with applications to visualization and embeddings
inferred← citeshttps://doi.org/10.1145/1383369.1383376openalex-snapshot
Improved algorithms for optimal embeddings
inferred← citeshttps://doi.org/10.1145/2489789openalex-snapshot
Distortion is Fixed Parameter Tractable
inferred← citeshttps://doi.org/10.1145/3185466openalex-snapshot
Computing the Gromov-Hausdorff Distance for Metric Trees
inferred← citeshttps://doi.org/10.14288/1.0052053openalex-snapshot
D-width, metric embedding, and their connections
inferred← citeshttps://doi.org/10.4230/lipics.socg.2018.21openalex-snapshot
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces
inferred← citeshttps://doi.org/10.48550/arxiv.0804.3028openalex-snapshot
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees
inferred← citeshttps://doi.org/10.48550/arxiv.1509.05751openalex-snapshot
Computing the Gromov-Hausdorff Distance for Metric Trees
inferred← citeshttps://doi.org/10.5555/1283383.1283438openalex-snapshot
Approximation algorithms for embedding general metrics into trees
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.