The following pages link to (Q5365080):
Displayed 50 items.
- Data reduction for graph coloring problems (Q393081) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis (Q903190) (← links)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- A generic convolution algorithm for join operations on tree decompositions (Q2117110) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Lower bounds for protrusion replacement by counting equivalence classes (Q2174552) (← links)
- On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon (Q2245950) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- Faster exponential-time algorithms in graphs of bounded average degree (Q2347799) (← 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)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- Maximum matching width: new characterizations and a fast algorithm for dominating set (Q2413973) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- On the hardness of losing width (Q2441542) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- (Q3304104) (← links)
- (Q3304125) (← links)
- On the Equivalence among Problems of Bounded Width (Q3452838) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
- (Q4972036) (← links)
- (Q5002765) (← links)
- (Q5009465) (← links)
- On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- Fast Algorithms for Join Operations on Tree Decompositions (Q5042462) (← links)
- On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- (Q5111866) (← links)
- (Q5116488) (← links)