Pages that link to "Item:Q2347800"
From MaRDI portal
The following pages link to Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800):
Displaying 50 items.
- Dynamic parameterized problems (Q722546) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- On exploring always-connected temporal graphs of small pathwidth (Q1628692) (← links)
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- Clifford algebras meet tree decompositions (Q1725639) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- A generic convolution algorithm for join operations on tree decompositions (Q2117110) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Waypoint routing on bounded treewidth graphs (Q2234792) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (Q2314068) (← links)
- Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- On the parameterized complexity of the connected flow and many visits TSP problem (Q2672424) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- On computing the Hamiltonian index of graphs (Q2699968) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters (Q4632216) (← links)
- (Q4972036) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth (Q4984872) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- (Q5009465) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- On Computing the Hamiltonian Index of Graphs (Q5042256) (← links)
- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs (Q5042449) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
- Fast Algorithms for Join Operations on Tree Decompositions (Q5042462) (← links)
- (Q5075752) (← links)
- (Q5089192) (← links)
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
- How to Secure Matchings Against Edge Failures (Q5090488) (← links)
