Published in: LIPIcs, Volume 190, 19th International Symposium on Experimental Algorithms (SEA 2021)
Valentin Buchhold and Dorothea Wagner. Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 18:1-18:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{buchhold_et_al:LIPIcs.SEA.2021.18, author = {Buchhold, Valentin and Wagner, Dorothea}, title = {{Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {18:1--18:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.18}, URN = {urn:nbn:de:0030-drops-137908}, doi = {10.4230/LIPIcs.SEA.2021.18}, annote = {Keywords: Nearest neighbors, points of interest, travel demand generation, radiation model, customizable contraction hierarchies} }
Published in: OASIcs, Volume 85, 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)
Jonas Sauer, Dorothea Wagner, and Tobias Zündorf. An Efficient Solution for One-To-Many Multi-Modal Journey Planning. In 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020). Open Access Series in Informatics (OASIcs), Volume 85, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{sauer_et_al:OASIcs.ATMOS.2020.1, author = {Sauer, Jonas and Wagner, Dorothea and Z\"{u}ndorf, Tobias}, title = {{An Efficient Solution for One-To-Many Multi-Modal Journey Planning}}, booktitle = {20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)}, pages = {1:1--1:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-170-2}, ISSN = {2190-6807}, year = {2020}, volume = {85}, editor = {Huisman, Dennis and Zaroliagis, Christos D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2020.1}, URN = {urn:nbn:de:0030-drops-131371}, doi = {10.4230/OASIcs.ATMOS.2020.1}, annote = {Keywords: Algorithm Engineering, Route Planning, Public Transit, One-to-Many} }
Published in: OASIcs, Volume 85, 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)
Jonas Sauer, Dorothea Wagner, and Tobias Zündorf. Integrating ULTRA and Trip-Based Routing. In 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020). Open Access Series in Informatics (OASIcs), Volume 85, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{sauer_et_al:OASIcs.ATMOS.2020.4, author = {Sauer, Jonas and Wagner, Dorothea and Z\"{u}ndorf, Tobias}, title = {{Integrating ULTRA and Trip-Based Routing}}, booktitle = {20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)}, pages = {4:1--4:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-170-2}, ISSN = {2190-6807}, year = {2020}, volume = {85}, editor = {Huisman, Dennis and Zaroliagis, Christos D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2020.4}, URN = {urn:nbn:de:0030-drops-131408}, doi = {10.4230/OASIcs.ATMOS.2020.4}, annote = {Keywords: Algorithms, Journey Planning, Multi-Modal, Public Transportation} }
Published in: OASIcs, Volume 85, 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)
Valentin Buchhold, Dorothea Wagner, Tim Zeitz, and Michael Zündorf. Customizable Contraction Hierarchies with Turn Costs. In 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020). Open Access Series in Informatics (OASIcs), Volume 85, pp. 9:1-9:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{buchhold_et_al:OASIcs.ATMOS.2020.9, author = {Buchhold, Valentin and Wagner, Dorothea and Zeitz, Tim and Z\"{u}ndorf, Michael}, title = {{Customizable Contraction Hierarchies with Turn Costs}}, booktitle = {20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)}, pages = {9:1--9:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-170-2}, ISSN = {2190-6807}, year = {2020}, volume = {85}, editor = {Huisman, Dennis and Zaroliagis, Christos D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2020.9}, URN = {urn:nbn:de:0030-drops-131453}, doi = {10.4230/OASIcs.ATMOS.2020.9}, annote = {Keywords: Turn costs, realistic road networks, customizable contraction hierarchies, route planning, shortest paths} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Ben Strasser, Dorothea Wagner, and Tim Zeitz. Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 81:1-81:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{strasser_et_al:LIPIcs.ESA.2020.81, author = {Strasser, Ben and Wagner, Dorothea and Zeitz, Tim}, title = {{Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {81:1--81:14}, 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.81}, URN = {urn:nbn:de:0030-drops-129479}, doi = {10.4230/LIPIcs.ESA.2020.81}, annote = {Keywords: realistic road networks, time-dependent route planning, shortest paths} }
Published in: LIPIcs, Volume 160, 18th International Symposium on Experimental Algorithms (SEA 2020)
Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, and Sven Zühlsdorf. Engineering Exact Quasi-Threshold Editing. In 18th International Symposium on Experimental Algorithms (SEA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 160, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gottesburen_et_al:LIPIcs.SEA.2020.10, author = {Gottesb\"{u}ren, Lars and Hamann, Michael and Schoch, Philipp and Strasser, Ben and Wagner, Dorothea and Z\"{u}hlsdorf, Sven}, title = {{Engineering Exact Quasi-Threshold Editing}}, booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-148-1}, ISSN = {1868-8969}, year = {2020}, volume = {160}, editor = {Faro, Simone and Cantone, Domenico}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.10}, URN = {urn:nbn:de:0030-drops-120849}, doi = {10.4230/LIPIcs.SEA.2020.10}, annote = {Keywords: Edge Editing, Integer Linear Programming, FPT algorithm, Quasi-Threshold Editing} }
Published in: LIPIcs, Volume 160, 18th International Symposium on Experimental Algorithms (SEA 2020)
Lars Gottesbüren, Michael Hamann, Sebastian Schlag, and Dorothea Wagner. Advanced Flow-Based Multilevel Hypergraph Partitioning. In 18th International Symposium on Experimental Algorithms (SEA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 160, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gottesburen_et_al:LIPIcs.SEA.2020.11, author = {Gottesb\"{u}ren, Lars and Hamann, Michael and Schlag, Sebastian and Wagner, Dorothea}, title = {{Advanced Flow-Based Multilevel Hypergraph Partitioning}}, booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-148-1}, ISSN = {1868-8969}, year = {2020}, volume = {160}, editor = {Faro, Simone and Cantone, Domenico}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.11}, URN = {urn:nbn:de:0030-drops-120859}, doi = {10.4230/LIPIcs.SEA.2020.11}, annote = {Keywords: Hypergraph Partitioning, Maximum Flows, Refinement} }
Published in: LIPIcs, Volume 160, 18th International Symposium on Experimental Algorithms (SEA 2020)
Jonas Sauer, Dorothea Wagner, and Tobias Zündorf. Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA. In 18th International Symposium on Experimental Algorithms (SEA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 160, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{sauer_et_al:LIPIcs.SEA.2020.16, author = {Sauer, Jonas and Wagner, Dorothea and Z\"{u}ndorf, Tobias}, title = {{Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA}}, booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)}, pages = {16:1--16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-148-1}, ISSN = {1868-8969}, year = {2020}, volume = {160}, editor = {Faro, Simone and Cantone, Domenico}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.16}, URN = {urn:nbn:de:0030-drops-120905}, doi = {10.4230/LIPIcs.SEA.2020.16}, annote = {Keywords: Algorithms, Route Planning, Bike Sharing, Public Transportation} }
Published in: LIPIcs, Volume 160, 18th International Symposium on Experimental Algorithms (SEA 2020)
Lukas Barth and Dorothea Wagner. Zipping Segment Trees. In 18th International Symposium on Experimental Algorithms (SEA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 160, pp. 25:1-25:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{barth_et_al:LIPIcs.SEA.2020.25, author = {Barth, Lukas and Wagner, Dorothea}, title = {{Zipping Segment Trees}}, booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)}, pages = {25:1--25:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-148-1}, ISSN = {1868-8969}, year = {2020}, volume = {160}, editor = {Faro, Simone and Cantone, Domenico}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.25}, URN = {urn:nbn:de:0030-drops-120990}, doi = {10.4230/LIPIcs.SEA.2020.25}, annote = {Keywords: Segment Trees, Dynamic Segment Trees, Zip Trees, Data Structures} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, and Tobias Zündorf. UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 14:1-14:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{baum_et_al:LIPIcs.ESA.2019.14, author = {Baum, Moritz and Buchhold, Valentin and Sauer, Jonas and Wagner, Dorothea and Z\"{u}ndorf, Tobias}, title = {{UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {14:1--14:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola 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.2019.14}, URN = {urn:nbn:de:0030-drops-111352}, doi = {10.4230/LIPIcs.ESA.2019.14}, annote = {Keywords: Algorithms, Optimization, Route Planning, Public Transportation} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Lars Gottesbüren, Michael Hamann, and Dorothea Wagner. Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 52:1-52:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{gottesburen_et_al:LIPIcs.ESA.2019.52, author = {Gottesb\"{u}ren, Lars and Hamann, Michael and Wagner, Dorothea}, title = {{Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {52:1--52:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola 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.2019.52}, URN = {urn:nbn:de:0030-drops-111730}, doi = {10.4230/LIPIcs.ESA.2019.52}, annote = {Keywords: Hypergraph Partitioning, Maximum Flows, Algorithm Engineering} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, and Matthias Wolf. Engineering Negative Cycle Canceling for Wind Farm Cabling. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 55:1-55:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{gritzbach_et_al:LIPIcs.ESA.2019.55, author = {Gritzbach, Sascha and Ueckerdt, Torsten and Wagner, Dorothea and Wegner, Franziska and Wolf, Matthias}, title = {{Engineering Negative Cycle Canceling for Wind Farm Cabling}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {55:1--55:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.55}, URN = {urn:nbn:de:0030-drops-111766}, doi = {10.4230/LIPIcs.ESA.2019.55}, annote = {Keywords: Negative Cycle Canceling, Step Cost Function, Wind Farm Planning} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner. Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{carstens_et_al:LIPIcs.ESA.2018.11, author = {Carstens, Corrie Jacobien and Hamann, Michael and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wagner, Dorothea}, title = {{Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah 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.2018.11}, URN = {urn:nbn:de:0030-drops-94745}, doi = {10.4230/LIPIcs.ESA.2018.11}, annote = {Keywords: Graph randomisation, Curveball, I/O-efficiency, Parallelism} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Valentin Buchhold, Peter Sanders, and Dorothea Wagner. Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 27:1-27:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{buchhold_et_al:LIPIcs.SEA.2018.27, author = {Buchhold, Valentin and Sanders, Peter and Wagner, Dorothea}, title = {{Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {27:1--27:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.27}, URN = {urn:nbn:de:0030-drops-89623}, doi = {10.4230/LIPIcs.SEA.2018.27}, annote = {Keywords: traffic assignment, equilibrium flow pattern, customizable contraction hierarchies, batched shortest paths} }
Published in: OASIcs, Volume 59, 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017)
Spyros Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, and Christos Zaroliagis. Improved Oracles for Time-Dependent Road Networks. In 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017). Open Access Series in Informatics (OASIcs), Volume 59, pp. 4:1-4:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kontogiannis_et_al:OASIcs.ATMOS.2017.4, author = {Kontogiannis, Spyros and Papastavrou, Georgia and Paraskevopoulos, Andreas and Wagner, Dorothea and Zaroliagis, Christos}, title = {{Improved Oracles for Time-Dependent Road Networks}}, booktitle = {17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017)}, pages = {4:1--4:17}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-042-2}, ISSN = {2190-6807}, year = {2017}, volume = {59}, editor = {D'Angelo, Gianlorenzo and Dollevoet, Twan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2017.4}, URN = {urn:nbn:de:0030-drops-78954}, doi = {10.4230/OASIcs.ATMOS.2017.4}, annote = {Keywords: Time-dependent shortest paths, FIFO property, Distance oracles} }
Feedback for Dagstuhl Publishing