Published in: LIPIcs, Volume 91, 31st International Symposium on Distributed Computing (DISC 2017)
Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, and Christoph Lenzen. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 7:1-7:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{becker_et_al:LIPIcs.DISC.2017.7, author = {Becker, Ruben and Karrenbauer, Andreas and Krinninger, Sebastian and Lenzen, Christoph}, title = {{Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {7:1--7:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.7}, URN = {urn:nbn:de:0030-drops-80031}, doi = {10.4230/LIPIcs.DISC.2017.7}, annote = {Keywords: Shortest Paths, Shortest Transshipment, Undirected Min-cost Flow, Gradient Descent, Spanner} }
Published in: LIPIcs, Volume 91, 31st International Symposium on Distributed Computing (DISC 2017)
Karl Bringmann and Sebastian Krinninger. Brief Announcement: A Note on Hardness of Diameter Approximation. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 44:1-44:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{bringmann_et_al:LIPIcs.DISC.2017.44, author = {Bringmann, Karl and Krinninger, Sebastian}, title = {{Brief Announcement: A Note on Hardness of Diameter Approximation}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {44:1--44:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.44}, URN = {urn:nbn:de:0030-drops-79874}, doi = {10.4230/LIPIcs.DISC.2017.44}, annote = {Keywords: diameter, fine-grained reductions, conditional lower bounds} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, and Nikos Parotsidis. Decremental Data Structures for Connectivity and Dominators in Directed Graphs. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 42:1-42:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{georgiadis_et_al:LIPIcs.ICALP.2017.42, author = {Georgiadis, Loukas and Dueholm Hansen, Thomas and Italiano, Giuseppe F. and Krinninger, Sebastian and Parotsidis, Nikos}, title = {{Decremental Data Structures for Connectivity and Dominators in Directed Graphs}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {42:1--42:15}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.42}, URN = {urn:nbn:de:0030-drops-74455}, doi = {10.4230/LIPIcs.ICALP.2017.42}, annote = {Keywords: dynamic graph algorithms, decremental algorithms, dominator tree, strong connectivity under failures} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Karl Bringmann, Thomas Dueholm Hansen, and Sebastian Krinninger. Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 124:1-124:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{bringmann_et_al:LIPIcs.ICALP.2017.124, author = {Bringmann, Karl and Dueholm Hansen, Thomas and Krinninger, Sebastian}, title = {{Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {124:1--124:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.124}, URN = {urn:nbn:de:0030-drops-74398}, doi = {10.4230/LIPIcs.ICALP.2017.124}, annote = {Keywords: quantitative verification and synthesis, parametric search, shortest paths, negative cycle detection} }
Published in: LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016)
Greg Bodwin and Sebastian Krinninger. Fully Dynamic Spanners with Worst-Case Update Time. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 17:1-17:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bodwin_et_al:LIPIcs.ESA.2016.17, author = {Bodwin, Greg and Krinninger, Sebastian}, title = {{Fully Dynamic Spanners with Worst-Case Update Time}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {17:1--17:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.17}, URN = {urn:nbn:de:0030-drops-63688}, doi = {10.4230/LIPIcs.ESA.2016.17}, annote = {Keywords: Dynamic graph algorithms, spanners} }
Feedback for Dagstuhl Publishing