Pages that link to "Item:Q2908548"

The following pages link to What’s Next? Future Directions in Parameterized Complexity (Q2908548):

Displaying 16 items.

• Edge bipartization faster than \(2^k\) (Q666655) (← links)
• Parameterized resiliency problems (Q2330129) (← links)
• A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808) (← links)
• Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
• Parametrized complexity: New developments and research frontiers (Q2776269) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
• (Q4474097) (← links)
• Multi-Budgeted Directed Cuts (Q5009480) (← links)
• Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
• Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
• Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)
• Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)