License
When quoting this document, please refer to the following
DOI: 10.4230/DagSemRep.312
URN: urn:nbn:de:0030-drops-151962
URL: https://drops.dagstuhl.de/opus/volltexte/2021/15196/
 


Brandst├Ądt, Andreas ; Spinrad, Jeremy P.
Weitere Beteiligte (Hrsg. etc.): Andreas Brandst├Ądt and Jeremy P. Spinrad

Graph Decompositions and Algorithmic Applications (Dagstuhl Seminar 01251)

pdf-format:
DagSemRep-312.pdf (3 MB)


BibTeX - Entry

@TechReport{brandstadt_et_al:DagSemRep.312,
  author =	{Brandst\"{a}dt, Andreas and Spinrad, Jeremy P.},
  title =	{{Graph Decompositions and Algorithmic Applications (Dagstuhl Seminar 01251)}},
  pages =	{1--20},
  ISSN =	{1619-0203},
  year =	{2002},
  type = 	{Dagstuhl Seminar Report},
  number =	{312},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/15196},
  URN =		{urn:nbn:de:0030-drops-151962},
  doi =		{10.4230/DagSemRep.312},
}

Collection: Dagstuhl Seminar Reports
Issue Date: 2021
Date of publication: 24.01.2002


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI