04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes

Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad. 04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes. In Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad, editors, Robust and Approximative Algorithms an Particular Graph Classes, 23.05. - 28.05.2004. Volume 04221 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2004. [doi]

@inproceedings{BrandstadtCJS04,
  title = {04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes},
  author = {Andreas Brandstädt and Derek G. Corneil and Klaus Jansen and Jeremy P. Spinrad},
  year = {2004},
  url = {http://drops.dagstuhl.de/opus/volltexte/2005/273/},
  researchr = {https://researchr.org/publication/BrandstadtCJS04},
  cites = {0},
  citedby = {0},
  booktitle = {Robust and Approximative Algorithms an Particular Graph Classes, 23.05. - 28.05.2004},
  editor = {Andreas Brandstädt and Derek G. Corneil and Klaus Jansen and Jeremy P. Spinrad},
  volume = {04221},
  series = {Dagstuhl Seminar Proceedings},
  publisher = {Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany},
}