Pages that link to "Item:Q458457"

The following pages link to Subexponential parameterized algorithms (Q458457):

Displaying 24 items.

• New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
• Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
• Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
• Faster parameterized algorithms for minor containment (Q650942) (← links)
• Spanners in sparse graphs (Q657919) (← links)
• Implicit branching and parameterized partial cover problems (Q657922) (← links)
• Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
• Computational study on planar dominating set problem (Q1040587) (← links)
• Fast minor testing in planar graphs (Q1759679) (← links)
• Subexponential algorithms for partial cover problems (Q1944141) (← links)
• Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
• Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
• A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
• Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
• Bidimensionality and Kernels (Q3387764) (← links)
• (Q4972036) (← links)
• (Q5111296) (← links)
• Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
• Sublinear Computation Paradigm (Q5153706) (← links)
• Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
• (Q5365079) (← links)
• (Q5743514) (← links)