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

Authors :: Demaine, Erik D.
Fomin, Fedor V.
Hajiaghayi, Mohammadtaghi
Thilikos, Dimitrios M.
Computer Science and Artificial Intelligence Laboratory [Cambridge] (CSAIL)
Massachusetts Institute of Technology (MIT)
Department of Informatics [Bergen] (UiB)
University of Bergen (UiB)
AT&T Laboratories
Department of Mathematics [Athens]
National and Kapodistrian University of Athens (NKUA)
Algorithmes, Graphes et Combinatoire (ALGCO)
Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM)
Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)
Source :: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 3(3), pp.51-74, 2013, ⟨10.4230/DagRep.3.3.51⟩
Publication Year :: 2013
Publisher :: HAL CCSD, 2013.
Abstract: International audience; 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.

Subjects :: Parameterized Algorithms
Treewidth
[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Graph Minors
Graph algorithms

Language :: English
Database :: OpenAIRE
Journal :: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 3(3), pp.51-74, 2013, ⟨10.4230/DagRep.3.3.51⟩
Accession number :: edsair.dedup.wf.001..53a38445949999e4d99016b6ea829826
Full Text :: https://doi.org/10.4230/DagRep.3.3.51⟩

Full Text Access

Tools