On the public citation graph

Note – On the Number of Triangulations of Planar Point Sets

https://doi.org/10.1007/pl00009823
0 signed · 17 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.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11533719_56openalex-snapshot
An Upper Bound on the Number of Rectangulations of a Point Set
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_1openalex-snapshot
The Number of Triangulations on Planar Point Sets
inferred← citeshttps://doi.org/10.1007/s00373-026-03010-2openalex-snapshot
On the Number of Drawings of a Combinatorial Triangulation
inferred← citeshttps://doi.org/10.1007/s00454-020-00251-7openalex-snapshot
Counting Polygon Triangulations is Hard
inferred← citeshttps://doi.org/10.1016/j.jcta.2011.04.002openalex-snapshot
On degrees in random triangulations of point sets
inferred← citeshttps://doi.org/10.1016/s0097-3165(03)00002-5openalex-snapshot
A better upper bound on the number of triangulations of a planar point set
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00010-9openalex-snapshot
Lower bounds on the number of crossing-free subgraphs of KN
inferred← citeshttps://doi.org/10.1137/050636036openalex-snapshot
On the Number of Crossing‐Free Matchings, Cycles, and Partitions
inferred← citeshttps://doi.org/10.1145/1137856.1137898openalex-snapshot
Random triangulations of planar point sets
inferred← citeshttps://doi.org/10.1145/1810959.1811009openalex-snapshot
On degrees in random triangulations of point sets
inferred← citeshttps://doi.org/10.1145/3585535openalex-snapshot
Chains, Koch Chains, and Point Sets with Many Triangulations
inferred← citeshttps://doi.org/10.37236/557openalex-snapshot
Counting Triangulations of Planar Point Sets
inferred← citeshttps://doi.org/10.3929/ethz-a-005902005openalex-snapshot
Crossing-Free Configurations on Planar Point Sets
inferred← citeshttps://doi.org/10.48550/arxiv.0911.3352openalex-snapshot
Counting Triangulations of Planar Point Sets
inferred← citeshttps://doi.org/10.48550/arxiv.math/0310206openalex-snapshot
Counting Triangulations of Configurations
inferred← citeshttps://doi.org/10.5555/1109557.1109652openalex-snapshot
On the number of crossing-free matchings, (cycles, and partitions)
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.