Call for participation


Manuscripts are solicited for a special issue in the journal Discrete Optimization, on +Parameterized Complexity of Discrete Optimization+. Parameterized algorithms are proving to be useful in many areas of applied computing, and in many different ways. The growing synergy of parameterized algorithmics and algorithms engineering is targeting new application areas of Discrete Optimization where Fixed Parameter Tractability is leading to novel algorithmic approaches. With this issue we wish to foster research in this direction by exposing both new results and promising programmatic directions for further research. Potential topics include (but are not limited to) the following:

  • *Parameterized preprocessing and kernelization
  • * Parameterized complexity of local search
  • * Color coding
  • *Treewidth in Discrete Optimization
  • * Parameterized Discrete Optimization algorithms of practical running time
  • * Algorithms engineering and new practical application areas of FPT algorithms

Submissions can be done through the journal submission system. The authors should indicate that the submission is for this special issue. Submissions must be received before November 15, 2009 (the deadline is extended). Papers will be refereed according to the standards of Discrete Optimization. We promise to do our best to have the refereeing Finished in a timely manner. Please contact the guest editors (Mike Fellows, Fedor V. Fomin and Gregory Gutin) for additional information.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License