Pages that link to "Item:Q2799353"
From MaRDI portal
The following pages link to A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353):
Displaying 50 items.
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Connecting knowledge compilation classes and width parameters (Q778533) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Refining the complexity of the sports elimination problem (Q896666) (← links)
- Treewidth distance on phylogenetic trees (Q1637220) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Combinatorial problems on \(H\)-graphs (Q1689915) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Coloring a dominating set without conflicts: \(q\)-subset square coloring (Q2097209) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- Finding all leftmost separators of size \(\le k\) (Q2149878) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Space-efficient vertex separators for treewidth (Q2165026) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Harmless sets in sparse classes (Q2169963) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- Sketched representations and orthogonal planarity of bounded treewidth graphs (Q2206871) (← links)
- An improvement of Reed's treewidth approximation (Q2232243) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Waypoint routing on bounded treewidth graphs (Q2234792) (← links)
- Target set selection for conservative populations (Q2235265) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- Tree-coloring problems of bounded treewidth graphs (Q2292136) (← links)
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)
- Algorithms and complexity for Turaev-Viro invariants (Q2316773) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
