No. |
Title |
Author |
Year |
---|

1 |
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication |
Bernardini, Giulia et al. |
2019 |

2 |
Fast and Longest Rollercoasters |
Gawrychowski, Pawel et al. |
2019 |

3 |
How to Exploit Periodicity (Invited Talk) |
Gawrychowski, Pawel |
2019 |

4 |
Quasi-Periodicity in Streams |
Gawrychowski, Pawel et al. |
2019 |

5 |
RLE Edit Distance in Near Optimal Time |
Clifford, RaphaĆ«l et al. |
2019 |

6 |
Streaming Dictionary Matching with Mismatches |
Gawrychowski, Pawel et al. |
2019 |

7 |
Top Tree Compression of Tries |
Bille, Philip et al. |
2019 |

8 |
A Faster Construction of Greedy Consensus Trees |
Gawrychowski, Pawel et al. |
2018 |

9 |
A Faster FPTAS for #Knapsack |
Gawrychowski, Pawel et al. |
2018 |

10 |
Edit Distance between Unrooted Trees in Cubic Time |
Dudek, Bartlomiej et al. |
2018 |

11 |
Edit Distance with Block Operations |
Ganczorz, Michal et al. |
2018 |

12 |
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches |
Gawrychowski, Pawel et al. |
2018 |

13 |
Improved Bounds for Shortest Paths in Dense Distance Graphs |
Gawrychowski, Pawel et al. |
2018 |

14 |
Near-Optimal Distance Emulator for Planar Graphs |
Chang, Hsien-Chih et al. |
2018 |

15 |
Slowing Down Top Trees for Better Worst-Case Compression |
Dudek, Bartlomiej et al. |
2018 |

16 |
Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance |
Gawrychowski, Pawel et al. |
2018 |

17 |
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem |
Dudek, Bartlomiej et al. |
2017 |

18 |
Dispersion on Trees |
Gawrychowski, Pawel et al. |
2017 |

19 |
Efficiently Finding All Maximal alpha-gapped Repeats |
Gawrychowski, Pawel et al. |
2016 |

20 |
Faster Longest Common Extension Queries in Strings over General Alphabets |
Gawrychowski, Pawel et al. |
2016 |

21 |
LZ77 Factorisation of Trees |
Gawrychowski, Pawel et al. |
2016 |

22 |
Randomized Algorithms for Finding a Majority Element |
Gawrychowski, Pawel et al. |
2016 |

23 |
The Nearest Colored Node in a Tree |
Gawrychowski, Pawel et al. |
2016 |

24 |
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams |
Gawrychowski, Pawel et al. |
2016 |

25 |
Testing Generalised Freeness of Words |
Gawrychowski, Pawel et al. |
2014 |

26 |
Finding Pseudo-repetitions |
Gawrychowski, Pawel et al. |
2013 |

27 |
Tying up the loose ends in fully LZW-compressed pattern matching |
Gawrychowski, Pawel |
2012 |

28 |
Minimax Trees in Linear Time with Applications |
Gawrychowski, Pawel et al. |
2009 |