License
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.3.3.51
URN: urn:nbn:de:0030-drops-40131
URL: http://drops.dagstuhl.de/opus/volltexte/2013/4013/
Go back to Dagstuhl Reports


Demaine, Erik D. ; Fomin, Fedor V. ; Hajiaghayi, MohammadTaghi ; Thilikos, Dimitrios M.
Weitere Beteiligte (Hrsg. etc.): Erik D. Demaine and Fedor V. Fomin and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos

Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)

pdf-format:
dagrep_v003_i003_p051_s13121.pdf (1 MB)


Abstract

We provide a report on the Dagstuhl Seminar 13121: "Bidimensional Structures: Algorithms, Combinatorics and Logic" held at Schloss Dagstuhl in Wadern, Germany between Monday 18 and Friday 22 of March 2013. The report contains the motivation of the seminar, the abstracts of the talks given during the seminar, and the list of open problems.

BibTeX - Entry

@Article{demaine_et_al:DR:2013:4013,
  author =	{Erik D. Demaine and Fedor V. Fomin and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos},
  title =	{{Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)}},
  pages =	{51--74},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{3},
  editor =	{Erik D. Demaine and Fedor V. Fomin and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4013},
  URN =		{urn:nbn:de:0030-drops-40131},
  doi =		{10.4230/DagRep.3.3.51},
  annote =	{Keywords: Graph Minors, Treewidth, Graph algorithms, Parameterized Algorithms}
}

Keywords: Graph Minors, Treewidth, Graph algorithms, Parameterized Algorithms
Seminar: Dagstuhl Reports, Volume 3, Issue 3
Issue Date: 2013
Date of publication: 24.07.2013


DROPS-Home | Fulltext Search | Imprint Published by LZI