Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan. Electrical Flows for Polylogarithmic Competitive Oblivious Routing. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 55:1-55:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{goranci_et_al:LIPIcs.ITCS.2024.55, author = {Goranci, Gramoz and Henzinger, Monika and R\"{a}cke, Harald and Sachdeva, Sushant and Sricharan, A. R.}, title = {{Electrical Flows for Polylogarithmic Competitive Oblivious Routing}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {55:1--55:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-309-6}, ISSN = {1868-8969}, year = {2024}, volume = {287}, editor = {Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.55}, URN = {urn:nbn:de:0030-drops-195830}, doi = {10.4230/LIPIcs.ITCS.2024.55}, annote = {Keywords: oblivious routing, electrical flows} }
Published in: TGDK, Volume 1, Issue 1 (2023): Special Issue on Trends in Graph Data and Knowledge. Transactions on Graph Data and Knowledge, Volume 1, Issue 1
Russa Biswas, Lucie-Aimée Kaffee, Michael Cochez, Stefania Dumbrava, Theis E. Jendal, Matteo Lissandrini, Vanessa Lopez, Eneldo Loza Mencía, Heiko Paulheim, Harald Sack, Edlira Kalemi Vakaj, and Gerard de Melo. Knowledge Graph Embeddings: Open Challenges and Opportunities. In Special Issue on Trends in Graph Data and Knowledge. Transactions on Graph Data and Knowledge (TGDK), Volume 1, Issue 1, pp. 4:1-4:32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{biswas_et_al:TGDK.1.1.4, author = {Biswas, Russa and Kaffee, Lucie-Aim\'{e}e and Cochez, Michael and Dumbrava, Stefania and Jendal, Theis E. and Lissandrini, Matteo and Lopez, Vanessa and Menc{\'\i}a, Eneldo Loza and Paulheim, Heiko and Sack, Harald and Vakaj, Edlira Kalemi and de Melo, Gerard}, title = {{Knowledge Graph Embeddings: Open Challenges and Opportunities}}, journal = {Transactions on Graph Data and Knowledge}, pages = {4:1--4:32}, year = {2023}, volume = {1}, number = {1}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/TGDK.1.1.4}, URN = {urn:nbn:de:0030-drops-194783}, doi = {10.4230/TGDK.1.1.4}, annote = {Keywords: Knowledge Graphs, KG embeddings, Link prediction, KG applications} }
Published in: LIPIcs, Volume 277, 12th International Conference on Geographic Information Science (GIScience 2023)
David Röbl, Rizwan Bulbul, Johannes Scholz, Mortimer M. Müller, and Harald Vacik. An Evaluation of the Impact of Ignition Location Uncertainty on Forest Fire Ignition Prediction Using Bayesian Logistic Regression (Short Paper). In 12th International Conference on Geographic Information Science (GIScience 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 277, pp. 62:1-62:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{robl_et_al:LIPIcs.GIScience.2023.62, author = {R\"{o}bl, David and Bulbul, Rizwan and Scholz, Johannes and M\"{u}ller, Mortimer M. and Vacik, Harald}, title = {{An Evaluation of the Impact of Ignition Location Uncertainty on Forest Fire Ignition Prediction Using Bayesian Logistic Regression}}, booktitle = {12th International Conference on Geographic Information Science (GIScience 2023)}, pages = {62:1--62:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-288-4}, ISSN = {1868-8969}, year = {2023}, volume = {277}, editor = {Beecham, Roger and Long, Jed A. and Smith, Dianna and Zhao, Qunshan and Wise, Sarah}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2023.62}, URN = {urn:nbn:de:0030-drops-189576}, doi = {10.4230/LIPIcs.GIScience.2023.62}, annote = {Keywords: Forest Fire Prediction, Ignition Location Uncertainty, Bayesian Logistic Regression, Bayesian Inference, Probabilistic Programming} }
Published in: LIPIcs, Volume 270, 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)
Harald König, Uwe Wolter, and Tim Kräuter. Structural Operational Semantics for Heterogeneously Typed Coalgebras. In 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 270, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{konig_et_al:LIPIcs.CALCO.2023.7, author = {K\"{o}nig, Harald and Wolter, Uwe and Kr\"{a}uter, Tim}, title = {{Structural Operational Semantics for Heterogeneously Typed Coalgebras}}, booktitle = {10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-287-7}, ISSN = {1868-8969}, year = {2023}, volume = {270}, editor = {Baldan, Paolo and de Paiva, Valeria}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2023.7}, URN = {urn:nbn:de:0030-drops-188048}, doi = {10.4230/LIPIcs.CALCO.2023.7}, annote = {Keywords: Coalgebra, Bialgebra, Structural operational semantics, Compositionality} }
Published in: LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
Monika Henzinger, Stefan Neumann, Harald Räcke, and Stefan Schmid. Dynamic Maintenance of Monotone Dynamic Programs and Applications. In 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 254, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{henzinger_et_al:LIPIcs.STACS.2023.36, author = {Henzinger, Monika and Neumann, Stefan and R\"{a}cke, Harald and Schmid, Stefan}, title = {{Dynamic Maintenance of Monotone Dynamic Programs and Applications}}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-266-2}, ISSN = {1868-8969}, year = {2023}, volume = {254}, editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.36}, URN = {urn:nbn:de:0030-drops-176889}, doi = {10.4230/LIPIcs.STACS.2023.36}, annote = {Keywords: Dynamic programming, dynamic algorithms, data structures} }
Published in: LIPIcs, Volume 211, 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021)
Ana Sokolova and Harald Woracek. Nawrotzki’s Algorithm for the Countable Splitting Lemma, Constructively ((Co)algebraic pearls). In 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 211, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{sokolova_et_al:LIPIcs.CALCO.2021.23, author = {Sokolova, Ana and Woracek, Harald}, title = {{Nawrotzki’s Algorithm for the Countable Splitting Lemma, Constructively}}, booktitle = {9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021)}, pages = {23:1--23:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-212-9}, ISSN = {1868-8969}, year = {2021}, volume = {211}, editor = {Gadducci, Fabio and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2021.23}, URN = {urn:nbn:de:0030-drops-153781}, doi = {10.4230/LIPIcs.CALCO.2021.23}, annote = {Keywords: countable splitting lemma, distributions with given marginals, couplings} }
Published in: OASIcs, Volume 86, Recent Developments in the Design and Implementation of Programming Languages (2020)
Roberto Amadini, Graeme Gange, Peter Schachte, Harald Søndergaard, and Peter J. Stuckey. Abstract Interpretation, Symbolic Execution and Constraints. In Recent Developments in the Design and Implementation of Programming Languages. Open Access Series in Informatics (OASIcs), Volume 86, pp. 7:1-7:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{amadini_et_al:OASIcs.Gabbrielli.7, author = {Amadini, Roberto and Gange, Graeme and Schachte, Peter and S{\o}ndergaard, Harald and Stuckey, Peter J.}, title = {{Abstract Interpretation, Symbolic Execution and Constraints}}, booktitle = {Recent Developments in the Design and Implementation of Programming Languages}, pages = {7:1--7:19}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-171-9}, ISSN = {2190-6807}, year = {2020}, volume = {86}, editor = {de Boer, Frank S. and Mauro, Jacopo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Gabbrielli.7}, URN = {urn:nbn:de:0030-drops-132294}, doi = {10.4230/OASIcs.Gabbrielli.7}, annote = {Keywords: Abstract interpretation, symbolic execution, constraint solving, dynamic analysis, static analysis} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Philipp Czerner and Harald Räcke. Compact Oblivious Routing in Weighted Graphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 36:1-36:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{czerner_et_al:LIPIcs.ESA.2020.36, author = {Czerner, Philipp and R\"{a}cke, Harald}, title = {{Compact Oblivious Routing in Weighted Graphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {36:1--36:23}, 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.36}, URN = {urn:nbn:de:0030-drops-129024}, doi = {10.4230/LIPIcs.ESA.2020.36}, annote = {Keywords: Oblivious Routing, Compact Routing, Competitive Analysis} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Harald Räcke and Stefan Schmid. Compact Oblivious Routing. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 75:1-75:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{racke_et_al:LIPIcs.ESA.2019.75, author = {R\"{a}cke, Harald and Schmid, Stefan}, title = {{Compact Oblivious Routing}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {75:1--75:14}, 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.75}, URN = {urn:nbn:de:0030-drops-111968}, doi = {10.4230/LIPIcs.ESA.2019.75}, annote = {Keywords: Oblivious Routing, Compact Routing, Competitive Analysis} }
Published in: OASIcs, Volume 70, 2nd Conference on Language, Data and Knowledge (LDK 2019)
Ilkcan Keles, Omar Qawasmeh, Tabea Tietz, Ludovica Marinucci, Roberto Reda, and Marieke van Erp. A Proposal for a Two-Way Journey on Validating Locations in Unstructured and Structured Data. In 2nd Conference on Language, Data and Knowledge (LDK 2019). Open Access Series in Informatics (OASIcs), Volume 70, pp. 13:1-13:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{keles_et_al:OASIcs.LDK.2019.13, author = {Keles, Ilkcan and Qawasmeh, Omar and Tietz, Tabea and Marinucci, Ludovica and Reda, Roberto and van Erp, Marieke}, title = {{A Proposal for a Two-Way Journey on Validating Locations in Unstructured and Structured Data}}, booktitle = {2nd Conference on Language, Data and Knowledge (LDK 2019)}, pages = {13:1--13:8}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-105-4}, ISSN = {2190-6807}, year = {2019}, volume = {70}, editor = {Eskevich, Maria and de Melo, Gerard and F\"{a}th, Christian and McCrae, John P. and Buitelaar, Paul and Chiarcos, Christian and Klimek, Bettina and Dojchinovski, Milan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.LDK.2019.13}, URN = {urn:nbn:de:0030-drops-103778}, doi = {10.4230/OASIcs.LDK.2019.13}, annote = {Keywords: data validity, natural language processing, linked data} }
Published in: LIPIcs, Volume 108, 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)
Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, and Harald Zankl. Confluence Competition 2018. In 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 108, pp. 32:1-32:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{aoto_et_al:LIPIcs.FSCD.2018.32, author = {Aoto, Takahito and Hamana, Makoto and Hirokawa, Nao and Middeldorp, Aart and Nagele, Julian and Nishida, Naoki and Shintani, Kiraku and Zankl, Harald}, title = {{Confluence Competition 2018}}, booktitle = {3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)}, pages = {32:1--32:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-077-4}, ISSN = {1868-8969}, year = {2018}, volume = {108}, editor = {Kirchner, H\'{e}l\`{e}ne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2018.32}, URN = {urn:nbn:de:0030-drops-92023}, doi = {10.4230/LIPIcs.FSCD.2018.32}, annote = {Keywords: Confluence, competition, rewrite systems} }
Published in: LIPIcs, Volume 72, 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
Harald König and Uwe Wolter. Being Van Kampen in Presheaf Topoi is a Uniqueness Property. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 16:1-16:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{konig_et_al:LIPIcs.CALCO.2017.16, author = {K\"{o}nig, Harald and Wolter, Uwe}, title = {{Being Van Kampen in Presheaf Topoi is a Uniqueness Property}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {16:1--16:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.16}, URN = {urn:nbn:de:0030-drops-80320}, doi = {10.4230/LIPIcs.CALCO.2017.16}, annote = {Keywords: Van Kampen Cocone, Presheaf Topos, Fibred Semantics, Mapping Path} }
Published in: LIPIcs, Volume 72, 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
Ana Sokolova and Harald Woracek. Termination in Convex Sets of Distributions. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{sokolova_et_al:LIPIcs.CALCO.2017.22, author = {Sokolova, Ana and Woracek, Harald}, title = {{Termination in Convex Sets of Distributions}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.22}, URN = {urn:nbn:de:0030-drops-80434}, doi = {10.4230/LIPIcs.CALCO.2017.22}, annote = {Keywords: convex algebra, one-point extensions, convex powerset monad} }
Published in: LIPIcs, Volume 86, 13th International Conference on Spatial Information Theory (COSIT 2017)
Leif Harald Karlsen and Martin Giese. An Efficient Representation of General Qualitative Spatial Information Using Bintrees. In 13th International Conference on Spatial Information Theory (COSIT 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 86, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{karlsen_et_al:LIPIcs.COSIT.2017.4, author = {Karlsen, Leif Harald and Giese, Martin}, title = {{An Efficient Representation of General Qualitative Spatial Information Using Bintrees}}, booktitle = {13th International Conference on Spatial Information Theory (COSIT 2017)}, pages = {4:1--4:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-043-9}, ISSN = {1868-8969}, year = {2017}, volume = {86}, editor = {Clementini, Eliseo and Donnelly, Maureen and Yuan, May and Kray, Christian and Fogliaroni, Paolo and Ballatore, Andrea}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2017.4}, URN = {urn:nbn:de:0030-drops-77503}, doi = {10.4230/LIPIcs.COSIT.2017.4}, annote = {Keywords: Qualitative spatial data, Bintree, Data structure} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Matthias Kohler and Harald Räcke. Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 33:1-33:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kohler_et_al:LIPIcs.ICALP.2017.33, author = {Kohler, Matthias and R\"{a}cke, Harald}, title = {{Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {33:1--33: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.33}, URN = {urn:nbn:de:0030-drops-73882}, doi = {10.4230/LIPIcs.ICALP.2017.33}, annote = {Keywords: Online algorithms, reordering buffer, metric spaces, scheduling} }
Feedback for Dagstuhl Publishing