Published in: OASIcs, Volume 124, Commit2Data (2024)
Nidarshan Veerakumar, Aleksandar Boričić, Ilya Tyuryukanov, Marko Tealane, Matija Naglič, Maarten Van Riet, Danny Klaar, Arjen Jongepier, Jorrit Bos, Mohammad Golshani, Gert Rietveld, Mart van der Meijden, and Marjan Popov. Improving Power System Resilience with Enhanced Monitoring, Control, and Protection Algorithms. In Commit2Data. Open Access Series in Informatics (OASIcs), Volume 124, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{veerakumar_et_al:OASIcs.Commit2Data.7, author = {Veerakumar, Nidarshan and Bori\v{c}i\'{c}, Aleksandar and Tyuryukanov, Ilya and Tealane, Marko and Nagli\v{c}, Matija and Van Riet, Maarten and Klaar, Danny and Jongepier, Arjen and Bos, Jorrit and Golshani, Mohammad and Rietveld, Gert and van der Meijden, Mart and Popov, Marjan}, title = {{Improving Power System Resilience with Enhanced Monitoring, Control, and Protection Algorithms}}, booktitle = {Commit2Data}, pages = {7:1--7:18}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-351-5}, ISSN = {2190-6807}, year = {2024}, volume = {124}, editor = {Haverkort, Boudewijn R. and de Jongste, Aldert and van Kuilenburg, Pieter and Vromans, Ruben D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Commit2Data.7}, URN = {urn:nbn:de:0030-drops-213647}, doi = {10.4230/OASIcs.Commit2Data.7}, annote = {Keywords: Grid Resilience, Synchrophasors, Real-time Cyber-Physical Experimental Testbed, Real-Time Monitoring, Protection, and Control, Event Detection Classification, Artificial Intelligence, Adaptive Incremental Learning, Controlled Islanding, Vulnerability, State Estimation, Dynamic Line and Cable Rating} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, and Markus Wallinger. Bundling-Aware Graph Drawing. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 15:1-15:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{archambault_et_al:LIPIcs.GD.2024.15, author = {Archambault, Daniel and Liotta, Giuseppe and N\"{o}llenburg, Martin and Piselli, Tommaso and Tappini, Alessandra and Wallinger, Markus}, title = {{Bundling-Aware Graph Drawing}}, booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)}, pages = {15:1--15:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-343-0}, ISSN = {1868-8969}, year = {2024}, volume = {320}, editor = {Felsner, Stefan and Klein, Karsten}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.15}, URN = {urn:nbn:de:0030-drops-212995}, doi = {10.4230/LIPIcs.GD.2024.15}, annote = {Keywords: Edge Bundling, Experimental Comparison, Graph Sparsification} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, and Falk Schreiber. GraphTrials: Visual Proofs of Graph Properties. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{forster_et_al:LIPIcs.GD.2024.16, author = {F\"{o}rster, Henry and Klesen, Felix and Dwyer, Tim and Eades, Peter and Hong, Seok-Hee and Kobourov, Stephen G. and Liotta, Giuseppe and Misue, Kazuo and Montecchiani, Fabrizio and Pastukhov, Alexander and Schreiber, Falk}, title = {{GraphTrials: Visual Proofs of Graph Properties}}, booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-343-0}, ISSN = {1868-8969}, year = {2024}, volume = {320}, editor = {Felsner, Stefan and Klein, Karsten}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.16}, URN = {urn:nbn:de:0030-drops-213005}, doi = {10.4230/LIPIcs.GD.2024.16}, annote = {Keywords: Graph Visualization, Theory of Visualization, Visual Proof} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Amyra Meidiana, Seok-Hee Hong, and Yongcheng Jing. Connectivity-Faithful Graph Drawing. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 17:1-17:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{meidiana_et_al:LIPIcs.GD.2024.17, author = {Meidiana, Amyra and Hong, Seok-Hee and Jing, Yongcheng}, title = {{Connectivity-Faithful Graph Drawing}}, booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)}, pages = {17:1--17:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-343-0}, ISSN = {1868-8969}, year = {2024}, volume = {320}, editor = {Felsner, Stefan and Klein, Karsten}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.17}, URN = {urn:nbn:de:0030-drops-213015}, doi = {10.4230/LIPIcs.GD.2024.17}, annote = {Keywords: Graph connectivity, Faithful graph drawing, Graph sparsification} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, and Ignaz Rutter. On k-Plane Insertion into Plane Drawings. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 35:1-35:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{katheder_et_al:LIPIcs.GD.2024.35, author = {Katheder, Julia and Kindermann, Philipp and Klute, Fabian and Parada, Irene and Rutter, Ignaz}, title = {{On k-Plane Insertion into Plane Drawings}}, booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)}, pages = {35:1--35:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-343-0}, ISSN = {1868-8969}, year = {2024}, volume = {320}, editor = {Felsner, Stefan and Klein, Karsten}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.35}, URN = {urn:nbn:de:0030-drops-213190}, doi = {10.4230/LIPIcs.GD.2024.35}, annote = {Keywords: Graph drawing, edge insertion, k-planarity} }
Published in: LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024)
John Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran, and Aishwarya Thiruvengadam. Byzantine Resilient Distributed Computing on External Data. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 3:1-3:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{augustine_et_al:LIPIcs.DISC.2024.3, author = {Augustine, John and Biju, Jeffin and Meir, Shachar and Peleg, David and Ramachandran, Srikkanth and Thiruvengadam, Aishwarya}, title = {{Byzantine Resilient Distributed Computing on External Data}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {3:1--3:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.3}, URN = {urn:nbn:de:0030-drops-212304}, doi = {10.4230/LIPIcs.DISC.2024.3}, annote = {Keywords: Byzantine Fault Tolerance, Blockchain Oracle, Congested Clique, Data Retrieval Model} }
Published in: LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024)
Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, and Chaodong Zheng. Almost Optimal Algorithms for Token Collision in Anonymous Networks. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 4:1-4:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bai_et_al:LIPIcs.DISC.2024.4, author = {Bai, Sirui and Fu, Xinyu and Wu, Xudong and Yao, Penghui and Zheng, Chaodong}, title = {{Almost Optimal Algorithms for Token Collision in Anonymous Networks}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {4:1--4:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.4}, URN = {urn:nbn:de:0030-drops-212319}, doi = {10.4230/LIPIcs.DISC.2024.4}, annote = {Keywords: Token collision, anonymous networks, deterministic algorithms} }
Published in: LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024)
Keren Censor-Hillel, Tomer Even, and Virginia Vassilevska Williams. Faster Cycle Detection in the Congested Clique. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 12:1-12:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{censorhillel_et_al:LIPIcs.DISC.2024.12, author = {Censor-Hillel, Keren and Even, Tomer and Vassilevska Williams, Virginia}, title = {{Faster Cycle Detection in the Congested Clique}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {12:1--12:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.12}, URN = {urn:nbn:de:0030-drops-212382}, doi = {10.4230/LIPIcs.DISC.2024.12}, annote = {Keywords: triangle detection, cycle detection, distributed computing, Congested Clique, quantum computing, Fast matrix multiplication, Fast rectangular matrix multiplication} }
Published in: LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024)
Panagiota Fatourou and Eric Ruppert. Lock-Free Augmented Trees. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 23:1-23:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fatourou_et_al:LIPIcs.DISC.2024.23, author = {Fatourou, Panagiota and Ruppert, Eric}, title = {{Lock-Free Augmented Trees}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {23:1--23:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.23}, URN = {urn:nbn:de:0030-drops-212499}, doi = {10.4230/LIPIcs.DISC.2024.23}, annote = {Keywords: shared-memory, data structure, tree, binary search tree, augmentation, linearizable, lock-free, order statistic, snapshot} }
Published in: LIPIcs, Volume 318, 31st International Symposium on Temporal Representation and Reasoning (TIME 2024)
Ivelina Stoyanova, Nicolas Museux, Sao Mai Nguyen, and David Filliat. Open the Chests: An Environment for Activity Recognition and Sequential Decision Problems Using Temporal Logic. In 31st International Symposium on Temporal Representation and Reasoning (TIME 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 318, pp. 5:1-5:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{stoyanova_et_al:LIPIcs.TIME.2024.5, author = {Stoyanova, Ivelina and Museux, Nicolas and Nguyen, Sao Mai and Filliat, David}, title = {{Open the Chests: An Environment for Activity Recognition and Sequential Decision Problems Using Temporal Logic}}, booktitle = {31st International Symposium on Temporal Representation and Reasoning (TIME 2024)}, pages = {5:1--5:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-349-2}, ISSN = {1868-8969}, year = {2024}, volume = {318}, editor = {Sala, Pietro and Sioutis, Michael and Wang, Fusheng}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2024.5}, URN = {urn:nbn:de:0030-drops-212128}, doi = {10.4230/LIPIcs.TIME.2024.5}, annote = {Keywords: Event-Based Decision Making, Activity Recognition, Temporal Logic, Reinforcement Learning, Dynamic Systems, Complex Event Processing, Benchmark Environment, Real-Time Simulation} }
Published in: LIPIcs, Volume 318, 31st International Symposium on Temporal Representation and Reasoning (TIME 2024)
Periklis Mantenoglou and Alexander Artikis. Extending the Range of Temporal Specifications of the Run-Time Event Calculus. In 31st International Symposium on Temporal Representation and Reasoning (TIME 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 318, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{mantenoglou_et_al:LIPIcs.TIME.2024.6, author = {Mantenoglou, Periklis and Artikis, Alexander}, title = {{Extending the Range of Temporal Specifications of the Run-Time Event Calculus}}, booktitle = {31st International Symposium on Temporal Representation and Reasoning (TIME 2024)}, pages = {6:1--6:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-349-2}, ISSN = {1868-8969}, year = {2024}, volume = {318}, editor = {Sala, Pietro and Sioutis, Michael and Wang, Fusheng}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2024.6}, URN = {urn:nbn:de:0030-drops-212135}, doi = {10.4230/LIPIcs.TIME.2024.6}, annote = {Keywords: Event Calculus, temporal pattern matching, composite event recognition} }
Published in: OASIcs, Volume 123, 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)
Ralf Borndörfer, Andreas Löbel, Fabian Löbel, and Steffen Weider. Solving the Electric Bus Scheduling Problem by an Integrated Flow and Set Partitioning Approach. In 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024). Open Access Series in Informatics (OASIcs), Volume 123, pp. 11:1-11:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2024.11, author = {Bornd\"{o}rfer, Ralf and L\"{o}bel, Andreas and L\"{o}bel, Fabian and Weider, Steffen}, title = {{Solving the Electric Bus Scheduling Problem by an Integrated Flow and Set Partitioning Approach}}, booktitle = {24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)}, pages = {11:1--11:16}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-350-8}, ISSN = {2190-6807}, year = {2024}, volume = {123}, editor = {Bouman, Paul C. and Kontogiannis, Spyros C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2024.11}, URN = {urn:nbn:de:0030-drops-211992}, doi = {10.4230/OASIcs.ATMOS.2024.11}, annote = {Keywords: Electric Bus Scheduling, Electric Vehicle Scheduling, Non-linear Charging, Multi-commodity Flow, Set Partition, Lagrangian Relaxation, Proximal Bundle Method} }
Published in: OASIcs, Volume 123, 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)
Felix Prause and Ralf Borndörfer. A Bayesian Rolling Horizon Approach for Rolling Stock Rotation Planning with Predictive Maintenance. In 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024). Open Access Series in Informatics (OASIcs), Volume 123, pp. 13:1-13:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{prause_et_al:OASIcs.ATMOS.2024.13, author = {Prause, Felix and Bornd\"{o}rfer, Ralf}, title = {{A Bayesian Rolling Horizon Approach for Rolling Stock Rotation Planning with Predictive Maintenance}}, booktitle = {24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)}, pages = {13:1--13:19}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-350-8}, ISSN = {2190-6807}, year = {2024}, volume = {123}, editor = {Bouman, Paul C. and Kontogiannis, Spyros C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2024.13}, URN = {urn:nbn:de:0030-drops-212013}, doi = {10.4230/OASIcs.ATMOS.2024.13}, annote = {Keywords: Rolling stock rotation planning, Predictive maintenance, Rolling horizon approach, Bayesian inference, Local neighborhood search} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Cezar-Mihail Alexandru and Christian Konrad. Interval Selection in Sliding Windows. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{alexandru_et_al:LIPIcs.ESA.2024.8, author = {Alexandru, Cezar-Mihail and Konrad, Christian}, title = {{Interval Selection in Sliding Windows}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {8:1--8:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.8}, URN = {urn:nbn:de:0030-drops-210795}, doi = {10.4230/LIPIcs.ESA.2024.8}, annote = {Keywords: Sliding window algorithms, Streaming algorithms, Interval selection} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, and Hsin-Hao Su. Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{ashvinkumar_et_al:LIPIcs.ESA.2024.13, author = {Ashvinkumar, Vikrant and Bernstein, Aaron and Cao, Nairen and Grunau, Christoph and Haeupler, Bernhard and Jiang, Yonggang and Nanongkai, Danupon and Su, Hsin-Hao}, title = {{Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {13:1--13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.13}, URN = {urn:nbn:de:0030-drops-210849}, doi = {10.4230/LIPIcs.ESA.2024.13}, annote = {Keywords: Parallel algorithm, distributed algorithm, shortest paths} }
Feedback for Dagstuhl Publishing