07281 Abstracts Collection – Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs

2007/01/01 by Erik D. Demaine, Gregory Gutin, Demaine, Erik +5 · 1 citation
Computer Science · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems

paper · doi:10.4230/dagsemproc.07281.1

Abstract

From 8th to 13th July 2007, the Dagstuhl Seminar ``Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cited by

• Representative sets and irrelevant vertices: New tools for kernelization

Related

• 07281 Open Problems – Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs
• 07211 Abstracts Collection – Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes
• 04221 Abstracts Collection – Robust and Approximative Algorithms on Particular Graph Classes
• 07441 Abstracts Collection – Algorithmic-Logical Theory of Infinite Structures
• 05291 Abstracts Collection – Sublinear Algorithms