[Back]

M. Lackner:
"On the fixed-parameter tractability of computing minimal models";
Talk: Workshop - Parameterized Complexity: Not About Graphs, Darwin, Australien; 08-05-2011 - 08-08-2011.

To date, much of the work in parameterized algorithmics has been focused in the area of graph algorithms. However, computational complexity is an issue that arises everywhere.

The focus of the workshop is on reporting new advances regarding the parameterized computational complexity of problems in algebra, number theory, analysis, topology, game theory, geometry - anything that takes the field into new and unexplored directions of relevance. It is also focused on identifying and promoting the key unsolved problems in these new directions.

There will be an informal proceedings, published by CDU Press. We expect the discussions and presentations at the workshop to be rich with possibilities for further development of entire research areas, and programmatic themes that can be developed into future research proposals.
There will be a website devoted to open problems, progress on which we would like to see reported at the workshop, and that will in any case serve to collect and publicize key open problems to promote these new directions of parameterized complexity research.