Open problems in parameterized algorithms and complexity

Welcome!!! This website contains open problems in parameterized algorithms and complexity. Here you can browse through various open problems by clicking on relevant labels on the right hand side. To view the full list of open problems, please click on the tab "List of open problems".

Pages

  • List of open problems
  • Contact us

List of open problems

4. A tight FPT algorithm for Line Graph Edge Deletion (open since 2013)
3. FPT algorithm for Perfect Completion (open since 2014)
2. Polynomial kernelization of Claw-free Edge Deletion (open since 2013)
1. Polynomial kernelization of Interval Completion (open since 2009)
Home
Subscribe to: Posts (Atom)

Labels

2009 (1) 2013 (2) 2014 (1) claw-free graphs (1) FPT (2) graph modification problems (4) Interval Completion (1) interval graphs (1) kernelization (2) line graphs (1) Perfect Completion (1) perfect graphs (1) unresolved (4)

Search this website

Awesome Inc. theme. Powered by Blogger.