No. Title Author Year
1 The Fine-Grained Complexity of Episode Matching Bille, Philip et al. 2022
2 A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities Enoch, Julian et al. 2021
3 An Almost Optimal Edit Distance Oracle Charalampopoulos, Panagiotis et al. 2021
4 Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs Fredslund-Hansen, Viktor et al. 2021
5 Dynamic String Alignment Charalampopoulos, Panagiotis et al. 2020
6 Minimum Cut in O(m log² n) Time Gawrychowski, Paweł et al. 2020
7 Near-Optimal Distance Emulator for Planar Graphs Chang, Hsien-Chih et al. 2018
8 Dispersion on Trees Gawrychowski, Pawel et al. 2017
9 The Nearest Colored Node in a Tree Gawrychowski, Pawel et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI