Exact Complexity of NP-hard Problems

Keyphrases

Publications

2010

Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin
10441 Abstracts Collection - Exact Complexity of NP-hard Problems. Exact Complexity of NP-hard Problems (2010)
David Eppstein, Maarten Löffler, Darren Strash
Listing all maximal cliques in sparse graphs in near-optimal time. Exact Complexity of NP-hard Problems (2010)

volume 10441, 2010

Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010 Exact Complexity of NP-hard Problems 10441 (2010)