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

Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad (Eds.): 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

Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad:
07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes.
Van Bang Le, H. N. de Ridder:
Linear-time certifying recognition for partitioned probe cographs.

Copyright © Mon Mar 15 03:28:32 2010 by Michael Ley (ley@uni-trier.de)