Pages that link to "Item:Q2867071"
From MaRDI portal
The following pages link to The Fine Details of Fast Dynamic Programming over Tree Decompositions (Q2867071):
Displaying 26 items.
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- Practical access to dynamic programming on tree decompositions (Q2005578) (← links)
- Optimal tree decompositions revisited: a simpler linear-time FPT algorithm (Q2056889) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- Space-efficient vertex separators for treewidth (Q2165026) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- Sketched representations and orthogonal planarity of bounded treewidth graphs (Q2206871) (← links)
- Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory (Q2303285) (← links)
- \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- Speeding Up Dynamic Programming with Representative Sets (Q2867093) (← links)
- Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning (Q2985109) (← links)
- (Q3304125) (← links)
- (Q4691905) (← links)
- Practical Access to Dynamic Programming on Tree Decompositions (Q5009563) (← links)
- On the k-rainbow domination in graphs with bounded tree-width (Q5061680) (← links)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action (Q5111876) (← links)
- Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization (Q5391754) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- (Q5874546) (← links)
- An efficient algorithm to compute the toughness in graphs with bounded treewidth (Q6616440) (← links)