Pages that link to "Item:Q5449535"

The following pages link to Dynamic Programming and Fast Matrix Multiplication (Q5449535):

Displaying 19 items.

• (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
• New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
• A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
• Subexponential parameterized algorithms (Q458457) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
• On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
• Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
• Computational study on planar dominating set problem (Q1040587) (← links)
• Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
• Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
• Twin-width and polynomial kernels (Q2093574) (← 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)
• Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
• On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
• Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
• On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590) (← links)
• (Q5090377) (← links)