A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs

Debarati Das 0001, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen. A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. In Karl Bringmann, Timothy Chan, editors, 5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022. pages 1-11, SIAM, 2022. [doi]

@inproceedings{0001KGW22,
  title = {A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs},
  author = {Debarati Das 0001 and Evangelos Kipouridis and Maximilian Probst Gutenberg and Christian Wulff-Nilsen},
  year = {2022},
  doi = {10.1137/1.9781611977066.1},
  url = {https://doi.org/10.1137/1.9781611977066.1},
  researchr = {https://researchr.org/publication/0001KGW22},
  cites = {0},
  citedby = {0},
  pages = {1-11},
  booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022},
  editor = {Karl Bringmann and Timothy Chan},
  publisher = {SIAM},
  isbn = {978-1-61197-706-6},
}