Search dblp for Publications

export results for "toc:db/conf/dagstuhl/P4221.bht:"

 download as .bib file

@proceedings{DBLP:conf/dagstuhl/2004P4221,
  editor       = {Andreas Brandst{\"{a}}dt and
                  Derek G. Corneil and
                  Klaus Jansen and
                  Jeremy P. Spinrad},
  title        = {Robust and Approximative Algorithms an Particular Graph Classes, 23.05.
                  - 28.05.2004},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {04221},
  publisher    = {Internationales Begegnungs- und Forschungszentrum f{\"{u}}r Informatik
                  (IBFI), Schloss Dagstuhl, Germany},
  year         = {2004},
  url          = {http://drops.dagstuhl.de/portals/04221/},
  timestamp    = {Thu, 10 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/2004P4221.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dagstuhl/BrandstadtCJS04,
  author       = {Andreas Brandst{\"{a}}dt and
                  Derek G. Corneil and
                  Klaus Jansen and
                  Jeremy P. Spinrad},
  title        = {04221 Abstracts Collection - Robust and Approximative Algorithms on
                  Particular Graph Classes},
  booktitle    = {Robust and Approximative Algorithms an Particular Graph Classes},
  year         = {2004},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2005/273/},
  timestamp    = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/BrandstadtCJS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.