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

• Mike Fellows
• Fedor V. Fomin
• Gregory Gutin

Last modified by Fedor Fomin, August 17, 2009