Pages that link to "Item:Q5419118"
From MaRDI portal
The following pages link to Finding topological subgraphs is fixed-parameter tractable (Q5419118):
Displayed 50 items.
- Planar disjoint-paths completion (Q329285) (← links)
- Graph editing to a fixed target (Q344855) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Contracting planar graphs to contractions of triangulations (Q635743) (← links)
- Containment relations in split graphs (Q765349) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Parameterized complexity of set-restricted disjoint paths on chordal graphs (Q2097221) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- Mengerian temporal graphs revisited (Q2140509) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- On the complexity of the identifiable subgraph problem (Q2255039) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Characterizing graphs of small carving-width (Q2446832) (← links)
- Graphs with no 7-wheel subdivision (Q2449159) (← links)
- A Slice Theoretic Approach for Embedding Problems on Digraphs (Q2827823) (← links)
- Planar Disjoint-Paths Completion (Q2891339) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Forbidding Kuratowski Graphs as Immersions (Q2940987) (← links)
- Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
- Minimal Disconnected Cuts in Planar Graphs (Q2947884) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- (Q5079746) (← links)
- Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
- Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
- (Q5874521) (← links)
- Systematic Refinement of Abstract State Machines with Higher-Order Logic (Q5881450) (← links)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5896079) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5918671) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable (Q6075759) (← links)