Dagstuhl Seminar Proceedings: Exact Complexity of NP-hard Problems 2010

> Home > Series > Dagstuhl Seminar Proceedings

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/2010P10441
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/2010P10441
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
- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/HusfeldtKPS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/HusfeldtKPS10
Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
10441 Abstracts Collection - Exact Complexity of NP-hard Problems.
- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/EppsteinLS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/EppsteinLS10
David Eppstein, Maarten Löffler, Darren Strash:
Listing all maximal cliques in sparse graphs in near-optimal time.

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.