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

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.

[1]  Michael R. Fellows,et al.  Local Search: Is Brute-Force Avoidable? , 2009, IJCAI.

[2]  Michael R. Fellows,et al.  Nonconstructive tools for proving polynomial-time decidability , 1988, JACM.

[3]  Stefan Kratsch,et al.  Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time , 2012, ArXiv.

[4]  Ge Xia,et al.  What makes normalized weighted satisfiability tractable , 2011, ArXiv.

[5]  Maria Chudnovsky,et al.  Disjoint paths in tournaments , 2014, 1411.6226.

[6]  Bruno Courcelle,et al.  On the model-checking of monadic second-order formulas with edge set quantifications , 2012, Discret. Appl. Math..

[7]  Rolf Niedermeier,et al.  The Parameterized Complexity of Local Search for TSP, More Refined , 2011, Algorithmica.

[8]  Aleksandrs Slivkins,et al.  Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs , 2003, SIAM J. Discret. Math..

[9]  Michal Pilipczuk,et al.  Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[10]  Maya Jakobine Stein,et al.  Connectivity and tree structure in finite graphs , 2011, Comb..

[11]  Wolfgang Mader.  Über n-fach zusammenhängende Eckenmengen in Graphen , 1978, J. Comb. Theory, Ser. B.

[12]  Dániel Marx,et al.  Searching the k-change neighborhood for TSP is W[1]-hard , 2008, Oper. Res. Lett..

[13]  Cyril Gavoille,et al.  Tree-decompositions with bags of small diameter , 2007, Discret. Math..

[14]  Erik Jan van Leeuwen,et al.  Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs , 2013, STACS.

[15]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.