Dagstuhl Seminar Proceedings: Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes 2007

> 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/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
- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/BrandstadtJKS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/BrandstadtJKS07
Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad:
07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes.
- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/LeR07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/LeR07
Van Bang Le, H. N. de Ridder:
Linear-time certifying recognition for partitioned probe cographs.

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.