IWPEC 2009:
Copenhagen, Denmark
Peter Damaschke:
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms.
98-109
Peter Damaschke:
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover.
110-121
Shai Gutner:
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor.
246-257
Mikko Koivisto:
Partitioning into Sets of Bounded Cardinality.
258-263
Narges Simjour:
Improved Parameterized Algorithms for the Kemeny Aggregation Problem.
312-323
data released under the ODC-BY 1.0 license
