Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad. 07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. In Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad, editors, Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007. Volume 07211 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007. [doi]
@inproceedings{BrandstadtJKS07,
title = {07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes},
author = {Andreas Brandstädt and Klaus Jansen and Dieter Kratsch and Jeremy Spinrad},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/1269},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BrandstadtJKS07},
cites = {0},
citedby = {0},
booktitle = {Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007},
editor = {Andreas Brandstädt and Klaus Jansen and Dieter Kratsch and Jeremy Spinrad},
volume = {07211},
series = {Dagstuhl Seminar Proceedings},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany},
}