On the public citation graph

The complexity of detecting crossingfree configurations in the plane

https://doi.org/10.1007/bf01990536
0 signed · 33 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.1007/978-3-322-92106-2openalex-snapshot
Combinatorial Algorithms for Integrated Circuit Layout
inferredcites →https://doi.org/10.1007/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
inferredcites →https://doi.org/10.1137/0210052openalex-snapshot
Information Dissemination in Trees
inferredcites →https://doi.org/10.1137/0404022openalex-snapshot
Noncrossing Subgraphs in Topological Layouts

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11602613_61openalex-snapshot
Configurations with Few Crossings in Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_426openalex-snapshot
Traveling Sales Person with Few Inner Points
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_426openalex-snapshot
Traveling Sales Person with Few Inner Points
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-06686-8_26openalex-snapshot
Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_36openalex-snapshot
Fixed-Parameter Tractability for Non-Crossing Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_30openalex-snapshot
Connected Rectilinear Graphs on Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_87openalex-snapshot
Reconstructing Polygons from Scanner Data
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_2openalex-snapshot
Reconstructing a Simple Polygon from Its Angles
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_5openalex-snapshot
Bottleneck Non-crossing Matching in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-007-9026-xopenalex-snapshot
Enumerating Constrained Non-crossing Minimally Rigid Frameworks
inferred← citeshttps://doi.org/10.1007/s00454-009-9164-4openalex-snapshot
Fast Enumeration Algorithms for Non-crossing Geometric Graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.06.001openalex-snapshot
Configurations with few crossings in topological graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.10.005openalex-snapshot
Bottleneck non-crossing matching in the plane
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.cosrev.2022.100490openalex-snapshot
Parameterized analysis and crossing minimization problems
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.019openalex-snapshot
Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
inferred← citeshttps://doi.org/10.1016/j.dam.2012.01.018openalex-snapshot
Covering points with orthogonal polygons
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.039openalex-snapshot
Covering oriented points in the plane with orthogonal polygons is NP-complete
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.016openalex-snapshot
Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.10.026openalex-snapshot
Reconstructing polygons from scanner data
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00201-0openalex-snapshot
On a matching problem in the plane
inferred← citeshttps://doi.org/10.1111/cgf.14322openalex-snapshot
ClusterSets: Optimizing Planar Clusters in Categorical Point Data
inferred← citeshttps://doi.org/10.1142/s0218195915500144openalex-snapshot
A Bottleneck Matching Problem with Edge-Crossing Constraints
inferred← citeshttps://doi.org/10.1142/s021819591860004xopenalex-snapshot
Reconstruction of Weakly Simple Polygons from Their Edges
inferred← citeshttps://doi.org/10.1145/1377676.1377733openalex-snapshot
Fast enumeration algorithms for non-crossing geometric graphs
inferred← citeshttps://doi.org/10.1145/237218.237405openalex-snapshot
Ramsey-type results for geometric graphs
inferred← citeshttps://doi.org/10.3233/fi-1995-2245openalex-snapshot
LONG NON-CROSSING CONFIGURATIONS IN THE PLANE
inferred← citeshttps://doi.org/10.37236/34openalex-snapshot
Ramsey Theory Applications
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.