A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem. - Bartlomiej Dudek 001; Pawel Gawrychowski; Piotr Ostropolski-Nalewaja (CPM, 2017)

Robust Detection in Leak-Prone Population Protocols. - Dan Alistarh; Bartlomiej Dudek 001; Adrian Kosowski; David Soloveichik; Przemyslaw Uznanski (DNA, 2017)

Spreading a Confirmed Rumor: A Case for Oscillatory Dynamics. - Bartlomiej Dudek 001; Adrian Kosowski (CoRR, 2017)

Edit Distance between Unrooted Trees in Cubic Time. - Bartlomiej Dudek 001; Pawel Gawrychowski (ICALP, 2018)

Universal protocols for information dissemination using emergent signals. - Bartlomiej Dudek 001; Adrian Kosowski (STOC, 2018)

Slowing Down Top Trees for Better Worst-Case Bounds. - Bartlomiej Dudek 001; Pawel Gawrychowski (CoRR, 2018)

Computing quartet distance is equivalent to counting 4-cycles. - Bartlomiej Dudek 001; Pawel Gawrychowski (STOC, 2019)

Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs. - Bartlomiej Dudek 001; Pawel Gawrychowski (ISAAC, 2020)

Generalised Pattern Matching Revisited. - Bartlomiej Dudek 001; Pawel Gawrychowski; Tatiana Starikovskaya (STACS, 2020)

All non-trivial variants of 3-LDT are equivalent. - Bartlomiej Dudek 001; Pawel Gawrychowski; Tatiana Starikovskaya (STOC, 2020)

Strictly In-Place Algorithms for Permuting and Inverting Permutations. - Bartlomiej Dudek 001; Pawel Gawrychowski; Karol Pokorski (WADS, 2021)

Streaming Regular Expression Membership and Pattern Matching. - Bartlomiej Dudek 001; Pawel Gawrychowski; Garance Gourdel; Tatiana Starikovskaya (SODA, 2022)

Optimal Near-Linear Space Heaviest Induced Ancestors. - Panagiotis Charalampopoulos; Bartlomiej Dudek 001; Pawel Gawrychowski; Karol Pokorski (CPM, 2023)

Optimal Heaviest Induced Ancestors. - Panagiotis Charalampopoulos; Bartlomiej Dudek 001; Pawel Gawrychowski; Karol Pokorski (CoRR, 2023)

Online Context-Free Recognition in OMv Time. - Bartlomiej Dudek 001; Pawel Gawrychowski (CPM, 2024)

Sorting Signed Permutations by Reversals in Nearly-Linear Time. - Bartlomiej Dudek 001; Pawel Gawrychowski; Tatiana Starikovskaya (SOSA, 2024)

Slowing down top trees for better worst-case compression. - Bartlomiej Dudek 001; Pawel Gawrychowski (Theor. Comput. Sci., 2024)