The following pages link to (Q3474685):
Displaying 13 items.
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- On orthogonal ray trees (Q908312) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- On the intractability landscape of digraph intersection representations (Q2169961) (← links)
- Simple realizability of complete abstract topological graphs simplified (Q2189738) (← links)
- \(D\)-collapsibility is NP-complete for \(d \geq 4\) (Q2851437) (← links)
- Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes (Q2921679) (← links)
- Topological Drawings of Complete Bipartite Graphs (Q2961537) (← links)
- A Separator Theorem for String Graphs and Its Applications (Q3605480) (← links)
- Complexity of Geometric k-Planarity for Fixed k (Q5144878) (← links)
- On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
- Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
