Published in: LIPIcs, Volume 148, 14th International Symposium on Parameterized and Exact Computation (IPEC 2019)
Till Fluschnik, Rolf Niedermeier, Valentin Rohm, and Philipp Zschoche. Multistage Vertex Cover. In 14th International Symposium on Parameterized and Exact Computation (IPEC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 148, pp. 14:1-14:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{fluschnik_et_al:LIPIcs.IPEC.2019.14, author = {Fluschnik, Till and Niedermeier, Rolf and Rohm, Valentin and Zschoche, Philipp}, title = {{Multistage Vertex Cover}}, booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)}, pages = {14:1--14:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-129-0}, ISSN = {1868-8969}, year = {2019}, volume = {148}, editor = {Jansen, Bart M. P. and Telle, Jan Arne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.14}, URN = {urn:nbn:de:0030-drops-114753}, doi = {10.4230/LIPIcs.IPEC.2019.14}, annote = {Keywords: NP-hardness, dynamic graph problems, temporal graphs, time-evolving networks, W\lbrack1\rbrack-hardness, fixed-parameter tractability, kernelization} }
Published in: LIPIcs, Volume 115, 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, and Rolf Morel. Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 3:1-3:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{vangeffen_et_al:LIPIcs.IPEC.2018.3, author = {van Geffen, Bas A. M. and Jansen, Bart M. P. and de Kroon, Arnoud A. W. M. and Morel, Rolf}, title = {{Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {3:1--3:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.3}, URN = {urn:nbn:de:0030-drops-102049}, doi = {10.4230/LIPIcs.IPEC.2018.3}, annote = {Keywords: planarization, dominating set, cutwidth, lower bounds, strong exponential time hypothesis} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, and Gaurav Rattan. The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 13:1-13:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{arvind_et_al:LIPIcs.MFCS.2016.13, author = {Arvind, Vikraman and Fuhlbr\"{u}ck, Frank and K\"{o}bler, Johannes and Kuhnert, Sebastian and Rattan, Gaurav}, title = {{The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {13:1--13:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.13}, URN = {urn:nbn:de:0030-drops-64294}, doi = {10.4230/LIPIcs.MFCS.2016.13}, annote = {Keywords: parameterized complexity, graph automorphism, fixing number, base size, individualization} }
Published in: LIPIcs, Volume 45, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, and Manuel Sorge. The Parameterized Complexity of the Minimum Shared Edges Problem. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 448-462, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{fluschnik_et_al:LIPIcs.FSTTCS.2015.448, author = {Fluschnik, Till and Kratsch, Stefan and Niedermeier, Rolf and Sorge, Manuel}, title = {{The Parameterized Complexity of the Minimum Shared Edges Problem}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {448--462}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.448}, URN = {urn:nbn:de:0030-drops-56323}, doi = {10.4230/LIPIcs.FSTTCS.2015.448}, annote = {Keywords: Parameterized complexity, kernelization, treewidth, treewidth reduction} }
Published in: Dagstuhl Seminar Proceedings, Volume 6031, Organic Computing - Controlled Emergence (2006)
Kirstie Bellman, Peter Hofmann, Christian Müller-Schloer, Hartmut Schmeck, and Rolf P. Würtz. 06031 Abstracts Collection – Organic Computing – Controlled Emergence. In Organic Computing - Controlled Emergence. Dagstuhl Seminar Proceedings, Volume 6031, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{bellman_et_al:DagSemProc.06031.1, author = {Bellman, Kirstie and Hofmann, Peter and M\"{u}ller-Schloer, Christian and Schmeck, Hartmut and W\"{u}rtz, Rolf P.}, title = {{06031 Abstracts Collection – Organic Computing – Controlled Emergence}}, booktitle = {Organic Computing - Controlled Emergence}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6031}, editor = {Kirstie Bellman and Peter Hofmann and Christian M\"{u}ller-Schloer and Hartmut Schmeck and Rolf W\"{u}rtz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06031.1}, URN = {urn:nbn:de:0030-drops-5777}, doi = {10.4230/DagSemProc.06031.1}, annote = {Keywords: Emergence, self-organization, self-configuration, self-healing, self-protection, self-explaining, context-awareness} }
Published in: Dagstuhl Seminar Proceedings, Volume 6031, Organic Computing - Controlled Emergence (2006)
Kirstie Bellman, Peter Hofmann, Christian Müller-Schloer, Hartmut Schmeck, and Rolf P. Würtz. 06031 Executive Summary – Organic Computing – Controlled Emergence. In Organic Computing - Controlled Emergence. Dagstuhl Seminar Proceedings, Volume 6031, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{bellman_et_al:DagSemProc.06031.2, author = {Bellman, Kirstie and Hofmann, Peter and M\"{u}ller-Schloer, Christian and Schmeck, Hartmut and W\"{u}rtz, Rolf P.}, title = {{06031 Executive Summary – Organic Computing – Controlled Emergence}}, booktitle = {Organic Computing - Controlled Emergence}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6031}, editor = {Kirstie Bellman and Peter Hofmann and Christian M\"{u}ller-Schloer and Hartmut Schmeck and Rolf W\"{u}rtz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06031.2}, URN = {urn:nbn:de:0030-drops-5788}, doi = {10.4230/DagSemProc.06031.2}, annote = {Keywords: Emergence, self-organization, self-configuration, self-healing, self-protection, self-explaining, context-awareness} }
Published in: Dagstuhl Seminar Proceedings, Volume 6031, Organic Computing - Controlled Emergence (2006)
Günter Westphal, Christoph von der Malsburg, and Rolf P. Würtz. Feature-driven Emergence of Model Graphs for Object Recognition and Categorization. In Organic Computing - Controlled Emergence. Dagstuhl Seminar Proceedings, Volume 6031, pp. 1-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{westphal_et_al:DagSemProc.06031.5, author = {Westphal, G\"{u}nter and von der Malsburg, Christoph and W\"{u}rtz, Rolf P.}, title = {{Feature-driven Emergence of Model Graphs for Object Recognition and Categorization}}, booktitle = {Organic Computing - Controlled Emergence}, pages = {1--46}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6031}, editor = {Kirstie Bellman and Peter Hofmann and Christian M\"{u}ller-Schloer and Hartmut Schmeck and Rolf W\"{u}rtz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06031.5}, URN = {urn:nbn:de:0030-drops-5756}, doi = {10.4230/DagSemProc.06031.5}, annote = {Keywords: Graph matching, recognition, categorization, computer vision, self-organization, emergence} }
Feedback for Dagstuhl Publishing