Open Problems

Open Problems collected for the 2014 School on Parameterized Complexity in Bedlewo, Poland are here (14 pages).

Open Problems from WORKER 2013 and its update meeting on graph separation problems are
here (5 pages) and here (4 pages).

Open Problems from WORKER 2010 are here (7 pages).

''The Computer Journal'' 2008. The Foreword is a catalog of recently emerging subprograms. TWO issues totaling 15 surveys on Parameterized Complexity. The Computer Journal, Volume 51, Number 1 and Number 3, 2008.

''Open Problems in Parameterized and Exact Computation - IWPEC 2008'',
Hans L. Bodlaender, Erik D. Demaine, Michael R. Fellows, Jiong Guo, Danny Hermelin, Daniel Lokshtanov, Moritz Müller, Venkatesh Raman, Johan van Rooij, Frances A. Rosamond located on the Technical Reports website of Hans Bodlaender.

''Open Problems in Parameterized and Exact Computation - IWPEC 2006'',
Hans L. Bodlaender, Leizhen Cai, Jianer Chen, Michael R. Fellows, Jan Arne Telle, Dániel Marx.
located on the Technical Reports website of Hans Bodlaender.

Exact Algorithms and Fixed-Parameter Tractability-
Dagstuhl Seminar 05301, July 2005.
Organizers: Rod Downey, Martin Grohe, M. Hallett, Gerhard Woeginger.
Summary from the Dagstuhl Seminar Site.

"Open Problems in Learning Theory: Small is Beautiful-COLT 2003". Some of these open problems relate to Parameterized Complexity.
Open Problem Summary from ''COLT".

"The Parameterized Complexity of Some Fundamental Problems in Coding Theory," Rod G. Downey, Michael R. Fellows, Alexander Vardy, Geoff Whittle. (A bit dated but maybe still useful.) CDMTCS 1997

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