@InProceedings{demaine_et_al:DagSemProc.07281.1,
  author =	{Demaine, Erik and Gutin, Gregory Z. and Marx, Daniel and Stege, Ulrike},
  title =	{{07281 Abstracts Collection – Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs}},
  booktitle =	{Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7281},
  editor =	{Erik Demaine and Gregory Z. Gutin and Daniel Marx and Ulrike Stege},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07281.1},
  URN =		{urn:nbn:de:0030-drops-12450},
  doi =		{10.4230/DagSemProc.07281.1},
  annote =	{Keywords: Parameterized complexity, fixed-parameter tractability, graph structure theory}
}
@InProceedings{demaine_et_al:DagSemProc.07281.2,
  author =	{Demaine, Erik and Gutin, Gregory Z. and Marx, Daniel and Stege, Ulrike},
  title =	{{07281 Open Problems – Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs}},
  booktitle =	{Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7281},
  editor =	{Erik Demaine and Gregory Z. Gutin and Daniel Marx and Ulrike Stege},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07281.2},
  URN =		{urn:nbn:de:0030-drops-12542},
  doi =		{10.4230/DagSemProc.07281.2},
  annote =	{Keywords: }
}
@InProceedings{vanrooij_et_al:DagSemProc.07281.3,
  author =	{van Rooij, Iris and Hamilton, Matthew and M\"{u}ller, Moritz and Wareham, Todd},
  title =	{{Approximating Solution Structure}},
  booktitle =	{Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs},
  pages =	{1--24},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7281},
  editor =	{Erik Demaine and Gregory Z. Gutin and Daniel Marx and Ulrike Stege},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07281.3},
  URN =		{urn:nbn:de:0030-drops-12345},
  doi =		{10.4230/DagSemProc.07281.3},
  annote =	{Keywords: Approximation Algorithms, Solution Structure}
}
@InProceedings{razgon_et_al:DagSemProc.07281.4,
  author =	{Razgon, Igor and O'Sullivan, Barry},
  title =	{{Directed Feedback Vertex Set is Fixed-Parameter Tractable}},
  booktitle =	{Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7281},
  editor =	{Erik Demaine and Gregory Z. Gutin and Daniel Marx and Ulrike Stege},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07281.4},
  URN =		{urn:nbn:de:0030-drops-12363},
  doi =		{10.4230/DagSemProc.07281.4},
  annote =	{Keywords: Directed FVS, Multicut, Directed Acyclic Graph (DAG)}
}
@InProceedings{chen_et_al:DagSemProc.07281.5,
  author =	{Chen, Jianer and Liu, Yang and Lu, Songiian},
  title =	{{Directed Feedback Vertex Set Problem is FPT}},
  booktitle =	{Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7281},
  editor =	{Erik Demaine and Gregory Z. Gutin and Daniel Marx and Ulrike Stege},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07281.5},
  URN =		{urn:nbn:de:0030-drops-12333},
  doi =		{10.4230/DagSemProc.07281.5},
  annote =	{Keywords: Directed feedback vertex set problem, parameterized algorithm,}
}
@InProceedings{raible_et_al:DagSemProc.07281.6,
  author =	{Raible, Daniel and Fernau, Henning},
  title =	{{Exact Elimination of Cycles in Graphs}},
  booktitle =	{Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs},
  pages =	{1--25},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7281},
  editor =	{Erik Demaine and Gregory Z. Gutin and Daniel Marx and Ulrike Stege},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07281.6},
  URN =		{urn:nbn:de:0030-drops-12353},
  doi =		{10.4230/DagSemProc.07281.6},
  annote =	{Keywords: Maximum Acyclic Subgraph, Feedback Arc Set, Amortized Analysis, Exact exponential algorthms}
}