Pages that link to "Item:Q1176321"

The following pages link to Some provably hard crossing number problems (Q1176321):

Displaying 43 items.

• Recognition and complexity of point visibility graphs (Q512262) (← links)
• Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
• The complexity of tensor rank (Q722207) (← links)
• On the crossing number of complete graphs (Q817025) (← links)
• A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
• On the maximum crossing number (Q1642684) (← links)
• The crossing number of locally twisted cubes \(L T Q_n\) (Q1671371) (← links)
• Crossing numbers and stress of random graphs (Q1725756) (← links)
• The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
• Crossing minimization for symmetries (Q1780845) (← links)
• Which crossing number is it anyway? (Q1850498) (← links)
• Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
• Parameterized analysis and crossing minimization problems (Q2172859) (← links)
• Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
• Drawing borders efficiently (Q2272197) (← links)
• Approximating the rectilinear crossing number (Q2331210) (← links)
• On the realisability of double-cross matrices by polylines in the plane (Q2396825) (← links)
• Approximating the Maximum Rectilinear Crossing Number (Q2817887) (← links)
• Approximating the Rectilinear Crossing Number (Q2961535) (← links)
• On the Pseudolinear Crossing Number (Q2978177) (← links)
• SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS (Q3459356) (← links)
• An optimality criterion for the crossing number (Q3535840) (← links)
• The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
• (Q4457000) (← links)
• An ILP-based Proof System for the Crossing Number Problem (Q4606298) (← links)
• Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas (Q4706191) (← links)
• The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
• Smoothing the Gap Between NP and ER (Q5071086) (← links)
• (Q5075824) (← links)
• Crossing Numbers of Beyond-Planar Graphs Revisited (Q5084712) (← links)
• Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
• Crossing Number Problems (Q5680151) (← links)
• On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
• Crossing minimization in perturbed drawings (Q5896138) (← links)
• Crossing numbers of beyond-planar graphs (Q5918404) (← links)
• Crossing numbers of beyond-planar graphs (Q5918988) (← links)
• The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
• (Q6124760) (← links)
• Topological art in simple galleries (Q6204773) (← links)
• Beyond the Existential Theory of the Reals (Q6489317) (← links)
• Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems (Q6566472) (← links)
• Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)
• A practical algorithm with performance guarantees for the art gallery problem (Q6599806) (← links)