On the public citation graph
On the complexity of recognizing intersection and touching graphs of disks
0 signed · 38 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(93)e0068-fopenalex-snapshot
Coin graphs, Polyhedra, and conformal mapping
inferredcites →https://doi.org/10.1016/0020-0190(87)90173-6openalex-snapshot
The complexity of minimizing wire lengths in VLSI layouts
inferredcites →https://doi.org/10.1016/0095-8956(83)90057-6openalex-snapshot
On the sphericity and cubicity of graphs
inferredcites →https://doi.org/10.1016/0095-8956(91)90091-wopenalex-snapshot
String graphs. II. recognizing string graphs is NP-hard
inferredcites →https://doi.org/10.1016/0166-218x(94)90143-0openalex-snapshot
A special planar satisfiability problem and a consequence of its NP-completeness
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s0925-7721(97)00014-xopenalex-snapshot
Unit disk graph recognition is NP-hard
inferredcites →https://doi.org/10.1109/proc.1980.11899openalex-snapshot
Frequency assignment: Theory and applications
inferredcites →https://doi.org/10.1137/0214048openalex-snapshot
On Comparability and Permutation Graphs
inferredcites →https://doi.org/10.1137/s0895480193242931openalex-snapshot
On the Angular Resolution of Planar Graphs
inferredcites →https://doi.org/10.1145/129712.129764openalex-snapshot
On the angular resolution of planar graphs
inferredcites →https://doi.org/10.1145/62212.62257openalex-snapshot
Some algebraic and geometric computations in PSPACE
inferredcites →https://doi.org/10.1287/opre.39.3.378openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
inferredcites →https://doi.org/10.14288/1.0051600openalex-snapshot
Algorithmic aspects of constrained unit disk graphs
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11671541_5openalex-snapshot
Independence and Coloring Problems on Intersection Graphs of Disks
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_3openalex-snapshot
Optimal Möbius Transformations for Information Visualization and Meshing
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_53openalex-snapshot
Intersection graphs of noncrossing arc-connected sets in the plane
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_80openalex-snapshot
Touching graphs of unit balls
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_81openalex-snapshot
Discrete realizations of contact and intersection graphs (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_22openalex-snapshot
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-10503-5_5openalex-snapshot
The Existential Theory of the Reals as a Complexity Class: A Compendium
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_37openalex-snapshot
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_12openalex-snapshot
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
inferred← citeshttps://doi.org/10.1007/978-3-662-57413-3_2openalex-snapshot
Contact Numbers for Sphere Packings
inferred← citeshttps://doi.org/10.1007/s00285-025-02203-2openalex-snapshot
Single-cell 3D genome reconstruction in the haploid setting using rigidity theory
inferred← citeshttps://doi.org/10.1007/s10288-012-0220-1openalex-snapshot
Applications of reformulations in mathematical programming
inferred← citeshttps://doi.org/10.1016/j.dam.2012.07.020openalex-snapshot
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.022openalex-snapshot
Improper Colourings of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.05.007openalex-snapshot
Contact graphs of ball packings
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00204-1openalex-snapshot
Representing graphs by disks and balls (a survey of recognition-complexity results)
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00089-5openalex-snapshot
On-line coloring of geometric intersection graphs
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00014-xopenalex-snapshot
Unit disk graph recognition is NP-hard
inferred← citeshttps://doi.org/10.48550/arxiv.2306.02672openalex-snapshot
Diffusion dynamics for an infinite system of two-type spheres and the associated depletion effect
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0101006openalex-snapshot
Optimal Moebius Transformations for Information Visualization and Meshing
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.