Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II

Venkatesh Raman, Saket Saurabh
2013 Algorithmica  
The papers in this issue form the second part of the two parts special issue in the area of parameterized and exact exponential algorithms and complexity. While some of these are selected and extended papers from International Symposium on Parameterized and Exact Computation (IPEC) 2010, the rest were selected from the submissions received for our call for the special issue in the area. The two parts reflect the volume of high quality submissions we received, which in turn reflects the high
more » ... th of the area in recent times. While some of the papers in this volume supplement the ones in the first volume in the sub areas of kernelization and improved fixed-parameter algorithms for graph modification problems, most others complement them by focusing on problems in various application domains including Petri nets, evolutionary algorithms, topology, game theory, logic and biology. The paper 'Small vertex cover makes Petri net coverability and boundedness easier' addresses two hard problems in the area of Petri nets. Coverability and boundedness problems in Petri nets are complete for the class of problems solvable in exponential space. However the paper shows that when the vertex cover number of the corresponding graph is a small parameter, these problems can be solved in space which is polynomial in the input size (with a super polynomial dependence on the vertex cover number). The paper 'Fixed-parameter evolutionary algorithms and the vertex cover problem' adopts a parameterized view to analyze the expected behavior of evolutionary algorithms. Using vertex cover as a case study, the paper explains how
doi:10.1007/s00453-013-9744-9 fatcat:j2ya4p5u7zcvlgvxwotywr7f34