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.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- Clifford algebras meet tree decompositions (Q1725639) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Many-visits TSP revisited (Q2051856) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- A generic convolution algorithm for join operations on tree decompositions (Q2117110) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- A new upper bound for the traveling salesman problem in cubic graphs (Q2250536) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)