On the public citation graph
Crossing families
0 signed · 47 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/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187731openalex-snapshot
Disjoint edges in geometric graphs
inferredcites →https://doi.org/10.1016/0095-8956(92)90003-gopenalex-snapshot
A turán-type theorem on chords of a convex polygon
inferredcites →https://doi.org/10.1145/160985.161146openalex-snapshot
Some geometric applications of Dilworth's theorem
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-3-030-90048-9_1openalex-snapshot
On Geometric Graphs on Point Sets in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_32openalex-snapshot
A Ramsey-Type Result for Geometric ℓ-Hypergraphs
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-540-31843-9_9openalex-snapshot
Partitions of Complete Geometric Graphs into Plane Trees
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-31770-5_10openalex-snapshot
Crossing Angles of Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_30openalex-snapshot
On Mutually Avoiding Sets
inferred← citeshttps://doi.org/10.1007/bf01844852openalex-snapshot
Lines, line-point incidences and crossing families in dense sets
inferred← citeshttps://doi.org/10.1007/s00357-019-09315-7openalex-snapshot
Clustering Analysis of a Dissimilarity: a Review of Algebraic and Geometric Representation
inferred← citeshttps://doi.org/10.1007/s00373-013-1335-7openalex-snapshot
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges
inferred← citeshttps://doi.org/10.1007/s00373-023-02734-9openalex-snapshot
Crossing and intersecting families of geometric graphs on point sets
inferred← citeshttps://doi.org/10.1007/s00373-025-02985-8openalex-snapshot
Noncrossing Longest Paths and Cycles
inferred← citeshttps://doi.org/10.1007/s00373-025-03006-4openalex-snapshot
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
inferred← citeshttps://doi.org/10.1007/s00453-023-01147-7openalex-snapshot
Perfect Matchings with Crossings
inferred← citeshttps://doi.org/10.1007/s00454-012-9424-6openalex-snapshot
Erdős–Szekeres Theorem for Point Sets with Forbidden Subconfigurations
inferred← citeshttps://doi.org/10.1007/s00454-012-9464-yopenalex-snapshot
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing
inferred← citeshttps://doi.org/10.1007/s00454-014-9646-xopenalex-snapshot
On the Geometric Ramsey Number of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/s00454-020-00231-xopenalex-snapshot
On Grids in Point-Line Arrangements in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-023-00532-xopenalex-snapshot
The Crossing Tverberg Theorem
inferred← citeshttps://doi.org/10.1007/s00454-023-00548-3openalex-snapshot
Covering the Edges of a Complete Geometric Graph with Convex Polygons
inferred← citeshttps://doi.org/10.1007/s00454-023-00579-wopenalex-snapshot
On the Structure of Pointsets with Many Collinear Triples
inferred← citeshttps://doi.org/10.1007/s00454-024-00691-5openalex-snapshot
Erdős–Szekeres-Type Problems in the Real Projective Plane
inferred← citeshttps://doi.org/10.1007/s10474-018-0880-1openalex-snapshot
On crossing families of complete geometric graphs
inferred← citeshttps://doi.org/10.1016/j.aim.2021.107779openalex-snapshot
Planar point sets determine many pairwise crossing segments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.02.003openalex-snapshot
A lower bound on the number of triangulations of planar point sets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.08.006openalex-snapshot
Partitions of complete geometric graphs into plane trees
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101653openalex-snapshot
Packing plane spanning trees into a point set
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101899openalex-snapshot
On crossing-families in planar point sets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102123openalex-snapshot
A note on the k-colored crossing ratio of dense geometric graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.08.021openalex-snapshot
On the geometric Ramsey numbers of trees
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111730openalex-snapshot
A positive fraction mutually avoiding sets theorem
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.2014.04.001openalex-snapshot
A Ramsey-type result for geometric ℓ -hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.04.006openalex-snapshot
Packing plane spanning trees and paths in complete geometric graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2004.12.008openalex-snapshot
Crossing patterns of semi-algebraic sets
inferred← citeshttps://doi.org/10.1023/a:1021231927255openalex-snapshot
Enumerating Order Types for Small Point Sets with Applications
inferred← citeshttps://doi.org/10.1145/2789149.2789162openalex-snapshot
Computational Geometry Column 61
inferred← citeshttps://doi.org/10.1145/3747591openalex-snapshot
Minimum Plane Bichromatic Spanning Trees
inferred← citeshttps://doi.org/10.4236/ojdm.2013.33030openalex-snapshot
On Some Numbers Related to the Erdös-Szekeres Theorem
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.