| No. |
Title |
Author |
Year |
| 1 |
Compressed Indexing for Consecutive Occurrences |
Gawrychowski, Paweł et al. |
2023 |
| 2 |
Optimal Near-Linear Space Heaviest Induced Ancestors |
Charalampopoulos, Panagiotis et al. |
2023 |
| 3 |
Order-Preserving Squares in Strings |
Gawrychowski, Paweł et al. |
2023 |
| 4 |
Finding the KT Partition of a Weighted Graph in Near-Linear Time |
Apers, Simon et al. |
2022 |
| 5 |
Sublinear Dynamic Interval Scheduling (On One or Multiple Machines) |
Gawrychowski, Paweł et al. |
2022 |
| 6 |
The Dynamic k-Mismatch Problem |
Clifford, Raphaël et al. |
2022 |
| 7 |
An Almost Optimal Edit Distance Oracle |
Charalampopoulos, Panagiotis et al. |
2021 |
| 8 |
Efficiently Testing Simon’s Congruence |
Gawrychowski, Paweł et al. |
2021 |
| 9 |
Front Matter, Table of Contents, Preface, Conference Organization |
Gawrychowski, Paweł et al. |
2021 |
| 10 |
LIPIcs, Volume 191, CPM 2021, Complete Volume |
Gawrychowski, Paweł et al. |
2021 |
| 11 |
Matching Patterns with Variables Under Hamming Distance |
Gawrychowski, Paweł et al. |
2021 |
| 12 |
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem |
Agrawal, Anadi et al. |
2020 |
| 13 |
Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs |
Dudek, Bartłomiej et al. |
2020 |
| 14 |
Dynamic Longest Common Substring in Polylogarithmic Time |
Charalampopoulos, Panagiotis et al. |
2020 |
| 15 |
Efficient Labeling for Reachability in Directed Acyclic Graphs |
Dulęba, Maciej et al. |
2020 |
| 16 |
Existential Length Universality |
Gawrychowski, Paweł et al. |
2020 |
| 17 |
Generalised Pattern Matching Revisited |
Dudek, Bartłomiej et al. |
2020 |
| 18 |
Minimum Cut in O(m log² n) Time |
Gawrychowski, Paweł et al. |
2020 |
| 19 |
On Indeterminate Strings Matching |
Gawrychowski, Paweł et al. |
2020 |
| 20 |
On Two Measures of Distance Between Fully-Labelled Trees |
Bernardini, Giulia et al. |
2020 |
| 21 |
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games |
Fijalkow, Nathanaël et al. |
2020 |
| 22 |
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication |
Bernardini, Giulia et al. |
2019 |
| 23 |
Fast and Longest Rollercoasters |
Gawrychowski, Pawel et al. |
2019 |
| 24 |
How to Exploit Periodicity (Invited Talk) |
Gawrychowski, Pawel |
2019 |
| 25 |
Quasi-Periodicity in Streams |
Gawrychowski, Pawel et al. |
2019 |
| 26 |
RLE Edit Distance in Near Optimal Time |
Clifford, Raphaël et al. |
2019 |
| 27 |
Streaming Dictionary Matching with Mismatches |
Gawrychowski, Pawel et al. |
2019 |
| 28 |
Top Tree Compression of Tries |
Bille, Philip et al. |
2019 |
| 29 |
A Faster Construction of Greedy Consensus Trees |
Gawrychowski, Pawel et al. |
2018 |
| 30 |
A Faster FPTAS for #Knapsack |
Gawrychowski, Pawel et al. |
2018 |
| 31 |
Edit Distance between Unrooted Trees in Cubic Time |
Dudek, Bartlomiej et al. |
2018 |
| 32 |
Edit Distance with Block Operations |
Ganczorz, Michal et al. |
2018 |
| 33 |
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches |
Gawrychowski, Pawel et al. |
2018 |
| 34 |
Improved Bounds for Shortest Paths in Dense Distance Graphs |
Gawrychowski, Pawel et al. |
2018 |
| 35 |
Near-Optimal Distance Emulator for Planar Graphs |
Chang, Hsien-Chih et al. |
2018 |
| 36 |
Slowing Down Top Trees for Better Worst-Case Compression |
Dudek, Bartlomiej et al. |
2018 |
| 37 |
Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance |
Gawrychowski, Pawel et al. |
2018 |
| 38 |
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem |
Dudek, Bartlomiej et al. |
2017 |
| 39 |
Dispersion on Trees |
Gawrychowski, Pawel et al. |
2017 |
| 40 |
Efficiently Finding All Maximal alpha-gapped Repeats |
Gawrychowski, Pawel et al. |
2016 |
| 41 |
Faster Longest Common Extension Queries in Strings over General Alphabets |
Gawrychowski, Pawel et al. |
2016 |
| 42 |
LZ77 Factorisation of Trees |
Gawrychowski, Pawel et al. |
2016 |
| 43 |
Randomized Algorithms for Finding a Majority Element |
Gawrychowski, Pawel et al. |
2016 |
| 44 |
The Nearest Colored Node in a Tree |
Gawrychowski, Pawel et al. |
2016 |
| 45 |
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams |
Gawrychowski, Pawel et al. |
2016 |
| 46 |
Testing Generalised Freeness of Words |
Gawrychowski, Pawel et al. |
2014 |
| 47 |
Finding Pseudo-repetitions |
Gawrychowski, Pawel et al. |
2013 |
| 48 |
Tying up the loose ends in fully LZW-compressed pattern matching |
Gawrychowski, Pawel |
2012 |
| 49 |
Minimax Trees in Linear Time with Applications |
Gawrychowski, Pawel et al. |
2009 |
