Pages that link to "Item:Q4554340"
From MaRDI portal
The following pages link to Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal (Q4554340):
Displaying 32 items.
- Structural parameterizations of clique coloring (Q832512) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← links)
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs (Q2045031) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Can you beat treewidth? (Q3002818) (← links)
- Path Contraction Faster than $2^n$ (Q3300757) (← links)
- Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth (Q4984872) (← links)
- Lower bounds for dynamic programming on planar graphs of bounded cutwidth (Q5009465) (← links)
- Path Contraction Faster Than 2^n (Q5091159) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth (Q5131225) (← links)
- (Q5365080) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- (Q5874480) (← links)
- (Q5874546) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- (Q6089653) (← links)
- Induced tree covering and the generalized Yutsis property (Q6547951) (← links)
- Digraph coloring and distance to acyclicity (Q6614618) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)
