On the public citation graph
Metrics with finite sets of primitive extensions
0 signed · 38 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/eujc.1996.0019openalex-snapshot
Minimum (2,r)-Metrics and Integer Multiflows
inferredcites →https://doi.org/10.1006/eujc.1997.0154openalex-snapshot
Minimum 0-Extensions of Graph Metrics
inferredcites →https://doi.org/10.1007/bf01902503openalex-snapshot
On some connectivity properties of Eulerian graphs
inferredcites →https://doi.org/10.1007/bf02566944openalex-snapshot
Six theorems about injective metric spaces
inferredcites →https://doi.org/10.1016/0001-8708(84)90029-xopenalex-snapshot
Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
inferredcites →https://doi.org/10.1016/0012-365x(95)00217-kopenalex-snapshot
A Helly theorem in weakly modular space
inferredcites →https://doi.org/10.1016/0377-2217(85)90004-9openalex-snapshot
Networks with condorcet solutions
inferredcites →https://doi.org/10.1016/s0166-218x(87)80002-1openalex-snapshot
Half-integral five-terminus flows
inferredcites →https://doi.org/10.1137/s0097539792225297openalex-snapshot
The Complexity of Multiterminal Cuts
inferredcites →https://doi.org/10.4153/cjm-1980-010-0openalex-snapshot
On the Extreme Rays of the Metric Cone
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/aama.1999.0677openalex-snapshot
Graphs of Some CAT(0) Complexes
inferred← citeshttps://doi.org/10.1006/aima.2001.2039openalex-snapshot
An Explicit Computation of the Injective Hull of Certain Finite Metric Spaces in Terms of their Associated Buneman Complex
inferred← citeshttps://doi.org/10.1006/eujc.1999.0378openalex-snapshot
A Characterization of Minimizable Metrics in the Multifacility Location Problem
inferred← citeshttps://doi.org/10.1006/eujc.1999.0387openalex-snapshot
Problems on Discrete Metric Spaces
inferred← citeshttps://doi.org/10.1007/pl00001294openalex-snapshot
Totally Split-Decomposable Metrics of Combinatorial Dimension Two
inferred← citeshttps://doi.org/10.1007/s00026-012-0146-5openalex-snapshot
On Tight Spans for Directed Distances
inferred← citeshttps://doi.org/10.1007/s10107-011-0506-7openalex-snapshot
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
inferred← citeshttps://doi.org/10.1007/s10107-014-0824-7openalex-snapshot
Discrete convexity and polynomial solvability in minimum 0-extension problems
inferred← citeshttps://doi.org/10.1016/j.dam.2003.05.005openalex-snapshot
Hard cases of the multifacility location problem
inferred← citeshttps://doi.org/10.1016/j.disc.2015.02.008openalex-snapshot
Optimal realizations of two-dimensional, totally-decomposable metrics
inferred← citeshttps://doi.org/10.1016/j.disopt.2004.04.001openalex-snapshot
One more well-solved case of the multifacility location problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2011.03.001openalex-snapshot
On duality and fractionality of multicommodity flows in directed networks
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100642openalex-snapshot
Minimum 0-extension problems on directed metrics
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.03.001openalex-snapshot
Tight spans of distances and the dual fractionality of undirected multiflow problems
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.02.001openalex-snapshot
Bounded fractionality of the multiflow feasibility problem for demand graph K3+K3 and related maximization problems
inferred← citeshttps://doi.org/10.1090/memo/1309openalex-snapshot
Weakly Modular Graphs and Nonpositive Curvature
inferred← citeshttps://doi.org/10.1137/090767054openalex-snapshot
Folder Complexes and Multiflow Combinatorial Dualities
inferred← citeshttps://doi.org/10.1137/1.9781611973105.127openalex-snapshot
Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems: [Extended Abstract]
inferred← citeshttps://doi.org/10.1145/1806689.1806707openalex-snapshot
The maximum multiflow problems with bounded fractionality
inferred← citeshttps://doi.org/10.1287/moor.2013.0600openalex-snapshot
The Maximum Multiflow Problems with Bounded Fractionality
inferred← citeshttps://doi.org/10.20382/jocg.v2i1a8openalex-snapshot
Optimally fast incremental Manhattan plane embedding and planar tight span construction
inferred← citeshttps://doi.org/10.20382/v2i1a8openalex-snapshot
Optimally fast incremental Manhattan plane embedding and planar tight span construction
inferred← citeshttps://doi.org/10.37236/882openalex-snapshot
Characterizing Cell-Decomposable Metrics
inferred← citeshttps://doi.org/10.48550/arxiv.1409.3892openalex-snapshot
Weakly modular graphs and nonpositive curvature
inferred← citeshttps://doi.org/10.48550/arxiv.math/0004090openalex-snapshot
How to Uncross Some Modular Metrics
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.