Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Jaroslav Garvardt, Malte Renken, Jannik Schestag, and Mathias Weller. Finding Degree-Constrained Acyclic Orientations. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{garvardt_et_al:LIPIcs.IPEC.2023.19, author = {Garvardt, Jaroslav and Renken, Malte and Schestag, Jannik and Weller, Mathias}, title = {{Finding Degree-Constrained Acyclic Orientations}}, booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-305-8}, ISSN = {1868-8969}, year = {2023}, volume = {285}, editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.19}, URN = {urn:nbn:de:0030-drops-194383}, doi = {10.4230/LIPIcs.IPEC.2023.19}, annote = {Keywords: Graph Orientation, Phylogenetic Networks, General Factor, NP-hardness, Parameterized Algorithms, Treewidth} }
Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Jaroslav Garvardt, Nils Morawietz, André Nichterlein, and Mathias Weller. Graph Clustering Problems Under the Lens of Parameterized Local Search. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{garvardt_et_al:LIPIcs.IPEC.2023.20, author = {Garvardt, Jaroslav and Morawietz, Nils and Nichterlein, Andr\'{e} and Weller, Mathias}, title = {{Graph Clustering Problems Under the Lens of Parameterized Local Search}}, booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)}, pages = {20:1--20:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-305-8}, ISSN = {1868-8969}, year = {2023}, volume = {285}, editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.20}, URN = {urn:nbn:de:0030-drops-194391}, doi = {10.4230/LIPIcs.IPEC.2023.20}, annote = {Keywords: parameterized local search, permissive local search, FPT, W\lbrack1\rbrack-hardness} }
Published in: LIPIcs, Volume 271, 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)
Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, and Armin Biere. IPASIR-UP: User Propagators for CDCL. In 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 271, pp. 8:1-8:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{fazekas_et_al:LIPIcs.SAT.2023.8, author = {Fazekas, Katalin and Niemetz, Aina and Preiner, Mathias and Kirchweger, Markus and Szeider, Stefan and Biere, Armin}, title = {{IPASIR-UP: User Propagators for CDCL}}, booktitle = {26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)}, pages = {8:1--8:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-286-0}, ISSN = {1868-8969}, year = {2023}, volume = {271}, editor = {Mahajan, Meena and Slivovsky, Friedrich}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.8}, URN = {urn:nbn:de:0030-drops-184709}, doi = {10.4230/LIPIcs.SAT.2023.8}, annote = {Keywords: SAT, CDCL, Satisfiability Modulo Theories, Satisfiability Modulo Symmetries} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Leo van Iersel, Mark Jones, and Mathias Weller. Embedding Phylogenetic Trees in Networks of Low Treewidth. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 69:1-69:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{vaniersel_et_al:LIPIcs.ESA.2022.69, author = {van Iersel, Leo and Jones, Mark and Weller, Mathias}, title = {{Embedding Phylogenetic Trees in Networks of Low Treewidth}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {69:1--69:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva 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.2022.69}, URN = {urn:nbn:de:0030-drops-170070}, doi = {10.4230/LIPIcs.ESA.2022.69}, annote = {Keywords: fixed-parameter tractability, treewidth, phylogenetic tree, phylogenetic network, display graph, tree containment, embedding} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Lars Arge, Mathias Rav, Morten Revsbæk, Yujin Shin, and Jungwoo Yang. Sea-Rise Flooding on Massive Dynamic Terrains. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 6:1-6:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{arge_et_al:LIPIcs.SWAT.2020.6, author = {Arge, Lars and Rav, Mathias and Revsb{\ae}k, Morten and Shin, Yujin and Yang, Jungwoo}, title = {{Sea-Rise Flooding on Massive Dynamic Terrains}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {6:1--6:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-150-4}, ISSN = {1868-8969}, year = {2020}, volume = {162}, editor = {Albers, Susanne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.6}, URN = {urn:nbn:de:0030-drops-122539}, doi = {10.4230/LIPIcs.SWAT.2020.6}, annote = {Keywords: Computational geometry, I/O-algorithms, merge tree, dynamic terrain} }
Published in: LIPIcs, Volume 114, 10th International Conference on Geographic Information Science (GIScience 2018)
René Westerholt, Mathias Gröbe, Alexander Zipf, and Dirk Burghardt. Towards the Statistical Analysis and Visualization of Places (Short Paper). In 10th International Conference on Geographic Information Science (GIScience 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 114, pp. 63:1-63:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{westerholt_et_al:LIPIcs.GISCIENCE.2018.63, author = {Westerholt, Ren\'{e} and Gr\"{o}be, Mathias and Zipf, Alexander and Burghardt, Dirk}, title = {{Towards the Statistical Analysis and Visualization of Places}}, booktitle = {10th International Conference on Geographic Information Science (GIScience 2018)}, pages = {63:1--63:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-083-5}, ISSN = {1868-8969}, year = {2018}, volume = {114}, editor = {Winter, Stephan and Griffin, Amy and Sester, Monika}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GISCIENCE.2018.63}, URN = {urn:nbn:de:0030-drops-93914}, doi = {10.4230/LIPIcs.GISCIENCE.2018.63}, annote = {Keywords: Platial Analysis, Visualization, Statistics, Geosocial Media} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Anders Aamand, Mathias Bæk Tejs Knudsen, and Mikkel Thorup. Power of d Choices with Simple Tabulation. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 5:1-5:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{aamand_et_al:LIPIcs.ICALP.2018.5, author = {Aamand, Anders and B{\ae}k Tejs Knudsen, Mathias and Thorup, Mikkel}, title = {{Power of d Choices with Simple Tabulation}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.5}, URN = {urn:nbn:de:0030-drops-90096}, doi = {10.4230/LIPIcs.ICALP.2018.5}, annote = {Keywords: Hashing, Load Balancing, Balls and Bins, Simple Tabulation} }
Published in: LIPIcs, Volume 90, 24th International Symposium on Temporal Representation and Reasoning (TIME 2017)
Mathias Etcheverry and Dina Wonsever. Time Expressions Recognition with Word Vectors and Neural Networks. In 24th International Symposium on Temporal Representation and Reasoning (TIME 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 90, pp. 12:1-12:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{etcheverry_et_al:LIPIcs.TIME.2017.12, author = {Etcheverry, Mathias and Wonsever, Dina}, title = {{Time Expressions Recognition with Word Vectors and Neural Networks}}, booktitle = {24th International Symposium on Temporal Representation and Reasoning (TIME 2017)}, pages = {12:1--12:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-052-1}, ISSN = {1868-8969}, year = {2017}, volume = {90}, editor = {Schewe, Sven and Schneider, Thomas and Wijsen, Jef}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2017.12}, URN = {urn:nbn:de:0030-drops-79253}, doi = {10.4230/LIPIcs.TIME.2017.12}, annote = {Keywords: Natural Language Processing, Time Expressions, Word Embeddings, Neural Networks} }
Published in: LIPIcs, Volume 84, 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)
Jasmin Christian Blanchette, Mathias Fleury, and Dmitriy Traytel. Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL. In 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 84, pp. 11:1-11:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{blanchette_et_al:LIPIcs.FSCD.2017.11, author = {Blanchette, Jasmin Christian and Fleury, Mathias and Traytel, Dmitriy}, title = {{Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL}}, booktitle = {2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)}, pages = {11:1--11:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-047-7}, ISSN = {1868-8969}, year = {2017}, volume = {84}, editor = {Miller, Dale}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2017.11}, URN = {urn:nbn:de:0030-drops-77155}, doi = {10.4230/LIPIcs.FSCD.2017.11}, annote = {Keywords: Multisets, ordinals, proof assistants} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Mathias Bæk Tejs Knudsen. Additive Spanners and Distance Oracles in Quadratic Time. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 64:1-64:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{knudsen:LIPIcs.ICALP.2017.64, author = {Knudsen, Mathias B{\ae}k Tejs}, title = {{Additive Spanners and Distance Oracles in Quadratic Time}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {64:1--64:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.64}, URN = {urn:nbn:de:0030-drops-73924}, doi = {10.4230/LIPIcs.ICALP.2017.64}, annote = {Keywords: graph algorithms, data structures, additive spanners, distance oracles} }
Published in: OASIcs, Volume 25, 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2012)
Mohammad H. Keyhani, Mathias Schnee, Karsten Weihe, and Hans-Peter Zorn. Reliability and Delay Distributions of Train Connections. In 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 25, pp. 35-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{keyhani_et_al:OASIcs.ATMOS.2012.35, author = {Keyhani, Mohammad H. and Schnee, Mathias and Weihe, Karsten and Zorn, Hans-Peter}, title = {{Reliability and Delay Distributions of Train Connections}}, booktitle = {12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {35--46}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-45-3}, ISSN = {2190-6807}, year = {2012}, volume = {25}, editor = {Delling, Daniel and Liberti, Leo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2012.35}, URN = {urn:nbn:de:0030-drops-37014}, doi = {10.4230/OASIcs.ATMOS.2012.35}, annote = {Keywords: Stochastic Delay Propagation, Timetable Information, Connection Reliability} }
Published in: LIPIcs, Volume 13, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
H. J. Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, and Barbara König. Conditional Reactive Systems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, pp. 191-203, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{bruggink_et_al:LIPIcs.FSTTCS.2011.191, author = {Bruggink, H. J. Sander and Cauderlier, Rapha\"{e}l and H\"{u}lsbusch, Mathias and K\"{o}nig, Barbara}, title = {{Conditional Reactive Systems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)}, pages = {191--203}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-34-7}, ISSN = {1868-8969}, year = {2011}, volume = {13}, editor = {Chakraborty, Supratik and Kumar, Amit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.191}, URN = {urn:nbn:de:0030-drops-33257}, doi = {10.4230/LIPIcs.FSTTCS.2011.191}, annote = {Keywords: reactive systems, graph transformation, graph logic, Hoare triples, critical pair analysis} }
Published in: Dagstuhl Follow-Ups, Volume 1, Scientific Visualization: Advanced Concepts (2010)
Younis Hijazi, Aaron Knoll, Mathias Schott, Andrew Kensler, and Charles Hansen. CSG Operations of Arbitrary Primitives with Interval Arithmetic and Real-Time Ray Casting. In Scientific Visualization: Advanced Concepts. Dagstuhl Follow-Ups, Volume 1, pp. 78-89, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InCollection{hijazi_et_al:DFU.SciViz.2010.78, author = {Hijazi, Younis and Knoll, Aaron and Schott, Mathias and Kensler, Andrew and Hansen, Charles}, title = {{CSG Operations of Arbitrary Primitives with Interval Arithmetic and Real-Time Ray Casting}}, booktitle = {Scientific Visualization: Advanced Concepts}, pages = {78--89}, series = {Dagstuhl Follow-Ups}, ISBN = {978-3-939897-19-4}, ISSN = {1868-8977}, year = {2010}, volume = {1}, editor = {Hagen, Hans}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.SciViz.2010.78}, URN = {urn:nbn:de:0030-drops-26986}, doi = {10.4230/DFU.SciViz.2010.78}, annote = {Keywords: Implicit Surface, Constructive Solid Geometry, Interval Arithmetic, Ray Casting} }
Published in: OASIcs, Volume 9, 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08) (2008)
Lennart Frede, Matthias Müller-Hannemann, and Mathias Schnee. Efficient On-Trip Timetable Information in the Presence of Delays. In 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08). Open Access Series in Informatics (OASIcs), Volume 9, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{frede_et_al:OASIcs.ATMOS.2008.1584, author = {Frede, Lennart and M\"{u}ller-Hannemann, Matthias and Schnee, Mathias}, title = {{Efficient On-Trip Timetable Information in the Presence of Delays}}, booktitle = {8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)}, pages = {1--16}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-07-1}, ISSN = {2190-6807}, year = {2008}, volume = {9}, editor = {Fischetti, Matteo and Widmayer, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2008.1584}, URN = {urn:nbn:de:0030-drops-15843}, doi = {10.4230/OASIcs.ATMOS.2008.1584}, annote = {Keywords: Timetable information system, primary and secondary delays dependency graph, dynamic graph update} }
Published in: OASIcs, Volume 7, 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07) (2007)
Thorsten Gunkel, Matthias Müller-Hannemann, and Mathias Schnee. 16. Improved Search for Night Train Connections. In 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07). Open Access Series in Informatics (OASIcs), Volume 7, pp. 243-258, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{gunkel_et_al:OASIcs.ATMOS.2007.1178, author = {Gunkel, Thorsten and M\"{u}ller-Hannemann, Matthias and Schnee, Mathias}, title = {{16. Improved Search for Night Train Connections}}, booktitle = {7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)}, pages = {243--258}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-04-0}, ISSN = {2190-6807}, year = {2007}, volume = {7}, editor = {Ahuja, Ravindra K. and Liebchen, Christian and Mesa, Juan A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2007.1178}, URN = {urn:nbn:de:0030-drops-11781}, doi = {10.4230/OASIcs.ATMOS.2007.1178}, annote = {Keywords: Timetable information system, multi-criteria optimization, night trains, computational study} }
Feedback for Dagstuhl Publishing