On the public citation graph
Toughness and Delaunay triangulations
0 signed · 109 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-51542-9_6openalex-snapshot
The Delaunay triangulation closely approximates the complete Euclidean graph
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_2openalex-snapshot
Differentiable Functions and Singularities
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/978-3-642-61649-5_4openalex-snapshot
Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/bf00164401openalex-snapshot
Generalized Dirichlet tessellations
inferredcites →https://doi.org/10.1007/bf00181470openalex-snapshot
Recognizing Dirichlet tessellations
inferredcites →https://doi.org/10.1007/bf01759057openalex-snapshot
On sorting triangles in a delaunay tessellation
inferredcites →https://doi.org/10.1007/bf01840354openalex-snapshot
Some problems in computational geometry
inferredcites →https://doi.org/10.1007/bf02122779openalex-snapshot
An acyclicity theorem for cell complexes ind dimension
inferredcites →https://doi.org/10.1007/bf02136025openalex-snapshot
On the average length of Delaunay triangulations
inferredcites →https://doi.org/10.1016/0012-365x(73)90138-6openalex-snapshot
Tough graphs and hamiltonian circuits
inferredcites →https://doi.org/10.1016/0012-365x(80)90240-xopenalex-snapshot
A 1-tough nonhamiltonian maximal planar graph
inferredcites →https://doi.org/10.1016/0012-365x(89)90295-1openalex-snapshot
Selected topics in graph theory 3
inferredcites →https://doi.org/10.1016/0012-365x(91)90099-nopenalex-snapshot
An upper bound on the shortness exponent of 1-tough, maximal planar graphs
inferredcites →https://doi.org/10.1016/0016-0032(39)90673-3openalex-snapshot
Elements of the topology of plane sets of points
inferredcites →https://doi.org/10.1016/0020-0190(79)90074-7openalex-snapshot
Voronoi diagrams from convex hulls
inferredcites →https://doi.org/10.1016/0020-0190(79)90104-2openalex-snapshot
Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation
inferredcites →https://doi.org/10.1016/0020-0190(80)90062-9openalex-snapshot
A note on Delaunay and optimal triangulations
inferredcites →https://doi.org/10.1016/0020-0190(83)90004-2openalex-snapshot
Traveling salesman cycles are not always subgraphs of Voronoi duals
inferredcites →https://doi.org/10.1016/0020-0190(86)90038-4openalex-snapshot
The Greedy and Delauney triangulations are not bad in the average case
inferredcites →https://doi.org/10.1016/0020-0190(87)90124-4openalex-snapshot
A non-hamiltonian, nondegenerate delaunay triangulation
inferredcites →https://doi.org/10.1016/0020-0190(87)90160-8openalex-snapshot
Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
inferredcites →https://doi.org/10.1016/0020-0190(90)90210-oopenalex-snapshot
Realizability of delaunay triangulations
inferredcites →https://doi.org/10.1016/0095-8956(89)90008-7openalex-snapshot
An upper bound on the shortness exponent of inscribable polytopes
inferredcites →https://doi.org/10.1016/0166-218x(90)90001-sopenalex-snapshot
Recognizing tough graphs is NP-hard
inferredcites →https://doi.org/10.1016/s0021-9800(70)80054-0openalex-snapshot
Hamiltonian circuits on 3-polytopes
inferredcites →https://doi.org/10.1016/s0734-189x(87)80169-xopenalex-snapshot
Connect-the-dots: A new heuristic
inferredcites →https://doi.org/10.1109/sfcs.1977.21openalex-snapshot
On triangulations of a set of points in the plane
inferredcites →https://doi.org/10.1109/sfcs.1987.18openalex-snapshot
Delaunay graphs are almost as good as complete graphs
inferredcites →https://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
inferredcites →https://doi.org/10.1145/24919.990008openalex-snapshot
The Computational Geometry Column #2
inferredcites →https://doi.org/10.1145/357346.357349openalex-snapshot
Geometric structures for three-dimensional shape representation
inferredcites →https://doi.org/10.1145/73833.73850openalex-snapshot
An acyclicity theorem for cell complexes in d dimensions
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.61091/jcmccopenalex-snapshot
Journal of Combinatorial Mathematics and Combinatorial Computing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22736openalex-snapshot
Matchings in 1‐planar graphs with large minimum degree
inferred← citeshttps://doi.org/10.1006/jctb.1996.0008openalex-snapshot
Polyhedra of Small Order and Their Hamiltonian Properties
inferred← citeshttps://doi.org/10.1007/11589440_1openalex-snapshot
Matching Points with Circles and Squares
inferred← citeshttps://doi.org/10.1007/11611257_15openalex-snapshot
Matching Points with Rectangles and Squares
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-44691-5_3openalex-snapshot
Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_14openalex-snapshot
Triangulations without Minimum-Weight Drawing
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_74openalex-snapshot
Topologically consistent algorithms related to convex polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_71openalex-snapshot
A simple method for resolving degeneracies in Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_388openalex-snapshot
Proximity drawability: A survey extended abstract
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-3-030-24766-9_15openalex-snapshot
Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_20openalex-snapshot
Maximum Matchings and Minimum Blocking Sets in $$\varTheta _6$$ -Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-14974-5_9openalex-snapshot
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_25openalex-snapshot
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-662-50447-5_13openalex-snapshot
Six Topics on Inscribable Polytopes
inferred← citeshttps://doi.org/10.1007/s00022-013-0160-8openalex-snapshot
Disjoint empty disks supported by a point set
inferred← citeshttps://doi.org/10.1007/s00170-021-06842-9openalex-snapshot
Cutting path optimization for an automatic cutter in polynomial time using a 3/2 approximation algorithm
inferred← citeshttps://doi.org/10.1007/s00454-008-9099-1openalex-snapshot
Matching Points with Squares
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90099-nopenalex-snapshot
An upper bound on the shortness exponent of 1-tough, maximal planar graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00276-3openalex-snapshot
Graph-theoretical conditions for inscribability and Delaunay realizability
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00027-1openalex-snapshot
Simpler proof of a realizability theorem on Delaunay triangulations
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90111-zopenalex-snapshot
On certain Hamiltonian inner triangulations
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00125-wopenalex-snapshot
Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90096-8openalex-snapshot
2-Change for k-connected networks
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/j.cagd.2021.102039openalex-snapshot
Affine invariant triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.05.001openalex-snapshot
Matching points with rectangles and squares
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.01.001openalex-snapshot
Witness (Delaunay) graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.02.005openalex-snapshot
Blocking Delaunay triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.01.001openalex-snapshot
Approximate proximity drawings
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.07.003openalex-snapshot
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.06.009openalex-snapshot
Strong matching of points with geometric shapes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101629openalex-snapshot
Hamiltonicity for convex shape Delaunay and Gabriel graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114288openalex-snapshot
Large matchings in maximal 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.040openalex-snapshot
Matchings in higher-order Gabriel graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00238-5openalex-snapshot
Maximum and minimum toughness of graphs of small genus
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00067-3openalex-snapshot
Triangulations without minimum-weight drawing
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(02)00137-2openalex-snapshot
Voronoi drawings of trees
inferred← citeshttps://doi.org/10.1023/a:1005845423860openalex-snapshot
Shrinkability of Minimal Elements in Sphere Representations of Posets
inferred← citeshttps://doi.org/10.1090/s0273-0979-1992-00303-8openalex-snapshot
A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
inferred← citeshttps://doi.org/10.1109/ijcnn.1998.682290openalex-snapshot
Acquisition of the unique solution based on spline network [neuro-surgical navigation system]
inferred← citeshttps://doi.org/10.1137/1.9781611976014.8openalex-snapshot
A Short Proof of the Toughness of Delaunay Triangulations
inferred← citeshttps://doi.org/10.1137/s0895480194264010openalex-snapshot
Angles of Planar Triangular Graphs
inferred← citeshttps://doi.org/10.1142/s0218195909003143openalex-snapshot
ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
inferred← citeshttps://doi.org/10.1142/s0218195912500112openalex-snapshot
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω
inferred← citeshttps://doi.org/10.1145/142675.142715openalex-snapshot
A linear-time algorithm for testing the inscribability of trivalent polyhedra
inferred← citeshttps://doi.org/10.1145/167088.167207openalex-snapshot
Angles of planar triangular graphs
inferred← citeshttps://doi.org/10.1145/944618.944622openalex-snapshot
Implementation of O ( nm log n ) weighted matchings in general graphs
inferred← citeshttps://doi.org/10.1287/ijoc.11.2.138openalex-snapshot
Computing Minimum-Weight Perfect Matchings
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.48550/arxiv.1409.5466openalex-snapshot
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
inferred← citeshttps://doi.org/10.48550/arxiv.1901.01476openalex-snapshot
Maximum Matchings and Minimum Blocking Sets in $Θ_6$-Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1902.07812openalex-snapshot
Finding big matchings in planar graphs quickly
inferred← citeshttps://doi.org/10.5821/dissertation-2117-328194openalex-snapshot
Generalized Delaunay triangulations : graph-theoretic properties and algorithms
inferred← citeshttps://doi.org/10.7275/6461420.0openalex-snapshot
Reconstructing Geometric Structures from Combinatorial and Metric Information
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.