Skip to content
cs-conference-ranking.org

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

Radu Curticapean

VenueA*ICALP
Year2013
ProceedingsICALP (1)
DBLP recordconf/icalp/Curticapean13 ↗

Browse the full ICALP paper archive.