On the public citation graph

Towards a Theory of Geometric Graphs

0 signed · 100 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.1016/s0304-0208(08)73484-4openalex-snapshot
Crossing-Free Subgraphs
inferredcites →https://doi.org/10.1080/00029890.1970.11992573openalex-snapshot
On Sets of Distances of n Points
inferredcites →https://doi.org/10.1112/s0025579300010998openalex-snapshot
On the Hausdorff dimensions of distance sets

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.20566openalex-snapshot
Geometric graph homomorphisms
inferred← citeshttps://doi.org/10.1007/0-387-25592-3_2openalex-snapshot
Problems and Results on Geometric Patterns
inferred← citeshttps://doi.org/10.1007/11589440_1openalex-snapshot
Matching Points with Circles and Squares
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_2openalex-snapshot
The Rectilinear Crossing Number of K n : Closing in (or Are We?)
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_8openalex-snapshot
Progress on Crossing Number Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_15openalex-snapshot
Layouts of Graph Subdivisions
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_40openalex-snapshot
No-Three-in-Line-in-3D
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_16openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_10openalex-snapshot
Distinct Triangle Areas in a Planar Point Set
inferred← citeshttps://doi.org/10.1007/978-3-540-77200-2_4openalex-snapshot
Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_4openalex-snapshot
The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-22339-6_29openalex-snapshot
Maximal Cliques Generating Algorithm for Spatial Co-location Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_26openalex-snapshot
Geometric Graphs in the Plane Lattice
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_17openalex-snapshot
The Beginnings of Geometric Graph Theory
inferred← citeshttps://doi.org/10.1007/s00453-022-01041-8openalex-snapshot
Clique-Based Separators for Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/s00454-008-9066-xopenalex-snapshot
Automorphisms and Distinguishing Numbers of Geometric Cliques
inferred← citeshttps://doi.org/10.1007/s00454-008-9095-5openalex-snapshot
Generalized Thrackle Drawings of Non-bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00454-008-9099-1openalex-snapshot
Matching Points with Squares
inferred← citeshttps://doi.org/10.1007/s00454-008-9118-2openalex-snapshot
On Regular Vertices of the Union of Planar Convex Objects
inferred← citeshttps://doi.org/10.1007/s00454-009-9158-2openalex-snapshot
Cuttings for Disks and Axis-Aligned Rectangles in Three-Space
inferred← citeshttps://doi.org/10.1007/s00454-012-9403-yopenalex-snapshot
On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n
inferred← citeshttps://doi.org/10.1007/s00454-025-00721-wopenalex-snapshot
Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.11.003openalex-snapshot
Computing straight-line 3D grid drawings of graphs in linear volume
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.06.002openalex-snapshot
Nearly equal distances and Szemerédi's regularity lemma
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.08.002openalex-snapshot
Graph drawings with few slopes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.05.003openalex-snapshot
Drawing cubic graphs with at most five slopes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.09.005openalex-snapshot
On graph thickness, geometric thickness, and separator theorems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.11.003openalex-snapshot
On crossing numbers of geometric proximity graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.02.001openalex-snapshot
A computational approach to Conwayʼs thrackle conjecture
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.10.002openalex-snapshot
Tangencies between families of disjoint regions in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.07.005openalex-snapshot
Alternating paths and cycles of minimum length
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.06.015openalex-snapshot
Note on k-planar crossing numbers
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.10.008openalex-snapshot
Distinct distances between points and lines
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101666openalex-snapshot
Output sensitive algorithms for approximate incidences and their applications
inferred← citeshttps://doi.org/10.1016/j.dam.2009.09.020openalex-snapshot
3-symmetric and 3-decomposable geometric drawings of Kn
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.046openalex-snapshot
Homothetic polygons and beyond: Maximal cliques in intersection graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.04.007openalex-snapshot
k -planar crossing number of random graphs and random regular graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.029openalex-snapshot
New algorithms and bounds for halving pseudolines
inferred← citeshttps://doi.org/10.1016/j.dam.2021.07.014openalex-snapshot
Degenerate drawing of outerplanar graphs with two edge lengths
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.046openalex-snapshot
On distinct distances and λ -free point sets
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.061openalex-snapshot
Volume requirements of 3D upward drawings
inferred← citeshttps://doi.org/10.1016/j.disc.2008.03.005openalex-snapshot
On edges crossing few other edges in simple topological complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.09.026openalex-snapshot
Monochromatic simplices of any volume
inferred← citeshttps://doi.org/10.1016/j.disc.2009.10.026openalex-snapshot
A note on the number of different inner products generated by a finite set of vectors
inferred← citeshttps://doi.org/10.1016/j.disc.2016.12.004openalex-snapshot
Highly incidental patterns on a quadratic hypersurface in R4
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111967openalex-snapshot
Distinct distances in planar point sets with forbidden 4-point patterns
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113571openalex-snapshot
Distribution of similar configurations in subsets of Fqd
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.05.007openalex-snapshot
On the diameter of separated point sets with many nearly equal distances
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.03.010openalex-snapshot
New results on lower bounds for the number of (≤k) -facets
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.021openalex-snapshot
Coloring K k -free intersection graphs of geometric objects in the plane
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103330openalex-snapshot
A general incidence bound in Rd
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103702openalex-snapshot
Saturation problems in convex geometric hypergraphs
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.088openalex-snapshot
Crossing Minimisation Heuristics for 2-page Drawings
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.033openalex-snapshot
New results on lower bounds for the number of (⩽ k)-facets
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.045openalex-snapshot
The maximum number of halving lines and the rectilinear crossing number of for
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.047openalex-snapshot
A central approach to bound the number of crossings in a generalized configuration
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.05.003openalex-snapshot
Geometric drawings of Kn with few crossings
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.08.002openalex-snapshot
On the maximum number of edges in quasi-planar graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2007.11.004openalex-snapshot
An extended lower bound on the number of (⩽k) -edges to generalized configurations of points and the pseudolinear crossing number of Kn
inferred← citeshttps://doi.org/10.1016/j.jcta.2009.03.008openalex-snapshot
Extremal problems on triangle areas in two and three dimensions
inferred← citeshttps://doi.org/10.1016/j.jcta.2010.11.008openalex-snapshot
On lines, joints, and incidences in three dimensions
inferred← citeshttps://doi.org/10.1016/j.jcta.2014.08.004openalex-snapshot
On totally positive matrices and geometric incidences
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.03.005openalex-snapshot
On the decay of crossing numbers
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.03.005openalex-snapshot
A bipartite strengthening of the Crossing Lemma
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.006openalex-snapshot
Layered separators in minor-closed graph classes with applications
inferred← citeshttps://doi.org/10.1016/j.jda.2012.04.012openalex-snapshot
Hamiltonian orthogeodesic alternating paths
inferred← citeshttps://doi.org/10.1016/j.jda.2012.06.001openalex-snapshot
Acyclic colorings of graph subdivisions revisited
inferred← citeshttps://doi.org/10.1016/j.jda.2013.08.002openalex-snapshot
Acyclic coloring with few division vertices
inferred← citeshttps://doi.org/10.1016/j.jmaa.2015.01.063openalex-snapshot
Results on the Erdős–Falconer distance problem in Z q d for odd q
inferred← citeshttps://doi.org/10.1016/j.jnt.2012.05.003openalex-snapshot
The generalized Erdős–Falconer distance problems in vector spaces over finite fields
inferred← citeshttps://doi.org/10.1016/j.patcog.2012.03.018openalex-snapshot
Geometric graph comparison from an alignment viewpoint
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.027openalex-snapshot
On the curve complexity of 3-colored point-set embeddings
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.045openalex-snapshot
2-colored point-set embeddings of partial 2-trees
inferred← citeshttps://doi.org/10.1017/s0004972700038867openalex-snapshot
On some generalisations of the Erdős distance problem over finite fields
inferred← citeshttps://doi.org/10.1017/s0963548308009127openalex-snapshot
On a Question of Bourgain about Geometric Incidences
inferred← citeshttps://doi.org/10.1017/s0963548311000010openalex-snapshot
Non-Degenerate Spheres in Three Dimensions
inferred← citeshttps://doi.org/10.1017/s0963548311000137openalex-snapshot
Incidences in Three Dimensions and Distinct Distances in the Plane
inferred← citeshttps://doi.org/10.1017/s0963548312000144openalex-snapshot
Unit Distances in Three Dimensions
inferred← citeshttps://doi.org/10.1017/s0963548314000534openalex-snapshot
Improved Bounds for Incidences Between Points and Circles
inferred← citeshttps://doi.org/10.1090/s0002-9947-09-04866-1openalex-snapshot
Geometric incidence theorems via Fourier analysis
inferred← citeshttps://doi.org/10.1090/s0273-0979-07-01189-5openalex-snapshot
From harmonic analysis to arithmetic combinatorics
inferred← citeshttps://doi.org/10.1111/cgf.12728openalex-snapshot
Example‐Driven Procedural Urban Roads
inferred← citeshttps://doi.org/10.1137/080720115openalex-snapshot
Vector-Space Methods and Kirchhoff Graphs for Reaction Networks
inferred← citeshttps://doi.org/10.1145/1497290.1497291openalex-snapshot
Testing bipartiteness of geometric intersection graphs
inferred← citeshttps://doi.org/10.1145/1653771.1653778openalex-snapshot
Going off-road
inferred← citeshttps://doi.org/10.1145/3208976.3209028openalex-snapshot
Algebraic Techniques in Geometry
inferred← citeshttps://doi.org/10.1145/997817.997831openalex-snapshot
Improving the crossing lemma by finding more crossings in sparse graphs
inferred← citeshttps://doi.org/10.11606/t.45.2014.tde-02072014-150049openalex-snapshot
Análise de formas usando wavelets em grafos
inferred← citeshttps://doi.org/10.1371/journal.pone.0143638openalex-snapshot
Event Networks and the Identification of Crime Pattern Motifs
inferred← citeshttps://doi.org/10.1587/transinf.2018edp7353openalex-snapshot
Sampling Shape Contours Using Optimization over a Geometric Graph
inferred← citeshttps://doi.org/10.20382/jocg.v9i1a12openalex-snapshot
Thickness and Antithickness of Graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.329.82dopenalex-snapshot
Matrices and their Kirchhoff graphs
inferred← citeshttps://doi.org/10.26754/uz.978-84-92774-11-1openalex-snapshot
XIII Encuentros de Geometría Computacional. Zaragoza, 29 de junio al 1 de julio de 2009
inferred← citeshttps://doi.org/10.48550/arxiv.1401.4375openalex-snapshot
Fast regocnition of planar non unit distance graphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0604467openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
inferred← citeshttps://doi.org/10.5220/0005291203860393openalex-snapshot
A Dissimilarity Measure for Comparing Origami Crease Patterns
inferred← citeshttps://doi.org/10.5565/publmat_49105_11openalex-snapshot
Non-isotropic distance measures for lattice-generated sets
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.