On the public citation graph

Triangulations intersect nicely

0 signed · 54 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-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.1007/978-1-4612-9967-7openalex-snapshot

Graph Theory: An Introductory Course

inferredcites →https://doi.org/10.1007/bfb0030818openalex-snapshot

Constrained independence system and triangulations of planar point sets

inferredcites →https://doi.org/10.1016/0012-365x(73)90064-2openalex-snapshot

Some properties of basic families of subsets

inferredcites →https://doi.org/10.1016/0020-0190(89)90122-1openalex-snapshot

A space efficient greedy triangulation algorithm

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.1017/s000497270004140xopenalex-snapshot

Comments on bases in dependence structures

inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot

Lecture Notes in Computer Science 1205

inferredcites →https://doi.org/10.1137/0202019openalex-snapshot

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot

Data Structures and Network Algorithms

inferredcites →https://doi.org/10.1142/s0218195992000147openalex-snapshot

SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS

inferredcites →https://doi.org/10.1145/177424.177649openalex-snapshot

Fast greedy triangulation algorithms

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.237367openalex-snapshot

Flipping edges in triangulations

inferredcites →https://doi.org/10.2307/2345191openalex-snapshot

Display and Analysis of Spatial Data.

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-40996-3_5openalex-snapshot

Online Routing in Convex Subdivisions

inferred← citeshttps://doi.org/10.1007/3-540-44541-2_32openalex-snapshot

Minimum Weight Drawings of Maximal Triangulations

inferred← citeshttps://doi.org/10.1007/3-540-63938-1_45openalex-snapshot

Drawable and forbidden minimum weight triangulations

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.1007/978-3-030-61792-9_18openalex-snapshot

Flips in Higher Order Delaunay Triangulations

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/bfb0009502openalex-snapshot

A study of the LMT-skeleton

inferred← citeshttps://doi.org/10.1007/bfb0009503openalex-snapshot

A new subgraph of minimum weight triangulations

inferred← citeshttps://doi.org/10.1007/bfb0021821openalex-snapshot

How to draw outerplanar minimum weight triangulations

inferred← citeshttps://doi.org/10.1007/bfb0030818openalex-snapshot

Constrained independence system and triangulations of planar point sets

inferred← citeshttps://doi.org/10.1007/pl00009320openalex-snapshot

A Large Subgraph of the Minimum Weight Triangulation

inferred← citeshttps://doi.org/10.1016/0020-0190(96)00012-9openalex-snapshot

Drawing outerplanar minimum weight triangulations

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot

Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot

Spanning Trees and Spanners

inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.07.002openalex-snapshot

Matching edges and faces in polygonal partitions

inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.039openalex-snapshot

Number of Crossing-Free Geometric Graphs vs. Triangulations

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00318-2openalex-snapshot

On β-skeleton as a subgraph of the minimum weight triangulation

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(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.1023/a:1008348111045openalex-snapshot

inferred← citeshttps://doi.org/10.1023/a:1009776619164openalex-snapshot

Constant-level greedy triangulations approximate the MWT well

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.1142/s021819590200089xopenalex-snapshot

ONLINE ROUTING IN CONVEX SUBDIVISIONS

inferred← citeshttps://doi.org/10.1145/276884.276895openalex-snapshot

Implementations of the LMT heuristic for minimum weight triangulation

inferred← citeshttps://doi.org/10.17169/refubium-16284openalex-snapshot

Lifting planar graphs to realize integral 3-polytopes and topics in pseudo- triangulations

inferred← citeshttps://doi.org/10.20382/jocg.v7i1a10openalex-snapshot

Recursively-Regular Subdivisions and Applications

inferred← citeshttps://doi.org/10.22215/etd/2020-14152openalex-snapshot

Generalized Delaunay Triangulations:Graph-Theoretic Properties and Algorithms

inferred← citeshttps://doi.org/10.3217/wr0km-v1e13openalex-snapshot

Relaxing and lifting triangulations

inferred← citeshttps://doi.org/10.3929/ethz-a-005902005openalex-snapshot

Crossing-Free Configurations on Planar Point Sets

inferred← citeshttps://doi.org/10.5555/2095116.2095181openalex-snapshot

On a linear program for minimum-weight triangulation

inferred← citeshttps://doi.org/10.82308/10590openalex-snapshot

Reconfigurations of polygonal structures

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.