1 citations · 1 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg +1
Given an -vertex planar embedded digraph with non-negative edge weights and a face of , Klein presented a data structure with space and preprocessing tim…
cs.DS2021
A Linear-Time -Approximation for Longest Common Subsequence
Karl Bringmann, Vincent Cohen-Addad, Debarati Das
We consider the classic problem of computing the Longest Common Subsequence (LCS) of two strings of length . While a simple quadratic algorithm has been known for the problem fo…