On the public citation graph
A Large Subgraph of the Minimum Weight Triangulation
0 signed · 34 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-51859-2_15openalex-snapshot
Which triangulations approximate the complete graph?
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.1016/0925-7721(94)90014-0openalex-snapshot
Computing a subgraph of the minimum weight triangulation
inferredcites →https://doi.org/10.1016/s0167-5060(08)70044-xopenalex-snapshot
Minimal Triangulations of Polygonal Domains
inferredcites →https://doi.org/10.1016/s0925-7721(97)89149-3openalex-snapshot
Fast greedy triangulation algorithms
inferredcites →https://doi.org/10.1137/0214017openalex-snapshot
Arboricity and Subgraph Listing Algorithms
inferredcites →https://doi.org/10.1142/9789812831699_0003openalex-snapshot
MESH GENERATION AND OPTIMAL 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.14711/thesis-b500031openalex-snapshot
Expected case analysis of ²-skeletons with applications to the construction of minimum-weight triangulations
inferredcites →https://doi.org/10.1515/9780773591134-014openalex-snapshot
Diamonds are not a Minimum Weight Triangulation’s Best Friend
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-319-62395-5_31openalex-snapshot
Nearest Neighbour Graph and Locally Minimal Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_55openalex-snapshot
Selected Open Problems in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-662-58039-4_7openalex-snapshot
Neighbourhood Graphs and Locally Minimal Triangulations
inferred← citeshttps://doi.org/10.1007/s10898-009-9409-zopenalex-snapshot
A new asymmetric inclusion region for minimum weight triangulation
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00236-5openalex-snapshot
On exclusion regions for optimal triangulations
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00383-2openalex-snapshot
The drawability problem for minimum weight triangulations
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.1109/iccsa.2010.38openalex-snapshot
An Ant Colony Algorithm for the Minimum Weight Triangulation
inferred← citeshttps://doi.org/10.1137/1.9781611973099.65openalex-snapshot
On a Linear Program for Minimum-Weight Triangulation: Extended Abstract
inferred← citeshttps://doi.org/10.1137/120887928openalex-snapshot
On a Linear Program for Minimum-Weight Triangulation
inferred← citeshttps://doi.org/10.1145/1137856.1137859openalex-snapshot
Minimum weight triangulation is NP-hard
inferred← citeshttps://doi.org/10.1145/1346330.1346336openalex-snapshot
Minimum-weight triangulation is NP-hard
inferred← citeshttps://doi.org/10.1145/1516512.1516517openalex-snapshot
A quasi-polynomial time approximation scheme for minimum weight triangulation
inferred← citeshttps://doi.org/10.1145/276884.276895openalex-snapshot
Implementations of the LMT heuristic for minimum weight triangulation
inferred← citeshttps://doi.org/10.21533/scjournalopenalex-snapshot
Southeast Europe Journal of Soft Computing
inferred← citeshttps://doi.org/10.21533/scjournal.v3i2.3openalex-snapshot
Finding optimal triangulation based on block method
inferred← citeshttps://doi.org/10.5555/2095116.2095181openalex-snapshot
On a linear program 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.