Dagstuhl Seminar Proceedings: Robust and Approximative Algorithms an Particular Graph Classes 2004

> 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)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/2004P4221
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/2004P4221
Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad:
Robust and Approximative Algorithms an Particular Graph Classes, 23.05. - 28.05.2004. Dagstuhl Seminar Proceedings 04221, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2004
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/BrandstadtCJS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/BrandstadtCJS04
Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad:
04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes.

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.