Peter Damaschke. Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. In Jianer Chen, Fedor V. Fomin, editors, Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers. Volume 5917 of Lecture Notes in Computer Science, pages 110-121, Springer, 2009. [doi]
@inproceedings{Damaschke09a,
title = {Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover},
author = {Peter Damaschke},
year = {2009},
doi = {10.1007/978-3-642-11269-0_9},
url = {http://dx.doi.org/10.1007/978-3-642-11269-0_9},
tags = {case study},
researchr = {https://researchr.org/publication/Damaschke09a},
cites = {0},
citedby = {0},
pages = {110-121},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers},
editor = {Jianer Chen and Fedor V. Fomin},
volume = {5917},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-11268-3},
}