| No. |
Title |
Author |
Year |
| 1 |
Improved Compression of the Okamura-Seymour Metric |
Mozes, Shay et al. |
2022 |
| 2 |
The Fine-Grained Complexity of Episode Matching |
Bille, Philip et al. |
2022 |
| 3 |
An Almost Optimal Edit Distance Oracle |
Charalampopoulos, Panagiotis et al. |
2021 |
| 4 |
Front Matter, Table of Contents, Preface, Conference Organization |
Gørtz, Inge Li et al. |
2020 |
| 5 |
LIPIcs, Volume 161, CPM 2020, Complete Volume |
Gørtz, Inge Li et al. |
2020 |
| 6 |
Minimum Cut in O(m log² n) Time |
Gawrychowski, Paweł et al. |
2020 |
| 7 |
On the Fine-Grained Complexity of Parity Problems |
Abboud, Amir et al. |
2020 |
| 8 |
Top Tree Compression of Tries |
Bille, Philip et al. |
2019 |
| 9 |
A Faster Construction of Greedy Consensus Trees |
Gawrychowski, Pawel et al. |
2018 |
| 10 |
A Faster FPTAS for #Knapsack |
Gawrychowski, Pawel et al. |
2018 |
| 11 |
Near-Optimal Distance Emulator for Planar Graphs |
Chang, Hsien-Chih et al. |
2018 |
| 12 |
Dispersion on Trees |
Gawrychowski, Pawel et al. |
2017 |
| 13 |
The Nearest Colored Node in a Tree |
Gawrychowski, Pawel et al. |
2016 |
| 14 |
Improved Bounds for Online Preemptive Matching |
Epstein, Leah et al. |
2013 |
| 15 |
Optimal Packed String Matching |
Ben-Kiki, Oren et al. |
2011 |
| 16 |
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression |
Hermelin, Danny et al. |
2009 |
