No. Title Author Year
1 A Faster Construction of Greedy Consensus Trees Gawrychowski, Pawel et al. 2018
2 A Faster FPTAS for #Knapsack Gawrychowski, Pawel et al. 2018
3 Edit Distance between Unrooted Trees in Cubic Time Dudek, Bartlomiej et al. 2018
4 Edit Distance with Block Operations Ganczorz, Michal et al. 2018
5 Fast Entropy-Bounded String Dictionary Look-Up with Mismatches Gawrychowski, Pawel et al. 2018
6 Improved Bounds for Shortest Paths in Dense Distance Graphs Gawrychowski, Pawel et al. 2018
7 Near-Optimal Distance Emulator for Planar Graphs Chang, Hsien-Chih et al. 2018
8 Slowing Down Top Trees for Better Worst-Case Compression Dudek, Bartlomiej et al. 2018
9 Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance Gawrychowski, Pawel et al. 2018
10 A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem Dudek, Bartlomiej et al. 2017
Current Page :
Number of result pages: 3
Number of documents: 21


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