On the public citation graph

A study of the LMT-skeleton

https://doi.org/10.1007/bfb0009502
0 signed · 24 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-58325-4_207openalex-snapshot
A chain decomposition algorithm for the proof of a property on minimum weight triangulations
inferredcites →https://doi.org/10.1007/3-540-61422-2_140openalex-snapshot
A fast heuristic for approximating the minimum weight triangulation
inferredcites →https://doi.org/10.1007/bf01188718openalex-snapshot
New results for the minimum weight triangulation problem
inferredcites →https://doi.org/10.1007/bf01840359openalex-snapshot
Geometric applications of a matrix-searching algorithm
inferredcites →https://doi.org/10.1007/bf02712872openalex-snapshot
Triangulations intersect nicely
inferredcites →https://doi.org/10.1016/0925-7721(94)90014-0openalex-snapshot
Computing a subgraph of the minimum weight triangulation
inferredcites →https://doi.org/10.1145/220279.220303openalex-snapshot
Triangulations intersect nicely
inferredcites →https://doi.org/10.1145/237218.237360openalex-snapshot
Approaching the largest β-skeleton within a minimum weight triangulation
inferredcites →https://doi.org/10.1145/237218.237364openalex-snapshot
A (usually?) connected subgraph of the minimum weight triangulation
inferredcites →https://doi.org/10.1145/237218.237425openalex-snapshot
On computing edges that are in all minimum-weight triangulations
inferredcites →https://doi.org/10.1515/9780773591134-014openalex-snapshot
Diamonds are not a Minimum Weight Triangulation’s Best Friend
inferredcites →https://doi.org/10.5555/313852.314071openalex-snapshot
Limit theorems for minimum-weight triangulations, other Euclidean functionals, and probabilistic recurrence relations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-306-48332-7_360openalex-snapshot
Optimal Triangulations
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_41openalex-snapshot
A branch-and-cut approach for minimum weight triangulation
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_5openalex-snapshot
On Computing New Classes of Optimal Triangulations with Angular Constraints
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_475openalex-snapshot
Optimal Triangulations
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_22openalex-snapshot
Minimum Weight Triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.11.006openalex-snapshot
The minimum weight triangulation problem with few inner points
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00018-6openalex-snapshot
New results on MWT subgraphs
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00016-xopenalex-snapshot
LMT-skeleton heuristics for several new classes of optimal triangulations☆☆This research is supported by the Grant-in-Aid of Ministry of Education, Science, Sports and Culture, of Japan, Grant-in-Aid for Scientific Research(C), 08680377, 1997, and Grant-in-Aid for Scientific Research(B), 10205214,…
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00008-6openalex-snapshot
A lower bound for β-skeleton belonging to minimum weight triangulations☆☆This work is partially supported by NSERC grant OPG0041629.
inferred← citeshttps://doi.org/10.1142/s0218195908002581openalex-snapshot
FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
inferred← citeshttps://doi.org/10.1145/1346330.1346336openalex-snapshot
Minimum-weight triangulation is NP-hard
inferred← citeshttps://doi.org/10.1145/276884.276895openalex-snapshot
Implementations of the LMT heuristic for minimum weight triangulation
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.