scientific article; zbMATH DE number 4142090
From MaRDI portal
Publication:3474685
Recommendations
Cited in
(26)- String graphs. I: The number of critical nonstring graphs is infinite
- The max clique problem in classes of string-graphs
- A special planar satisfiability problem and a consequence of its NP- completeness
- On intersection representations of co-planar graphs
- Unit disk graph recognition is NP-hard
- Complexity of circuit intersection in graphs
- Embedding ray intersection graphs and global curve simplification
- Finding geometric representations of apex graphs is NP-hard
- On the intractability landscape of digraph intersection representations
- Simple realizability of complete abstract topological graphs simplified
- D-collapsibility is NP-complete for d 4
- Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
- Topological Drawings of Complete Bipartite Graphs
- Complexity of some geometric and topological problems
- A Separator Theorem for String Graphs and Its Applications
- On rectangle intersection and overlap graphs
- Complexity of geometric \(k\)-planarity for fixed \(k\)
- On the complexity of some geometric problems with fixed parameters
- Recognizing string graphs in NP
- Contact graphs of line segments are NP-complete
- Finding geometric representations of apex graphs is \textsf{NP}-hard
- Simple realizability of complete abstract topological graphs in P
- Recognition of unit segment and polyline graphs is \(\exists \mathbb{R} \)-complete
- Simple realizability of abstract topological graphs
- Title not available (Why is no real title available?)
- On orthogonal ray trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474685)
