| No. |
Title |
Author |
Year |
| 1 |
Finding the KT Partition of a Weighted Graph in Near-Linear Time |
Apers, Simon et al. |
2022 |
| 2 |
Sublinear Dynamic Interval Scheduling (On One or Multiple Machines) |
Gawrychowski, Paweł et al. |
2022 |
| 3 |
The Dynamic k-Mismatch Problem |
Clifford, Raphaël et al. |
2022 |
| 4 |
An Almost Optimal Edit Distance Oracle |
Charalampopoulos, Panagiotis et al. |
2021 |
| 5 |
Efficiently Testing Simon’s Congruence |
Gawrychowski, Paweł et al. |
2021 |
| 6 |
Front Matter, Table of Contents, Preface, Conference Organization |
Gawrychowski, Paweł et al. |
2021 |
| 7 |
LIPIcs, Volume 191, CPM 2021, Complete Volume |
Gawrychowski, Paweł et al. |
2021 |
| 8 |
Matching Patterns with Variables Under Hamming Distance |
Gawrychowski, Paweł et al. |
2021 |
| 9 |
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem |
Agrawal, Anadi et al. |
2020 |
| 10 |
Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs |
Dudek, Bartłomiej et al. |
2020 |
| 11 |
Dynamic Longest Common Substring in Polylogarithmic Time |
Charalampopoulos, Panagiotis et al. |
2020 |
| 12 |
Efficient Labeling for Reachability in Directed Acyclic Graphs |
Dulęba, Maciej et al. |
2020 |
| 13 |
Existential Length Universality |
Gawrychowski, Paweł et al. |
2020 |
| 14 |
Generalised Pattern Matching Revisited |
Dudek, Bartłomiej et al. |
2020 |
| 15 |
Minimum Cut in O(m log² n) Time |
Gawrychowski, Paweł et al. |
2020 |
| 16 |
On Indeterminate Strings Matching |
Gawrychowski, Paweł et al. |
2020 |
| 17 |
On Two Measures of Distance Between Fully-Labelled Trees |
Bernardini, Giulia et al. |
2020 |
| 18 |
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games |
Fijalkow, Nathanaël et al. |
2020 |
