The following pages link to (Q3549636):
Displaying 38 items.
- Algorithms for the edge-width of an embedded graph (Q419374) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- On the red/blue spanning tree problem (Q534557) (← links)
- Computing the shortest essential cycle (Q603870) (← links)
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation (Q714020) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Hardness of approximation for crossing number (Q1943651) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Bundled crossings revisited (Q2206831) (← links)
- Exact crossing number parameterized by vertex cover (Q2206863) (← links)
- Approximating the rectilinear crossing number (Q2331210) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- There are no cubic graphs on 26 vertices with crossing number 10 or 11 (Q2657046) (← links)
- Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Approximating the Rectilinear Crossing Number (Q2961535) (← links)
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (Q3007679) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Characterizing Graphs with Crossing Number at Least 2 (Q4978442) (← links)
- Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- (Q5115795) (← links)
- Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
- (Q5136229) (← links)
- Bundled Crossings Revisited (Q5141645) (← links)
- A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
- (Q5874544) (← links)
- (Q5881549) (← links)
- Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
