The following pages link to Can you beat treewidth? (Q3002818):
Displaying 50 items.
- Backdoors to q-Horn (Q261394) (← links)
- Structural decompositions for problems with global constraints (Q272005) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- The treewidth of line graphs (Q723884) (← links)
- Searching and inferring colorful topological motifs in vertex-colored graphs (Q782751) (← links)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- Fractal dimension and lower bounds for geometric problems (Q2039303) (← links)
- Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Target set selection parameterized by vertex cover and more (Q2082561) (← links)
- Parameterized complexity of list coloring and max coloring (Q2097212) (← links)
- On the impact of treewidth in the computational complexity of freezing dynamics (Q2117789) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Parameterized complexity of reconfiguration of atoms (Q2154105) (← links)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- Routing with congestion in acyclic digraphs (Q2274522) (← links)
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- On tree width, bramble size, and expansion (Q2519023) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
- Preference swaps for the stable matching problem (Q2699977) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal (Q4554340) (← links)
- (Q4638077) (← links)
- Counting problems in parameterized complexity (Q5009461) (← links)
- The Parameterized Complexity of Finding Point Sets with Hereditary Properties (Q5009473) (← links)
- On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590) (← links)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760) (← links)
- (Q5088957) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- Counting Answers to Existential Questions (Q5091275) (← links)
