On the public citation graph
Distortion is Fixed Parameter Tractable
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.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_39openalex-snapshot
Distortion Is Fixed Parameter Tractable
inferredcites →https://doi.org/10.1007/978-3-662-60670-4_3openalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/s00493-004-0015-xopenalex-snapshot
Cuts, Trees and ℓ1-Embeddings of Graphs*
inferredcites →https://doi.org/10.1016/s0304-3975(98)00342-9openalex-snapshot
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.003.0004openalex-snapshot
VERTEX COVER—AN ILLUSTRATIVE EXAMPLE
inferredcites →https://doi.org/10.1109/sfcs.2001.959878openalex-snapshot
Algorithmic applications of low-distortion geometric embeddings
inferredcites →https://doi.org/10.1137/0601042openalex-snapshot
Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
inferredcites →https://doi.org/10.1137/080712921openalex-snapshot
Low Distortion Maps Between Point Sets
inferredcites →https://doi.org/10.1137/1.9780898715583openalex-snapshot
Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1.9780898716474openalex-snapshot
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1142/4962openalex-snapshot
Proceedings of the International Congress of Mathematicians 2002
inferredcites →https://doi.org/10.1145/1007352.1007398openalex-snapshot
Low distortion maps between point sets
inferredcites →https://doi.org/10.1145/1060590.1060624openalex-snapshot
Low-distortion embeddings of general metrics into the line
inferredcites →https://doi.org/10.1145/195058.195229openalex-snapshot
Beyond NP-completeness for problems of bounded width (extended abstract)
inferredcites →https://doi.org/10.5555/1283383.1283438openalex-snapshot
Approximation algorithms for embedding general metrics into trees
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-04693-4_14openalex-snapshot
Probabilistic Embeddings of the Fréchet Distance
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_14openalex-snapshot
Line-Distortion, Bandwidth and Path-Length of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_20openalex-snapshot
What’s Next? Future Directions in Parameterized Complexity
inferred← citeshttps://doi.org/10.1007/s00453-015-0094-7openalex-snapshot
Line-Distortion, Bandwidth and Path-Length of a Graph
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.060openalex-snapshot
Decomposing a graph into shortest paths with bounded eccentricity
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.9781611973082.60openalex-snapshot
Slightly Superexponential Parameterized Problems
inferred← citeshttps://doi.org/10.1137/16m1104834openalex-snapshot
Slightly Superexponential Parameterized Problems
inferred← citeshttps://doi.org/10.1137/17m1113527openalex-snapshot
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces
inferred← citeshttps://doi.org/10.1145/3051094openalex-snapshot
Tight Lower Bounds on Graph Embedding Problems
inferred← citeshttps://doi.org/10.1145/3369933openalex-snapshot
FPT Algorithms for Embedding into Low-Complexity Graphic Metrics
inferred← citeshttps://doi.org/10.48550/arxiv.1409.8389openalex-snapshot
Line-distortion, Bandwidth and Path-length of a graph
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.