On the public citation graph
Quasi-planar graphs have a linear number of edges
0 signed · 27 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.1016/0012-365x(85)90044-5openalex-snapshot
On the chromatic number of multiple interval graphs and overlap graphs
inferredcites →https://doi.org/10.1016/0012-365x(85)90045-7openalex-snapshot
Covering and coloring problems for relatives of intervals
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/177424.177629openalex-snapshot
Applications of the crossing number
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-1-4614-0110-0_15openalex-snapshot
On Disjoint Crossing Families in Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0openalex-snapshot
Graph Drawing and Network Visualization
inferred← citeshttps://doi.org/10.1007/978-3-031-49272-3_3openalex-snapshot
Min-k-planar Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-33442-9_33openalex-snapshot
Binoculars: Comprehending Open Source Projects through Graphs
inferred← citeshttps://doi.org/10.1007/pl00009364openalex-snapshot
On Geometric Graphs with No k Pairwise Parallel Edges
inferred← citeshttps://doi.org/10.1007/pl00009365openalex-snapshot
Extremal Problems for Geometric Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00454-005-1191-1openalex-snapshot
Geometric Graphs with No Three Disjoint 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.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.endm.2011.09.060openalex-snapshot
On disjoint crossing families in geometric graphs
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/s0167-739x(98)00056-9openalex-snapshot
An optimized task-farm model to integrate reduced dimensionality Schrödinger equations on distributed memory architectures
inferred← citeshttps://doi.org/10.1109/2945.841119openalex-snapshot
Graph visualization and navigation in information visualization: A survey
inferred← citeshttps://doi.org/10.4310/joc.2010.v1.n3.a4openalex-snapshot
Disjoint edges in topological graphs
inferred← citeshttps://doi.org/10.59615/ijimes.3.2.52openalex-snapshot
Proposing a Pure Binary Linear Programming(PBLP) Model to Discover Eulerian Circuits in Complete Graphs
inferred← citeshttps://doi.org/10.7155/jgaa.v28i2.2925openalex-snapshot
Min-$k$-planar Drawings of 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.