Volume 19, Issue 4 (2014)
Research Articles
Some Open Problems in Parameterized Complexity Related to the Work of Jianer Chen
Michael Ralph Fellows
Dynamic Dominating Set and Turbo-Charging Greedy Heuristics
Rodney G. Downey, Judith Egan, Michael R. Fellows, Frances A. Rosamond, and Peter Shaw
Kernelization in Parameterized Computation: A Survey
Qilong Feng, Qian Zhou, Wenjun Li, and Jianxin Wang
An Overview of Kernelization Algorithms for Graph Modification Problems
Yunlong Liu, Jianxin Wang, and Jiong Guo
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, and Gerhard J. Woeginger
Social Choice Meets Graph Drawing: How to Get Subexponential Time Algorithms for Ranking and Drawing Problems
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, and Saket Saurabh
Parameter Ecology for Feedback Vertex Set
Bart M. P. Jansen, Venkatesh Raman, and Martin Vatshelle
Counting Problems in Parameterized Complexity
Chihao Zhang and Yijia Chen
