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. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 Dagstuhl Seminar Proceedings 07211- Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad: 07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team