Pages that link to "Item:Q1022343"
From MaRDI portal
The following pages link to On two techniques of combining branching and treewidth (Q1022343):
Displaying 50 items.
- Bounds on the maximum number of minimum dominating sets (Q271624) (← links)
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Maximum matching and kernelization of edge dominating set (Q1751411) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Trimmed Moebius inversion and graphs of bounded degree (Q1959390) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) (Q2695332) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms (Q3656854) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- New Results on Directed Edge Dominating Set (Q5005171) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- (Q5090486) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)
- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set (Q5321717) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- Partially Polynomial Kernels for Set Cover and Test Cover (Q5741085) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)
- The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (Q6089670) (← links)
