Pages that link to "Item:Q1887712"

The following pages link to Computing crossing numbers in quadratic time (Q1887712):

Displaying 31 items.

• Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
• The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
• On \(k\)-planar crossing numbers (Q885282) (← links)
• Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
• On the parameterized complexity of layered graph drawing (Q958215) (← links)
• Chordal deletion is fixed-parameter tractable (Q973007) (← links)
• Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
• Hardness of approximation for crossing number (Q1943651) (← links)
• Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
• Parameterized analysis and crossing minimization problems (Q2172859) (← links)
• Exact crossing number parameterized by vertex cover (Q2206863) (← links)
• Obtaining a planar graph by vertex deletion (Q2429328) (← links)
• The early history of the brick factory problem (Q2431395) (← links)
• Crossing number is hard for cubic graphs (Q2496198) (← links)
• FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
• Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
• Deciding Parity of Graph Crossing Number (Q4578013) (← links)
• Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
• (Q4677904) (← links)
• Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
• A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
• Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
• (Q5136229) (← links)
• A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
• Approximating the Crossing Number of Toroidal Graphs (Q5387753) (← links)
• Crossing minimization in perturbed drawings (Q5896138) (← links)
• Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
• Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
• Fixed-parameter algorithms for computing RAC drawings of graphs (Q6618251) (← links)
• Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs (Q6636993) (← links)