Published in: Dagstuhl Reports, Volume 13, Issue 4 (2023)
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, and Liana Khazaliya. New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162). In Dagstuhl Reports, Volume 13, Issue 4, pp. 58-97, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{ganian_et_al:DagRep.13.4.58, author = {Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav and Khazaliya, Liana}, title = {{New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)}}, pages = {58--97}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2023}, volume = {13}, number = {4}, editor = {Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav and Khazaliya, Liana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.4.58}, URN = {urn:nbn:de:0030-drops-192393}, doi = {10.4230/DagRep.13.4.58}, annote = {Keywords: algorithm design, computational geometry, graph drawing, parameterized complexity} }
Published in: LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
Tom Marty, Tristan François, Pierre Tessier, Louis Gautier, Louis-Martin Rousseau, and Quentin Cappart. Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 25:1-25:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{marty_et_al:LIPIcs.CP.2023.25, author = {Marty, Tom and Fran\c{c}ois, Tristan and Tessier, Pierre and Gautier, Louis and Rousseau, Louis-Martin and Cappart, Quentin}, title = {{Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {25:1--25:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.25}, URN = {urn:nbn:de:0030-drops-190625}, doi = {10.4230/LIPIcs.CP.2023.25}, annote = {Keywords: Branching heuristic, Deep reinforcement learning} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, and Nicola Prezza. Sorting Finite Automata via Partition Refinement. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 15:1-15:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{becker_et_al:LIPIcs.ESA.2023.15, author = {Becker, Ruben and C\'{a}ceres, Manuel and Cenzato, Davide and Kim, Sung-Hwan and Kodric, Bojana and Olivares, Francisco and Prezza, Nicola}, title = {{Sorting Finite Automata via Partition Refinement}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.15}, URN = {urn:nbn:de:0030-drops-186684}, doi = {10.4230/LIPIcs.ESA.2023.15}, annote = {Keywords: Wheeler automata, prefix sorting, pattern matching, graph compression, sorting, partition refinement} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, and Erik Jan van Leeuwen. Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 18:1-18:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{bergougnoux_et_al:LIPIcs.ESA.2023.18, author = {Bergougnoux, Benjamin and Chekan, Vera and Ganian, Robert and Kant\'{e}, Mamadou Moustapha and Mnich, Matthias and Oum, Sang-il and Pilipczuk, Micha{\l} and van Leeuwen, Erik Jan}, title = {{Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {18:1--18:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.18}, URN = {urn:nbn:de:0030-drops-186710}, doi = {10.4230/LIPIcs.ESA.2023.18}, annote = {Keywords: Parameterized complexity, shrubdepth, space complexity, algebraic methods} }
Published in: LITES, Volume 8, Issue 2 (2022): Special Issue on Distributed Hybrid Systems. Leibniz Transactions on Embedded Systems, Volume 8, Issue 2
LITES, Volume 8, Issue 2: Special Issue on Distributed Hybrid Systems, pp. 0:i-0:iii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Article{abate_et_al:LITES.8.2.0, author = {Abate, Alessandro and Fahrenberg, Uli and Fr\"{a}nzle, Martin}, title = {{Introduction to the Special Issue on Distributed Hybrid Systems}}, journal = {Leibniz Transactions on Embedded Systems}, pages = {00:1--00:3}, ISSN = {2199-2002}, year = {2022}, volume = {8}, number = {2}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LITES.8.2.0}, doi = {10.4230/LITES.8.2.0}, annote = {Keywords: Distributed hybrid systems} }
Published in: Dagstuhl Reports, Volume 12, Issue 1 (2022)
Mohamed Mokbel, Mahmoud Sakr, Li Xiong, Andreas Züfle, Jussara Almeida, Taylor Anderson, Walid Aref, Gennady Andrienko, Natalia Andrienko, Yang Cao, Sanjay Chawla, Reynold Cheng, Panos Chrysanthis, Xiqi Fei, Gabriel Ghinita, Anita Graser, Dimitrios Gunopulos, Christian Jensen, Joon-Sook Kim, Kyoung-Sook Kim, Peer Kröger, John Krumm, Johannes Lauer, Amr Magdy, Mario Nascimento, Siva Ravada, Matthias Renz, Dimitris Sacharidis, Cyrus Shahabi, Flora Salim, Mohamed Sarwat, Maxime Schoemans, Bettina Speckmann, Egemen Tanin, Yannis Theodoridis, Kristian Torp, Goce Trajcevski, Marc van Kreveld, Carola Wenk, Martin Werner, Raymond Wong, Song Wu, Jianqiu Xu, Moustafa Youssef, Demetris Zeinalipour, Mengxuan Zhang, and Esteban Zimányi. Mobility Data Science (Dagstuhl Seminar 22021). In Dagstuhl Reports, Volume 12, Issue 1, pp. 1-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Article{mokbel_et_al:DagRep.12.1.1, author = {Mokbel, Mohamed and Sakr, Mahmoud and Xiong, Li and Z\"{u}fle, Andreas and Almeida, Jussara and Anderson, Taylor and Aref, Walid and Andrienko, Gennady and Andrienko, Natalia and Cao, Yang and Chawla, Sanjay and Cheng, Reynold and Chrysanthis, Panos and Fei, Xiqi and Ghinita, Gabriel and Graser, Anita and Gunopulos, Dimitrios and Jensen, Christian and Kim, Joon-Sook and Kim, Kyoung-Sook and Kr\"{o}ger, Peer and Krumm, John and Lauer, Johannes and Magdy, Amr and Nascimento, Mario and Ravada, Siva and Renz, Matthias and Sacharidis, Dimitris and Shahabi, Cyrus and Salim, Flora and Sarwat, Mohamed and Schoemans, Maxime and Speckmann, Bettina and Tanin, Egemen and Theodoridis, Yannis and Torp, Kristian and Trajcevski, Goce and van Kreveld, Marc and Wenk, Carola and Werner, Martin and Wong, Raymond and Wu, Song and Xu, Jianqiu and Youssef, Moustafa and Zeinalipour, Demetris and Zhang, Mengxuan and Zim\'{a}nyi, Esteban}, title = {{Mobility Data Science (Dagstuhl Seminar 22021)}}, pages = {1--34}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2022}, volume = {12}, number = {1}, editor = {Mokbel, Mohamed and Sakr, Mahmoud and Xiong, Li and Z\"{u}fle, Andreas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.12.1.1}, URN = {urn:nbn:de:0030-drops-169190}, doi = {10.4230/DagRep.12.1.1}, annote = {Keywords: Spatio-temporal, Tracking, Privacy, Behavior, Data cleaning, Data management, Analytics} }
Published in: Dagstuhl Reports, Volume 11, Issue 6 (2021)
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, and Meirav Zehavi. Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). In Dagstuhl Reports, Volume 11, Issue 6, pp. 82-123, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Article{ganian_et_al:DagRep.11.6.82, author = {Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav}, title = {{Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)}}, pages = {82--123}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2021}, volume = {11}, number = {6}, editor = {Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.6.82}, URN = {urn:nbn:de:0030-drops-155817}, doi = {10.4230/DagRep.11.6.82}, annote = {Keywords: exact computation, graph algorithms, graph drawing, parameterized complexity} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Martin Held and Stefan de Lorenzo. An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 56:1-56:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{held_et_al:LIPIcs.ESA.2020.56, author = {Held, Martin and de Lorenzo, Stefan}, title = {{An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {56:1--56:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.56}, URN = {urn:nbn:de:0030-drops-129224}, doi = {10.4230/LIPIcs.ESA.2020.56}, annote = {Keywords: Voronoi Diagram, multiplicative weight, additive weight, arc expansion, overlay arrangement, implementation, experiments, CGAL, exact arithmetic} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Günther Eder, Martin Held, and Peter Palfrader. On Implementing Straight Skeletons: Challenges and Experiences. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 38:1-38:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{eder_et_al:LIPIcs.SoCG.2020.38, author = {Eder, G\"{u}nther and Held, Martin and Palfrader, Peter}, title = {{On Implementing Straight Skeletons: Challenges and Experiences}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {38:1--38:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.38}, URN = {urn:nbn:de:0030-drops-121964}, doi = {10.4230/LIPIcs.SoCG.2020.38}, annote = {Keywords: weighted straight skeleton, implementation, algorithm engineering, experiments, Cgal, Core} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Günther Eder, Martin Held, and Peter Palfrader. Step-By-Step Straight Skeletons (Media Exposition). In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 76:1-76:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{eder_et_al:LIPIcs.SoCG.2020.76, author = {Eder, G\"{u}nther and Held, Martin and Palfrader, Peter}, title = {{Step-By-Step Straight Skeletons}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {76:1--76:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.76}, URN = {urn:nbn:de:0030-drops-122343}, doi = {10.4230/LIPIcs.SoCG.2020.76}, annote = {Keywords: weighted straight skeleton, implementation, visualization, graphical user interface, education} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Günther Eder, Martin Held, Stefan de Lorenzo, and Peter Palfrader. Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge). In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 85:1-85:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{eder_et_al:LIPIcs.SoCG.2020.85, author = {Eder, G\"{u}nther and Held, Martin and de Lorenzo, Stefan and Palfrader, Peter}, title = {{Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {85:1--85:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.85}, URN = {urn:nbn:de:0030-drops-122438}, doi = {10.4230/LIPIcs.SoCG.2020.85}, annote = {Keywords: Computational Geometry, geometric optimization, algorithm engineering, convex decomposition} }
Published in: Dagstuhl Reports, Volume 1, Issue 6 (2011)
Martin Dyer, Uriel Feige, Alan M. Frieze, and Marek Karpinski. Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). In Dagstuhl Reports, Volume 1, Issue 6, pp. 24-53, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@Article{dyer_et_al:DagRep.1.6.24, author = {Dyer, Martin and Feige, Uriel and Frieze, Alan M. and Karpinski, Marek}, title = {{Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)}}, pages = {24--53}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2011}, volume = {1}, number = {6}, editor = {Dyer, Martin and Feige, Uriel and Frieze, Alan M. and Karpinski, Marek}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.1.6.24}, URN = {urn:nbn:de:0030-drops-32585}, doi = {10.4230/DagRep.1.6.24}, annote = {Keywords: Randomized Algorithms, Approximation Algorithms, Probabilistically Checkable Proofs, Approximation Hardness, Optimization Problems, Counting Problems, Streaming Algorithms, Random Graphs, Hypergraphs, Probabilistic Method, Networks, Linear Programs, Semidefinite Programs} }
Published in: Dagstuhl Reports, Volume 1, Issue 5 (2011)
Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, and Ross McConnell. Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). In Dagstuhl Reports, Volume 1, Issue 5, pp. 29-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@Article{brandstadt_et_al:DagRep.1.5.29, author = {Brandst\"{a}dt, Andreas and Golumbic, Martin Charles and Heggernes, Pinar and McConnell, Ross}, title = {{Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182)}}, pages = {29--46}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2011}, volume = {1}, number = {5}, editor = {Brandst\"{a}dt, Andreas and Golumbic, Martin Charles and Heggernes, Pinar and McConnell, Ross}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.1.5.29}, URN = {urn:nbn:de:0030-drops-32027}, doi = {10.4230/DagRep.1.5.29}, annote = {Keywords: Graph Classes, Graph Algorithms, NP-completeness, Width Parameters, Approximation Algorithms, Parameterized Complexity} }
Published in: Dagstuhl Seminar Proceedings, Volume 10451, Runtime Verification, Diagnosis, Planning and Control for Autonomous Systems (2011)
Klaus Havelund, Martin Leucker, Martin Sachenbacher, Oleg Sokolsky, and Brian C. Williams. 10451 Abstracts Collection – Runtime Verification, Diagnosis, Planning and Control for Autonomous Systems. In Runtime Verification, Diagnosis, Planning and Control for Autonomous Systems. Dagstuhl Seminar Proceedings, Volume 10451, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{havelund_et_al:DagSemProc.10451.1, author = {Havelund, Klaus and Leucker, Martin and Sachenbacher, Martin and Sokolsky, Oleg and Williams, Brian C.}, title = {{10451 Abstracts Collection – Runtime Verification, Diagnosis, Planning and Control for Autonomous Systems}}, booktitle = {Runtime Verification, Diagnosis, Planning and Control for Autonomous Systems}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10451}, editor = {Klaus Havelund and Martin Leucker and Martin Sachenbacher and Oleg Sokolsky and Brian C. Williams}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10451.1}, URN = {urn:nbn:de:0030-drops-29487}, doi = {10.4230/DagSemProc.10451.1}, annote = {Keywords: Runtime Verification, Model-based Diagnosis, Planning, Control, Autonomous Systems} }
Published in: Dagstuhl Seminar Proceedings, Volume 10451, Runtime Verification, Diagnosis, Planning and Control for Autonomous Systems (2011)
Klaus Havelund, Martin Leucker, Martin Sachenbacher, Oleg Sokolsky, and Brian C. Williams. 10451 Executive Summary – Runtime Verification, Diagnosis, Planning and Control for Autonomous Systems. In Runtime Verification, Diagnosis, Planning and Control for Autonomous Systems. Dagstuhl Seminar Proceedings, Volume 10451, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{havelund_et_al:DagSemProc.10451.2, author = {Havelund, Klaus and Leucker, Martin and Sachenbacher, Martin and Sokolsky, Oleg and Williams, Brian C.}, title = {{10451 Executive Summary – Runtime Verification, Diagnosis, Planning and Control for Autonomous Systems}}, booktitle = {Runtime Verification, Diagnosis, Planning and Control for Autonomous Systems}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10451}, editor = {Klaus Havelund and Martin Leucker and Martin Sachenbacher and Oleg Sokolsky and Brian C. Williams}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10451.2}, URN = {urn:nbn:de:0030-drops-29476}, doi = {10.4230/DagSemProc.10451.2}, annote = {Keywords: Runtime Verification, Model-based Diagnosis, Planning, Control, Autonomous Systems} }
Feedback for Dagstuhl Publishing