Reproduce “A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.