Pages that link to "Item:Q5494962"
From MaRDI portal
The following pages link to Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (Q5494962):
Displaying 50 items.
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (Q2314068) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter (Q2357164) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- Simultaneous feedback edge set: a parameterized perspective (Q2659779) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
- On computing the Hamiltonian index of graphs (Q2699968) (← links)
- Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q2946421) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Euler Digraphs (Q3120436) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- (Q3304125) (← links)
- (Q3304141) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- On the Equivalence among Problems of Bounded Width (Q3452838) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
- (Q4972036) (← links)
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth (Q4984872) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)