On the public citation graph
Applications of the crossing number
0 signed · 110 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/eujc.1996.0032openalex-snapshot
Forcing Disjoint Segments in the Plane
inferredcites →https://doi.org/10.1007/3-540-52921-7_83openalex-snapshot
Planar separators and the Euclidean norm
inferredcites →https://doi.org/10.1007/bf01196127openalex-snapshot
Quasi-planar graphs have a linear number of edges
inferredcites →https://doi.org/10.1007/bf02187731openalex-snapshot
Disjoint edges in geometric graphs
inferredcites →https://doi.org/10.1007/bf02574361openalex-snapshot
Some geometric applications of Dilworth’s theorem
inferredcites →https://doi.org/10.1007/bfb0017151openalex-snapshot
Edge separators for planar graphs and their applications
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0022-0000(86)90030-9openalex-snapshot
Finding small simple cycle separators for 2-connected planar 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.1016/0925-7721(93)90028-5openalex-snapshot
On compatible triangulations of simple polygons
inferredcites →https://doi.org/10.1080/00029890.1946.11991674openalex-snapshot
On Sets of Distances of n Points
inferredcites →https://doi.org/10.1080/00029890.1970.11992573openalex-snapshot
On Sets of Distances of n Points
inferredcites →https://doi.org/10.1090/dimacs/006/19openalex-snapshot
Notes on geometric graph theory
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1145/41958.41979openalex-snapshot
Joint triangulations and triangulation maps
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.20119openalex-snapshot
Moments of graphs in monotone families
inferred← citeshttps://doi.org/10.1002/jgt.23030openalex-snapshot
On the number of edges of separated multigraphs
inferred← citeshttps://doi.org/10.1002/jgt.23081openalex-snapshot
A note on the width of sparse random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20221openalex-snapshot
Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
inferred← citeshttps://doi.org/10.1006/jagm.1999.1049openalex-snapshot
On Crossing Sets, Disjoint Sets, and Pagenumber
inferred← citeshttps://doi.org/10.1006/jagm.2000.1149openalex-snapshot
Approximating Layout Problems on Random Geometric Graphs
inferred← citeshttps://doi.org/10.1007/10692760_11openalex-snapshot
Drawing Planar Partitions II: HH-Drawings
inferred← citeshttps://doi.org/10.1007/11786986_37openalex-snapshot
Planar Crossing Numbers of Genus g Graphs
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_20openalex-snapshot
Embedding Planar Graphs at Fixed Vertex Locations
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_31openalex-snapshot
Unavoidable Configurations in Complete Topological Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_8openalex-snapshot
An Improved Lower Bound for Crossing Numbers
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_63openalex-snapshot
Graph drawing with no k pairwise crossing edges
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_26openalex-snapshot
Drawing Non-Planar Graphs with Crossing-Free Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_9openalex-snapshot
New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_5openalex-snapshot
On the Relationship Between k-Planar and k-Quasi-Planar Graphs
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-30540-8_15openalex-snapshot
Disjoint Edges in Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_12openalex-snapshot
Relaxing Planarity for Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_4openalex-snapshot
Biplanar Crossing Numbers I: A Survey of Results and Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-44400-8_24openalex-snapshot
Relaxing Planarity for Topological Graphs
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-70904-6_18openalex-snapshot
On the Decay of Crossing Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_4openalex-snapshot
A Bipartite Strengthening of the Crossing Lemma
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_1openalex-snapshot
A Separator Theorem for String Graphs and Its Applications
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/978-3-642-45030-3_16openalex-snapshot
On the Number of Edges of Fan-Crossing Free Graphs
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_2openalex-snapshot
Quantitative Restrictions on Crossing Patterns
inferred← citeshttps://doi.org/10.1007/pl00009364openalex-snapshot
On Geometric Graphs with No k Pairwise Parallel Edges
inferred← citeshttps://doi.org/10.1007/s00454-006-1260-0openalex-snapshot
Covering Planar Graphs with a Fixed Number of Balls
inferred← citeshttps://doi.org/10.1007/s00454-009-9141-yopenalex-snapshot
Degenerate Crossing Numbers
inferred← citeshttps://doi.org/10.1007/s00454-012-9430-8openalex-snapshot
Planar Crossing Numbers of Graphs of Bounded Genus
inferred← citeshttps://doi.org/10.1007/s00454-014-9594-5openalex-snapshot
Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls
inferred← citeshttps://doi.org/10.1007/s00454-014-9645-yopenalex-snapshot
Triangle-Free Geometric Intersection Graphs with No Large Independent Sets
inferred← citeshttps://doi.org/10.1007/s00454-018-00052-zopenalex-snapshot
A Crossing Lemma for Multigraphs
inferred← citeshttps://doi.org/10.1007/s00454-018-0031-zopenalex-snapshot
Coloring Curves that Cross a Fixed Curve
inferred← citeshttps://doi.org/10.1007/s00454-024-00708-zopenalex-snapshot
Pair Crossing Number, Cutwidth, and Good Drawings on Arbitrary Point Sets
inferred← citeshttps://doi.org/10.1007/s00493-016-3414-xopenalex-snapshot
On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations
inferred← citeshttps://doi.org/10.1007/s11856-023-2521-9openalex-snapshot
Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.02.003openalex-snapshot
On grids in topological graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.06.001openalex-snapshot
New bounds on the maximum number of edges in k-quasi-planar graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.07.002openalex-snapshot
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
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.disc.2011.12.009openalex-snapshot
On the light side of geometric graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2003.09.002openalex-snapshot
Crossing number, pair-crossing number, and expansion
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.2019.08.006openalex-snapshot
Simple k-planar graphs are simple (k + 1)-quasiplanar
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.04.007openalex-snapshot
A structure theorem for pseudosegments and its applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.06.014openalex-snapshot
On compatible triangulations with a minimum number of Steiner points
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00098-7openalex-snapshot
3D straight-line grid drawing of 4-colorable graphs
inferred← citeshttps://doi.org/10.1017/s0963548300004454openalex-snapshot
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
inferred← citeshttps://doi.org/10.1017/s0963548309990459openalex-snapshot
A Separator Theorem for String Graphs and its Applications
inferred← citeshttps://doi.org/10.1093/comjnl/bxad038openalex-snapshot
2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth
inferred← citeshttps://doi.org/10.1109/jsac.2015.2504276openalex-snapshot
On the Total Power Capacity of Regular-LDPC Codes With Iterative Message-Passing Decoders
inferred← citeshttps://doi.org/10.1137/050623693openalex-snapshot
Crossing Stars in Topological Graphs
inferred← citeshttps://doi.org/10.1137/17m1112637openalex-snapshot
Orthogonal Tree Decompositions of Graphs
inferred← citeshttps://doi.org/10.1137/17m1157374openalex-snapshot
Outerstring Graphs are $\chi$-Bounded
inferred← citeshttps://doi.org/10.1137/s0097539700373520openalex-snapshot
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
inferred← citeshttps://doi.org/10.1142/s0218216512400093openalex-snapshot
VIRTUAL CROSSING NUMBERS FOR VIRTUAL KNOTS
inferred← citeshttps://doi.org/10.1142/s0219265903000714openalex-snapshot
IMPROVED BOUNDS FOR THE CROSSING NUMBER OF THE MESH OF TREES
inferred← citeshttps://doi.org/10.1145/1377676.1377739openalex-snapshot
Improved upper bounds on the crossing number
inferred← citeshttps://doi.org/10.1145/1542362.1542430openalex-snapshot
On grids in topological graphs
inferred← citeshttps://doi.org/10.1145/3301281openalex-snapshot
A Survey on Graph Drawing Beyond Planarity
inferred← citeshttps://doi.org/10.1145/3747591openalex-snapshot
Minimum Plane Bichromatic Spanning Trees
inferred← citeshttps://doi.org/10.1145/568522.568523openalex-snapshot
A survey of graph layout problems
inferred← citeshttps://doi.org/10.1145/996546.996554openalex-snapshot
Experiments on the minimum linear arrangement problem
inferred← citeshttps://doi.org/10.1155/2022/4550953openalex-snapshot
Calculating Crossing Numbers of Graphs Using Combinatorial Principles
inferred← citeshttps://doi.org/10.37236/728openalex-snapshot
The Minor Crossing Number of Graphs with an Excluded Minor
inferred← citeshttps://doi.org/10.46298/dmtcs.611openalex-snapshot
Improved bounds on the crossing number of butterfly network
inferred← citeshttps://doi.org/10.48550/arxiv.1112.2361openalex-snapshot
The number of edges in k-quasi-planar graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1312.2185openalex-snapshot
Geometric graphs on convex point sets
inferred← citeshttps://doi.org/10.48550/arxiv.1605.08066openalex-snapshot
Edge complexity of geometric graphs on convex independent point sets
inferred← citeshttps://doi.org/10.48550/arxiv.1709.08136openalex-snapshot
The k-planar crossing number of random graphs and random regular graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2004.07996openalex-snapshot
Compatible Paths on Labelled Point Sets
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.5120/3553-4880openalex-snapshot
BiCross : A Biclustering Technique for Gene Expression Data using One Layer Fixed Weighted Bipartite Graph Crossing Minimization
inferred← citeshttps://doi.org/10.7155/jgaa.00032openalex-snapshot
Planarizing Graphs - A Survey and Annotated Bibliography
inferred← citeshttps://doi.org/10.7155/jgaa.00343openalex-snapshot
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
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.