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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Debarati Das 0001' in GoogleThis author has not been identified. Look up 'Evangelos Kipouridis' in GoogleThis author has not been identified. Look up 'Maximilian Probst Gutenberg' in GoogleThis author has not been identified. Look up 'Christian Wulff-Nilsen' in Google

runs on WebDSL