"Exact, Approximative, Robust and Certifying Algorithms on Particular Graph ..."

Andreas Brandstädt et al. (2007)

> Home

Details and statistics

DOI: —

access: open

type: Editorship

metadata version: 2021-06-10

- view
  - table of contents in dblp
  - electronic edition @ dagstuhl.de (open access)
- export record
  dblp key:
  - conf/dagstuhl/2007P7211
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/2007P7211
Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad:
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007. Dagstuhl Seminar Proceedings 07211, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents]

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.