![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Dagstuhl Seminar Proceedings: Exact Complexity of NP-hard Problems 2010
- Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010. Dagstuhl Seminar Proceedings 10441, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 - Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
10441 Abstracts Collection - Exact Complexity of NP-hard Problems. - David Eppstein, Maarten Löffler, Darren Strash:
Listing all maximal cliques in sparse graphs in near-optimal time.
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.