On the public citation graph

Noncrossing Subgraphs in Topological Layouts

https://doi.org/10.1137/0404022
0 signed · 51 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.1002/j.1538-7305.1966.tb01713.xopenalex-snapshot
Topology of Thin Film RC Circuits
inferredcites →https://doi.org/10.1016/0095-8956(76)90022-8openalex-snapshot
Intersection graphs of curves in the plane
inferredcites →https://doi.org/10.1016/0095-8956(91)90036-jopenalex-snapshot
Decomposition of graphs on surfaces and a homotopic circulation theorem
inferredcites →https://doi.org/10.1016/0095-8956(91)90050-topenalex-snapshot
String graphs requiring exponential representations
inferredcites →https://doi.org/10.1016/0095-8956(91)90090-7openalex-snapshot
String graphs. I. The number of critical nonstring graphs is infinite
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.1137/0211025openalex-snapshot
Planar Formulae and Their Uses

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/11917496_29openalex-snapshot
Simultaneous Graph Embeddings with Fixed Edges
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_18openalex-snapshot
Crossing Number of Abstract Topological Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_39openalex-snapshot
Layered Drawings of Graphs with Crossing Constraints
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_20openalex-snapshot
Recognizing String Graphs Is Decidable
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_19openalex-snapshot
Make a Graph Singly Connected by Edge Orientations
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-27261-0_26openalex-snapshot
Simple Realizability of Complete Abstract Topological Graphs Simplified
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_34openalex-snapshot
Topological Drawings of Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_23openalex-snapshot
The Complexity of Drawing Graphs on Few Lines and Few Planes
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_6openalex-snapshot
Two Results on Intersection Graphs of Polygons
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-540-77537-9_16openalex-snapshot
The Complexity of Several Realizability Problems for Abstract Topological Graphs
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-30347-0_4openalex-snapshot
The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_11openalex-snapshot
Non-crossing Connectors in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_35openalex-snapshot
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
inferred← citeshttps://doi.org/10.1007/bf01190507openalex-snapshot
The complexity of induced minors and related problems
inferred← citeshttps://doi.org/10.1007/bf01209713openalex-snapshot
Satisfiability of co-nested formulas
inferred← citeshttps://doi.org/10.1007/bf01990536openalex-snapshot
The complexity of detecting crossingfree configurations in the plane
inferred← citeshttps://doi.org/10.1007/s00453-017-0328-yopenalex-snapshot
On the Planar Split Thickness of Graphs
inferred← citeshttps://doi.org/10.1007/s00454-002-2891-4openalex-snapshot
Recognizing String Graphs Is Decidable
inferred← citeshttps://doi.org/10.1007/s00454-010-9320-xopenalex-snapshot
Simple Realizability of Complete Abstract Topological Graphs in P
inferred← citeshttps://doi.org/10.1007/s00454-020-00204-0openalex-snapshot
Simple Realizability of Complete Abstract Topological Graphs Simplified
inferred← citeshttps://doi.org/10.1007/s00454-021-00339-8openalex-snapshot
Complete Graph Drawings up to Triangle Mutations
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90090-7openalex-snapshot
String graphs. I. The number of critical nonstring graphs is infinite
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90091-wopenalex-snapshot
String graphs. II. recognizing string graphs is NP-hard
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.2015.07.002openalex-snapshot
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.05.001openalex-snapshot
An algorithm for the maximum weight independent set problem on outerstring graphs
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.2026.06.031openalex-snapshot
Complexity of (p,q)-bipartition of planar and 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.006openalex-snapshot
Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.07.005openalex-snapshot
On the complexity of trial and error for constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/j.jda.2005.06.001openalex-snapshot
Crossing-constrained hierarchical drawings
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.016openalex-snapshot
Advancements on SEFE and Partitioned Book Embedding problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.016openalex-snapshot
Polyline drawings with topological constraints
inferred← citeshttps://doi.org/10.1142/s0129054119500011openalex-snapshot
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
inferred← citeshttps://doi.org/10.1145/160985.161145openalex-snapshot
Long non-crossing configurations in the plane
inferred← citeshttps://doi.org/10.1145/237218.237405openalex-snapshot
Ramsey-type results for geometric graphs
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-18openalex-snapshot
Planar 3-SAT with a Clause/Variable Cycle
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
inferred← citeshttps://doi.org/10.7155/jgaa.00630openalex-snapshot
The Complexity of Drawing Graphs on Few Lines and Few Planes
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.