Counting Matchings of Size k Is W[1]-Hard

Radu Curticapean. Counting Matchings of Size k Is W[1]-Hard. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Volume 7965 of Lecture Notes in Computer Science, pages 352-363, Springer, 2013. [doi]

Authors

Radu Curticapean

This author has not been identified. Look up 'Radu Curticapean' in Google