Pages that link to "Item:Q3586082"
From MaRDI portal
The following pages link to Faster Algorithms on Branch and Clique Decompositions (Q3586082):
Displaying 14 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← 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)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- (Q5002765) (← links)
- Fast Algorithms for Join Operations on Tree Decompositions (Q5042462) (← links)
- (Q5090377) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- (Q5136270) (← links)
- Polynomial Turing compressions for some graph problems parameterized by modular-width (Q6591463) (← links)
