Search dblp for Publications

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

 download as .bib file

@proceedings{DBLP:conf/dagstuhl/2007P7211,
  editor       = {Andreas Brandst{\"{a}}dt and
                  Klaus Jansen and
                  Dieter Kratsch and
                  Jeremy P. Spinrad},
  title        = {Exact, Approximative, Robust and Certifying Algorithms on Particular
                  Graph Classes, 20.05. - 25.05.2007},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {07211},
  publisher    = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
                  (IBFI), Schloss Dagstuhl, Germany},
  year         = {2007},
  url          = {http://drops.dagstuhl.de/portals/07211/},
  timestamp    = {Thu, 10 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/2007P7211.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dagstuhl/BrandstadtJKS07,
  author       = {Andreas Brandst{\"{a}}dt and
                  Klaus Jansen and
                  Dieter Kratsch and
                  Jeremy P. Spinrad},
  editor       = {Andreas Brandst{\"{a}}dt and
                  Klaus Jansen and
                  Dieter Kratsch and
                  Jeremy P. Spinrad},
  title        = {07211 Abstracts Collection - Exact, Approximative, Robust and Certifying
                  Algorithms on Particular Graph Classes},
  booktitle    = {Exact, Approximative, Robust and Certifying Algorithms on Particular
                  Graph Classes, 20.05. - 25.05.2007},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {07211},
  publisher    = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
                  (IBFI), Schloss Dagstuhl, Germany},
  year         = {2007},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2007/1269},
  timestamp    = {Thu, 10 Jun 2021 13:02:07 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/BrandstadtJKS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dagstuhl/LeR07,
  author       = {Van Bang Le and
                  H. N. de Ridder},
  editor       = {Andreas Brandst{\"{a}}dt and
                  Klaus Jansen and
                  Dieter Kratsch and
                  Jeremy P. Spinrad},
  title        = {Linear-time certifying recognition for partitioned probe cographs},
  booktitle    = {Exact, Approximative, Robust and Certifying Algorithms on Particular
                  Graph Classes, 20.05. - 25.05.2007},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {07211},
  publisher    = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
                  (IBFI), Schloss Dagstuhl, Germany},
  year         = {2007},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2007/1270},
  timestamp    = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/LeR07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.