On the public citation graph
Counting Triangulations of Planar Point Sets
0 signed · 95 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/jctb.1998.1870openalex-snapshot
A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps
inferredcites →https://doi.org/10.1007/978-1-4614-0110-0_16openalex-snapshot
Counting Plane Graphs: Flippability and Its Applications
inferredcites →https://doi.org/10.1007/978-3-540-70904-6_1openalex-snapshot
The Number of Triangulations on Planar Point Sets
inferredcites →https://doi.org/10.1007/978-3-540-73545-8_12openalex-snapshot
On the Number of Cycles in Planar Graphs
inferredcites →https://doi.org/10.1007/978-3-642-15775-2_10openalex-snapshot
On the Number of Spanning Trees a Planar Graph Can Have
inferredcites →https://doi.org/10.1007/978-3-642-22300-6_44openalex-snapshot
Counting Plane Graphs: Flippability and Its Applications
inferredcites →https://doi.org/10.1007/pl00009823openalex-snapshot
Note – On the Number of Triangulations of Planar Point Sets
inferredcites →https://doi.org/10.1016/j.comgeo.2004.02.003openalex-snapshot
A lower bound on the number of triangulations of planar point sets
inferredcites →https://doi.org/10.1016/j.comgeo.2005.07.005openalex-snapshot
Abstract order type extension and new results on the rectilinear crossing number
inferredcites →https://doi.org/10.1016/j.endm.2008.06.039openalex-snapshot
Number of Crossing-Free Geometric Graphs vs. Triangulations
inferredcites →https://doi.org/10.1016/s0097-3165(03)00002-5openalex-snapshot
A better upper bound on the number of triangulations of a planar point set
inferredcites →https://doi.org/10.1016/s0304-0208(08)73484-4openalex-snapshot
Crossing-Free Subgraphs
inferredcites →https://doi.org/10.1016/s0925-7721(00)00010-9openalex-snapshot
Lower bounds on the number of crossing-free subgraphs of KN
inferredcites →https://doi.org/10.1090/s0002-9904-1976-14122-5openalex-snapshot
Every planar map is four colorable
inferredcites →https://doi.org/10.1093/oso/9780198502517.001.0001openalex-snapshot
Graph Theory as I Have Known It
inferredcites →https://doi.org/10.1137/050636036openalex-snapshot
On the Number of Crossing‐Free Matchings, Cycles, and Partitions
inferredcites →https://doi.org/10.1145/1109557.1109652openalex-snapshot
On the number of crossing-free matchings, (cycles, and partitions)
inferredcites →https://doi.org/10.1145/1137856.1137898openalex-snapshot
Random triangulations of planar point sets
inferredcites →https://doi.org/10.1145/1810959.1811009openalex-snapshot
On degrees in random triangulations of point sets
inferredcites →https://doi.org/10.1201/9781420057140openalex-snapshot
Graph Theory and Its Applications
inferredcites →https://doi.org/10.1215/ijm/1256049011openalex-snapshot
Every planar map is four colorable. Part I: Discharging
inferredcites →https://doi.org/10.17169/refubium-14441openalex-snapshot
Realization and counting problems for planar structures
inferredcites →https://doi.org/10.4153/cjm-1962-002-9openalex-snapshot
A Census of Planar Triangulations
inferredcites →https://doi.org/10.46298/dmtcs.3354openalex-snapshot
The number of planar graphs and properties of random planar graphs
inferredcites →https://doi.org/10.48550/arxiv.0912.0712openalex-snapshot
On the number of spanning trees a planar graph can have
inferredcites →https://doi.org/10.48550/arxiv.1012.5664openalex-snapshot
Bounds on the maximum multiplicity of some common geometric graphs
inferredcites →https://doi.org/10.5555/1109557.1109613openalex-snapshot
On the number of plane graphs
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-1-4614-0110-0_16openalex-snapshot
Counting Plane Graphs: Flippability and Its Applications
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_17openalex-snapshot
Plane Geometric Graph Augmentation: A Generic Perspective
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-21840-3_24openalex-snapshot
Convex Polygons in Geometric Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_32openalex-snapshot
Monotone Paths in Geometric Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_20openalex-snapshot
On the Number of Higher Order Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_10openalex-snapshot
On the Number of Spanning Trees a Planar Graph Can Have
inferred← citeshttps://doi.org/10.1007/978-3-642-19391-0_3openalex-snapshot
Counting Plane Graphs with Exponential Speed-Up
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_44openalex-snapshot
Counting Plane Graphs: Flippability and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_3openalex-snapshot
Counting Plane Graphs: Cross-Graph Charging Schemes
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_64openalex-snapshot
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
inferred← citeshttps://doi.org/10.1007/s00224-018-9855-4openalex-snapshot
Monotone Paths in Geometric Triangulations
inferred← citeshttps://doi.org/10.1007/s00373-015-1546-1openalex-snapshot
Geometric Biplane Graphs I: Maximal Graphs
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-015-9672-3openalex-snapshot
Counting Triangulations and Other Crossing-Free Structures via Onion Layers
inferred← citeshttps://doi.org/10.1007/s00454-016-9765-7openalex-snapshot
Configurations of Non-crossing Rays and Related Problems
inferred← citeshttps://doi.org/10.1007/s00454-017-9896-5openalex-snapshot
Trapezoidal Diagrams, Upward Triangulations, and Prime Catalan Numbers
inferred← citeshttps://doi.org/10.1007/s00454-019-00147-1openalex-snapshot
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices
inferred← citeshttps://doi.org/10.1007/s00454-020-00251-7openalex-snapshot
Counting Polygon Triangulations is Hard
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.11.002openalex-snapshot
On numbers of pseudo-triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.12.006openalex-snapshot
Counting triangulations and other crossing-free structures approximately
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.12.007openalex-snapshot
On k-gons and k-holes in point sets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.05.008openalex-snapshot
Colored ray configurations
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/j.jcta.2013.01.002openalex-snapshot
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleynʼs technique
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.005openalex-snapshot
On the number of higher order Delaunay triangulations
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.003openalex-snapshot
A QPTAS for the base of the number of crossing-free structures on a planar point set
inferred← citeshttps://doi.org/10.1017/s0963548317000141openalex-snapshot
Convex Polygons in Geometric Triangulations
inferred← citeshttps://doi.org/10.1137/110849407openalex-snapshot
Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
inferred← citeshttps://doi.org/10.1137/15m1046484openalex-snapshot
A Census of Plane Graphs with Polyline Edges
inferred← citeshttps://doi.org/10.1145/1810959.1811009openalex-snapshot
On degrees in random triangulations of point sets
inferred← citeshttps://doi.org/10.1145/2261250.2261259openalex-snapshot
Counting crossing-free structures
inferred← citeshttps://doi.org/10.1145/2421119.2421136openalex-snapshot
Computational geometry column 54
inferred← citeshttps://doi.org/10.1145/2462356.2462392openalex-snapshot
A simple aggregative algorithm for counting triangulations of planar point sets and related problems
inferred← citeshttps://doi.org/10.1145/2582112.2582116openalex-snapshot
A Census of Plane Graphs with Polyline Edges
inferred← citeshttps://doi.org/10.1145/2582112.2582145openalex-snapshot
Counting and Enumerating Crossing-free Geometric Graphs
inferred← citeshttps://doi.org/10.22215/etd/2017-11741openalex-snapshot
Matchings in Geometric Graphs
inferred← citeshttps://doi.org/10.22215/etd/2020-14152openalex-snapshot
Generalized Delaunay Triangulations:Graph-Theoretic Properties and Algorithms
inferred← citeshttps://doi.org/10.37236/11398openalex-snapshot
An Upper Bound for the Number of Rectangulations of a Planar Point Set
inferred← citeshttps://doi.org/10.3929/ethz-b-000314615openalex-snapshot
Counting and Enumerating Crossing-free Geometric Graphs
inferred← citeshttps://doi.org/10.4213/sm9727openalex-snapshot
Перечисление целочисленных триангуляций: уравнения Фредгольма в комбинаторике
inferred← citeshttps://doi.org/10.4213/sm9727eopenalex-snapshot
Counting lattice triangulations: Fredholm equations in combinatorics
inferred← citeshttps://doi.org/10.4230/lipics.socg.2016.52openalex-snapshot
A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.637openalex-snapshot
Bounds on the maximum multiplicity of some common geometric graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.2085openalex-snapshot
On the number of regular edge labelings
inferred← citeshttps://doi.org/10.46298/dmtcs.2132openalex-snapshot
Packing Plane Perfect Matchings into a Point Set
inferred← citeshttps://doi.org/10.48550/arxiv.0912.0712openalex-snapshot
On the number of spanning trees a planar graph can have
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5664openalex-snapshot
Bounds on the maximum multiplicity of some common geometric graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1109.5596openalex-snapshot
Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique
inferred← citeshttps://doi.org/10.48550/arxiv.1306.4434openalex-snapshot
An Introduction to the Discharging Method via Graph Coloring
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0261openalex-snapshot
Counting Triangulations and other Crossing-Free Structures Approximately
inferred← citeshttps://doi.org/10.48550/arxiv.1411.0544openalex-snapshot
A QPTAS for the Base of the Number of Triangulations of a Planar Point Set
inferred← citeshttps://doi.org/10.48550/arxiv.1608.04812openalex-snapshot
Monotone Paths in Geometric Triangulations
inferred← citeshttps://doi.org/10.48550/arxiv.1704.03066openalex-snapshot
New Properties of Numbers of Plane Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1803.03945openalex-snapshot
Exact uniform sampling over catalan structures
inferred← citeshttps://doi.org/10.5821/dissertation-2117-328194openalex-snapshot
Generalized Delaunay triangulations : graph-theoretic properties and algorithms
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.