A Combinatorial Approach to Collapsing Words. - Alessandra Cherubini; Pawel Gawrychowski; Andrzej Kisielewicz 001; Brunetto Piochi (MFCS, 2006)

Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. - Pawel Gawrychowski; Dalia Krieger; Narad Rampersad; Jeffrey O. Shallit (Developments in Language Theory, 2008)

2-Synchronizing Words. - Pawel Gawrychowski; Andrzej Kisielewicz 001 (LATA, 2008)

Minimax Trees in Linear Time - Pawel Gawrychowski; Travis Gagie (CoRR, 2008)

Hyper-minimisation Made Efficient. - Pawel Gawrychowski; Artur Jez (MFCS, 2009)

Optimal, online validation of the pi and pi' failure functions - Pawel Gawrychowski; Artur Jez; Lukasz Jez (CoRR, 2009)

Grammar-Based Compression in a Streaming Model. - Travis Gagie; Pawel Gawrychowski (LATA, 2010)

Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time. - Pawel Gawrychowski; Dalia Krieger; Narad Rampersad; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2010)

Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. - Jaroslaw Byrka; Pawel Gawrychowski; Katharina T. Huber; Steven Kelk (J. Discrete Algorithms, 2010)

On the problem of freeness of multiplicative matrix semigroups. - Pawel Gawrychowski; Marin Gutan; Andrzej Kisielewicz 001 (Theor. Comput. Sci., 2010)

Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic. - Pawel Gawrychowski (ESA, 2011)

Faster Approximate Pattern Matching in Compressed Repetitive Texts. - Travis Gagie; Pawel Gawrychowski; Simon J. Puglisi (ISAAC, 2011)

On Minimising Automata with Errors. - Pawel Gawrychowski; Artur Jez; Andreas Maletti (MFCS, 2011)

Chrobak Normal Form Revisited, with Applications. - Pawel Gawrychowski (CIAA, 2011)

A Faster LZ77-Based Index - Travis Gagie; Pawel Gawrychowski (CoRR, 2011)

A Faster Grammar-Based Self-index. - Travis Gagie; Pawel Gawrychowski; Juha Kärkkäinen; Yakov Nekrich; Simon J. Puglisi (LATA, 2012)

Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings. - Pawel Gawrychowski (SPIRE, 2012)

Tying up the loose ends in fully LZW-compressed pattern matching. - Pawel Gawrychowski (STACS, 2012)

Linear-Space Substring Range Counting over Polylogarithmic Alphabets - Travis Gagie; Pawel Gawrychowski (CoRR, 2012)

(Really) Tight bounds for dispatching binary methods - Pawel Gawrychowski (CoRR, 2012)

Heaviest Induced Ancestors and Longest Common Substrings. - Travis Gagie; Pawel Gawrychowski; Yakov Nekrich (CCCG, 2013)

Discovering Hidden Repetitions in Words. - Pawel Gawrychowski; Florin Manea; Dirk Nowotka (CiE, 2013)

Converting SLP to LZ78 in almost Linear Time. - Hideo Bannai; Pawel Gawrychowski; Shunsuke Inenaga; Masayuki Takeda (CPM, 2013)

Alphabetic Minimax Trees in Linear Time. - Pawel Gawrychowski (CSR, 2013)

Beating $ mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching. - Pawel Gawrychowski; Damian Straszak (ISAAC, 2013)

Minimal Discriminating Words Problem Revisited. - Pawel Gawrychowski; Gregory Kucherov; Yakov Nekrich; Tatiana Starikovskaya (SPIRE, 2013)

Finding Pseudo-repetitions. - Pawel Gawrychowski; Florin Manea; Robert Mercas; Dirk Nowotka; Catalin Tiseanu (STACS, 2013)

Substring Suffix Selection. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (CoRR, 2013)

Beating O(nm) in approximate LZW-compressed pattern matching. - Pawel Gawrychowski; Damian Straszak (CoRR, 2013)

Minimax trees in linear time with applications. - Pawel Gawrychowski; Travis Gagie (Eur. J. Comb., 2013)

Optimal Pattern Matching in LZW Compressed Strings. - Pawel Gawrychowski (ACM Trans. Algorithms, 2013)

Computing Minimal and Maximal Suffixes of a Substring Revisited. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (CPM, 2014)

Weighted Ancestors in Suffix Trees. - Pawel Gawrychowski; Moshe Lewenstein; Patrick K. Nicholson (ESA, 2014)

Improved Submatrix Maximum Queries in Monge Matrices. - Pawel Gawrychowski; Shay Mozes; Oren Weimann (ICALP (1), 2014)

Euclidean TSP with Few Inner Points in Linear Space. - Pawel Gawrychowski; Damian Rusak (ISAAC, 2014)

LZ77-Based Self-indexing with Faster Pattern Matching. - Travis Gagie; Pawel Gawrychowski; Juha Kärkkäinen; Yakov Nekrich; Simon J. Puglisi (LATIN, 2014)

Testing Generalised Freeness of Words. - Pawel Gawrychowski; Florin Manea; Dirk Nowotka (STACS, 2014)

Lock-in Problem for Parallel Rotor-router Walks. - Jérémie Chalopin; Shantanu Das 001; Pawel Gawrychowski; Adrian Kosowski; Arnaud Labourel; Przemyslaw Uznanski (CoRR, 2014)

Optimal Encodings for Range Min-Max and Top-k. - Pawel Gawrychowski; Patrick K. Nicholson (CoRR, 2014)

Tight tradeoffs for approximating palindromes in streams. - Pawel Gawrychowski; Przemyslaw Uznanski (CoRR, 2014)

Simple and efficient LZW-compressed multiple pattern matching. - Pawel Gawrychowski (J. Discrete Algorithms, 2014)

Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. - Pawel Gawrychowski; Artur Jez; Lukasz Jez (Theory Comput. Syst., 2014)

Alphabet-Dependent String Searching with Wexponential Search Trees. - Johannes Fischer 001; Pawel Gawrychowski (CPM, 2015)

Encodings of Range Maximum-Sum Segment Queries and Applications. - Pawel Gawrychowski; Patrick K. Nicholson (CPM, 2015)

Queries on LZ-Bounded Encodings. - Djamal Belazzougui; Travis Gagie; Pawel Gawrychowski; Juha Kärkkäinen; Alberto Ordóñez Pereira; Simon J. Puglisi; Yasuo Tabei (DCC, 2015)

Approximating LZ77 via Small-Space Multiple-Pattern Matching. - Johannes Fischer 001; Travis Gagie; Pawel Gawrychowski; Tomasz Kociumaka (ESA, 2015)

Longest α-Gapped Repeat and Palindrome. - Pawel Gawrychowski; Florin Manea (FCT, 2015)

Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search. - Pawel Gawrychowski; Shay Mozes; Oren Weimann (ICALP (1), 2015)

Optimal Encodings for Range Top- k k , Selection, and Min-Max. - Pawel Gawrychowski; Patrick K. Nicholson (ICALP (1), 2015)

Strong Inapproximability of the Shortest Reset Word. - Pawel Gawrychowski; Damian Straszak (MFCS (1), 2015)

Wavelet Trees Meet Suffix Trees. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (SODA, 2015)

Computing the Longest Unbordered Substring. - Pawel Gawrychowski; Gregory Kucherov; Benjamin Sach; Tatiana Starikovskaya (SPIRE, 2015)

Limit Behavior of the Multi-agent Rotor-Router System. - Jérémie Chalopin; Shantanu Das 001; Pawel Gawrychowski; Adrian Kosowski; Arnaud Labourel; Przemyslaw Uznanski (DISC, 2015)

Testing k-binomial equivalence. - Dominik D. Freydenberger; Pawel Gawrychowski; Juhani Karhumäki; Florin Manea; Wojciech Rytter (CoRR, 2015)

Efficiently Finding All Maximal $α$-gapped Repeats. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (CoRR, 2015)

Even Simpler Distance Labeling for (Sparse) Graphs. - Pawel Gawrychowski; Adrian Kosowski; Przemyslaw Uznanski (CoRR, 2015)

Approximate pattern matching in LZ77-compressed texts. - Travis Gagie; Pawel Gawrychowski; Simon J. Puglisi (J. Discrete Algorithms, 2015)

Faster Longest Common Extension Queries in Strings over General Alphabets. - Pawel Gawrychowski; Tomasz Kociumaka; Wojciech Rytter; Tomasz Walen (CPM, 2016)

LZ77 Factorisation of Trees. - Pawel Gawrychowski; Artur Jez (FSTTCS, 2016)

Brief Announcement: Sublinear-Space Distance Labeling Using Hubs. - Pawel Gawrychowski; Adrian Kosowski; Przemyslaw Uznanski (PODC, 2016)

Bookmarks in Grammar-Compressed Strings. - Patrick Hagge Cording; Pawel Gawrychowski; Oren Weimann (SPIRE, 2016)

Efficiently Finding All Maximal alpha-gapped Repeats. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (STACS, 2016)

Randomized Algorithms for Finding a Majority Element. - Pawel Gawrychowski; Jukka Suomela; Przemyslaw Uznanski (SWAT, 2016)

Sublinear-Space Distance Labeling Using Hubs. - Pawel Gawrychowski; Adrian Kosowski; Przemyslaw Uznanski (DISC, 2016)

A note on distance labeling in planar graphs. - Pawel Gawrychowski; Przemyslaw Uznanski (CoRR, 2016)

Computing minimal and maximal suffixes of a substring. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Ignat I. Kolesnichenko; Tatiana Starikovskaya (Theor. Comput. Sci., 2016)

Longest common extensions in trees. - Philip Bille; Pawel Gawrychowski; Inge Li Gørtz; Gad M. Landau; Oren Weimann (Theor. Comput. Sci., 2016)

Order-preserving pattern matching with k mismatches. - Pawel Gawrychowski; Przemyslaw Uznanski (Theor. Comput. Sci., 2016)

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

Dispersion on Trees. - Pawel Gawrychowski; Nadav Krasnopolsky; Shay Mozes; Oren Weimann (ESA, 2017)

Optimal Distance Labeling Schemes for Trees. - Ofer Freedman; Pawel Gawrychowski; Patrick K. Nicholson; Oren Weimann (PODC, 2017)

Sparse Suffix Tree Construction in Optimal Time and Space. - Pawel Gawrychowski; Tomasz Kociumaka (SODA, 2017)

Distinct Squares in Circular Words. - Mika Amit; Pawel Gawrychowski (SPIRE, 2017)

Optimal Query Time for Encoding Range Majority. - Pawel Gawrychowski; Patrick K. Nicholson (WADS, 2017)

Better Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. - Pawel Gawrychowski; Jakub Lopuszanski (CoRR, 2017)

A Faster Construction of Phylogenetic Consensus Trees. - Pawel Gawrychowski; Gad M. Landau; Wing-Kin Sung; Oren Weimann (CoRR, 2017)

Existential length universality. - Pawel Gawrychowski; Narad Rampersad; Jeffrey O. Shallit; Marek Szykula (CoRR, 2017)

Optimal trade-offs for pattern matching with k mismatches. - Pawel Gawrychowski; Przemyslaw Uznanski (CoRR, 2017)

Longest Gapped Repeats and Palindromes. - Marius Dumitran; Pawel Gawrychowski; Florin Manea (Discret. Math. Theor. Comput. Sci., 2017)

Average-Case Behavior of k-Shortest Path Algorithms. - Alexander Schickedanz; Deepak Ajwani; Ulrich Meyer 001; Pawel Gawrychowski (COMPLEX NETWORKS (1), 2018)

Near-Optimal Distance Emulator for Planar Graphs. - Hsien-Chih Chang; Pawel Gawrychowski; Shay Mozes; Oren Weimann (ESA, 2018)

Edit Distance with Block Operations. - Michal Ganczorz; Pawel Gawrychowski; Artur Jez; Tomasz Kociumaka (ESA, 2018)

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

Improved Bounds for Shortest Paths in Dense Distance Graphs. - Pawel Gawrychowski; Adam Karczmarz (ICALP, 2018)

A Faster Construction of Greedy Consensus Trees. - Pawel Gawrychowski; Gad M. Landau; Wing-Kin Sung; Oren Weimann (ICALP, 2018)

A Faster FPTAS for #Knapsack. - Pawel Gawrychowski; Liran Markin; Oren Weimann (ICALP, 2018)

Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance. - Pawel Gawrychowski; Przemyslaw Uznanski (ICALP, 2018)

Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. - Pawel Gawrychowski; Gad M. Landau; Tatiana Starikovskaya (MFCS, 2018)

Near-Optimal Compression for the Planar Graph Metric. - Amir Abboud; Pawel Gawrychowski; Shay Mozes; Oren Weimann (SODA, 2018)

Optimal Dynamic Strings. - Pawel Gawrychowski; Adam Karczmarz; Tomasz Kociumaka; Jakub Lacki; Piotr Sankowski (SODA, 2018)

Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. - Pawel Gawrychowski; Fabian Kuhn; Jakub Lopuszanski; Konstantinos Panagiotou; Pascal Su (SODA, 2018)

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. - Pawel Gawrychowski; Haim Kaplan; Shay Mozes; Micha Sharir; Oren Weimann (SODA, 2018)

Better Tradeoffs for Exact Distance Oracles in Planar Graphs. - Pawel Gawrychowski; Shay Mozes; Oren Weimann; Christian Wulff-Nilsen (SODA, 2018)

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

The complexity of mean payoff games using universal graphs. - Nathanaël Fijalkow; Pawel Gawrychowski; Pierre Ohlmann (CoRR, 2018)

Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (Theory Comput. Syst., 2018)

Speeding up dynamic programming in the line-constrained k-median. - Pawel Gawrychowski; Lukasz Zatorski (Theory Comput. Syst., 2018)

The nearest colored node in a tree. - Pawel Gawrychowski; Gad M. Landau; Shay Mozes; Oren Weimann (Theor. Comput. Sci., 2018)

How to Exploit Periodicity (Invited Talk). - Pawel Gawrychowski (CPM, 2019)

Quasi-Periodicity in Streams. - Pawel Gawrychowski; Jakub Radoszewski; Tatiana Starikovskaya (CPM, 2019)

Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. - Giulia Bernardini 001; Pawel Gawrychowski; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (ICALP, 2019)

RLE Edit Distance in Near Optimal Time. - Raphaël Clifford; Pawel Gawrychowski; Tomasz Kociumaka; Daniel P. Martin 001; Przemyslaw Uznanski (MFCS, 2019)

Minimal Absent Words in Rooted and Unrooted Trees. - Gabriele Fici; Pawel Gawrychowski (SPIRE, 2019)

Almost optimal distance oracles for planar graphs. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Shay Mozes; Oren Weimann (STOC, 2019)

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

Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. - Pawel Gawrychowski; Oleg Merkurev; Arseny M. Shur; Przemyslaw Uznanski (Algorithmica, 2019)

Minimum Cut in O(m log2n) Time. - Pawel Gawrychowski; Shay Mozes; Oren Weimann (CoRR, 2019)

Hide and seek with repetitions. - Pawel Gawrychowski; Florin Manea; Robert Mercas; Dirk Nowotka (J. Comput. Syst. Sci., 2019)

On Two Measures of Distance Between Fully-Labelled Trees. - Giulia Bernardini 001; Paola Bonizzoni; Pawel Gawrychowski (CPM, 2020)

On Indeterminate Strings Matching. - Pawel Gawrychowski; Samah Ghazawi; Gad M. Landau (CPM, 2020)

Dynamic Longest Common Substring in Polylogarithmic Time. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Karol Pokorski (ICALP, 2020)

Minimum Cut in O(m log² n) Time. - Pawel Gawrychowski; Shay Mozes; Oren Weimann (ICALP, 2020)

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

A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. - Anadi Agrawal; Pawel Gawrychowski (ISAAC, 2020)

Efficient Labeling for Reachability in Directed Acyclic Graphs. - Maciej Duleba; Pawel Gawrychowski; Wojciech Janczewski (ISAAC, 2020)

Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. - Nathanaël Fijalkow; Pawel Gawrychowski; Pierre Ohlmann (MFCS, 2020)

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

Existential Length Universality. - Pawel Gawrychowski; Martin Lange; Narad Rampersad; Jeffrey O. Shallit; Marek Szykula (STACS, 2020)

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

Efficient Labeling for Reachability in Digraphs. - Maciej Duleba; Pawel Gawrychowski; Wojciech Janczewski (CoRR, 2020)

Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can). - Karl Bringmann; Pawel Gawrychowski; Shay Mozes; Oren Weimann (ACM Trans. Algorithms, 2020)

Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search. - Pawel Gawrychowski; Shay Mozes; Oren Weimann (ACM Trans. Algorithms, 2020)

Compressed range minimum queries. - Pawel Gawrychowski; Seungbum Jo; Shay Mozes; Oren Weimann (Theor. Comput. Sci., 2020)

Universal reconstruction of a string. - Pawel Gawrychowski; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2020)

An Almost Optimal Edit Distance Oracle. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Shay Mozes; Oren Weimann (ICALP, 2021)

Matching Patterns with Variables Under Hamming Distance. - Pawel Gawrychowski; Florin Manea; Stefan Siemer (MFCS, 2021)

Shorter Labels for Routing in Trees. - Pawel Gawrychowski; Wojciech Janczewski; Jakub Lopuszanski (SODA, 2021)

Planar Negative k-Cycle. - Pawel Gawrychowski; Shay Mozes; Oren Weimann (SODA, 2021)

A Note on a Recent Algorithm for Minimum Cut. - Pawel Gawrychowski; Shay Mozes; Oren Weimann (SOSA, 2021)

Lower Bounds for the Number of Repetitions in 2D Strings. - Pawel Gawrychowski; Samah Ghazawi; Gad M. Landau (SPIRE, 2021)

Efficiently Testing Simon's Congruence. - Pawel Gawrychowski; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (STACS, 2021)

Fully dynamic approximation of LIS in polylogarithmic time. - Pawel Gawrychowski; Wojciech Janczewski (STOC, 2021)

Incomplete Directed Perfect Phylogeny in Linear Time. - Giulia Bernardini 001; Paola Bonizzoni; Pawel Gawrychowski (WADS, 2021)

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

Top Tree Compression of Tries. - Philip Bille; Pawel Gawrychowski; Inge Li Gørtz; Gad M. Landau; Oren Weimann (Algorithmica, 2021)

Conditional Lower Bounds for Variants of Dynamic LIS. - Pawel Gawrychowski; Wojciech Janczewski (CoRR, 2021)

Block trees. - Djamal Belazzougui; Manuel Cáceres; Travis Gagie; Pawel Gawrychowski; Juha Kärkkäinen; Gonzalo Navarro 001; Alberto Ordóñez Pereira; Simon J. Puglisi; Yasuo Tabei (J. Comput. Syst. Sci., 2021)

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. - Pawel Gawrychowski; Haim Kaplan; Shay Mozes; Micha Sharir; Oren Weimann (SIAM J. Comput., 2021)

Tight upper and lower bounds on suffix tree breadth. - Golnaz Badkobeh; Pawel Gawrychowski; Juha Kärkkäinen; Simon J. Puglisi; Bella Zhukova (Theor. Comput. Sci., 2021)

Finding the KT Partition of a Weighted Graph in Near-Linear Time. - Simon Apers; Pawel Gawrychowski; Troy Lee (APPROX/RANDOM, 2022)

The Dynamic k-Mismatch Problem. - Raphaël Clifford; Pawel Gawrychowski; Tomasz Kociumaka; Daniel P. Martin 001; Przemyslaw Uznanski (CPM, 2022)

Cut Query Algorithms with Star Contraction. - Simon Apers; Yuval Efron; Pawel Gawrychowski; Troy Lee; Sagnik Mukhopadhyay; Danupon Nanongkai (FOCS, 2022)

Sublinear Dynamic Interval Scheduling (On One or Multiple Machines). - Pawel Gawrychowski; Karol Pokorski (ICALP, 2022)

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

Pattern Matching on Grammar-Compressed Strings in Linear Time. - Moses Ganardi; Pawel Gawrychowski (SODA, 2022)

Simpler Adjacency Labeling for Planar Graphs with B-Trees. - Pawel Gawrychowski; Wojciech Janczewski (SOSA, 2022)

Faster Exponential Algorithm for Permutation Pattern Matching. - Pawel Gawrychowski; Mateusz Rzepecki (SOSA, 2022)

On the Hardness of Computing the Edit Distance of Shallow Trees. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Shay Mozes; Oren Weimann (SPIRE, 2022)

Matching Patterns with Variables Under Edit Distance. - Pawel Gawrychowski; Florin Manea; Stefan Siemer (SPIRE, 2022)

Fast and Longest Rollercoasters. - Pawel Gawrychowski; Florin Manea; Radoslaw Serafin (Algorithmica, 2022)

Streaming Dictionary Matching with Mismatches. - Pawel Gawrychowski; Tatiana Starikovskaya (Algorithmica, 2022)

The Theory of Universal Graphs for Infinite Duration Games. - Thomas Colcombet; Nathanaël Fijalkow; Pawel Gawrychowski; Pierre Ohlmann (Log. Methods Comput. Sci., 2022)

Elastic-Degenerate String Matching via Fast Matrix Multiplication. - Giulia Bernardini 001; Pawel Gawrychowski; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (SIAM J. Comput., 2022)

Fault-tolerant distance labeling for planar graphs. - Aviv Bar-Natan; Panagiotis Charalampopoulos; Pawel Gawrychowski; Shay Mozes; Oren Weimann (Theor. Comput. Sci., 2022)

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

Order-Preserving Squares in Strings. - Pawel Gawrychowski; Samah Ghazawi; Gad M. Landau (CPM, 2023)

Compressed Indexing for Consecutive Occurrences. - Pawel Gawrychowski; Garance Gourdel; Tatiana Starikovskaya; Teresa Anna Steiner (CPM, 2023)

Substring Complexity in Sublinear Space. - Giulia Bernardini 001; Gabriele Fici; Pawel Gawrychowski; Solon P. Pissis (ISAAC, 2023)

Optimal Square Detection Over General Alphabets. - Jonas Ellert; Pawel Gawrychowski; Garance Gourdel (SODA, 2023)

On the Number of Factors in the LZ-End Factorization. - Pawel Gawrychowski; Maria Kosche; Florin Manea (SPIRE, 2023)

Tight Bound for the Number of Distinct Palindromes in a Tree. - Pawel Gawrychowski; Tomasz Kociumaka; Wojciech Rytter; Tomasz Walen (Electron. J. Comb., 2023)

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

Almost Optimal Exact Distance Oracles for Planar Graphs. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Yaowei Long; Shay Mozes; Seth Pettie; Oren Weimann; Christian Wulff-Nilsen (J. ACM, 2023)

Better Distance Labeling for Unweighted Planar Graphs. - Pawel Gawrychowski; Przemyslaw Uznanski (Algorithmica, 2023)

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

Faster Sliding Window String Indexing in Streams. - Philip Bille; Pawel Gawrychowski; Inge Li Gørtz; Simon R. Tarnow (CPM, 2024)

Compressed Consecutive Pattern Matching†. - Pawel Gawrychowski; Garance Gourdel; Tatiana Starikovskaya; Teresa Anna Steiner (DCC, 2024)

Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity. - Pawel Gawrychowski; Mateusz Wasylkiewicz (ESA, 2024)

Optimal Bounds for Distinct Quartics. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Samah Ghazawi (ICALP, 2024)

Enumerating m-Length Walks in Directed Graphs with Constant Delay. - Duncan Adamson; Pawel Gawrychowski; Florin Manea (LATIN (1), 2024)

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

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications. - Pawel Gawrychowski; Egor Gorbachev; Tomasz Kociumaka (CoRR, 2024)

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

Minimum Cut in O(mlog 2 n) Time. - Pawel Gawrychowski; Shay Mozes; Oren Weimann (Theory Comput. Syst., 2024)

Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration. - Pawel Gawrychowski; Florin Manea; Markus L. Schmid (Proc. ACM Manag. Data, 2024)

Minimal Generators in Optimal Time. - Jonas Ellert; Pawel Gawrychowski; Tatiana Starikovskaya (CPM, 2025)

Faster Approximate Elastic-Degenerate String Matching - Part B. - Pawel Gawrychowski; Adam Górkiewicz; Pola Marciniak; Solon P. Pissis; Karol Pokorski (CPM, 2025)

Optimal Distance Labeling for Permutation Graphs. - Pawel Gawrychowski; Wojciech Janczewski (ICALP, 2025)

Faster two-dimensional pattern matching with k mismatches. - Jonas Ellert; Pawel Gawrychowski; Adam Górkiewicz; Tatiana Starikovskaya (SODA, 2025)

Faster ED-String Matching with k Mismatches. - Pawel Gawrychowski; Adam Górkiewicz; Pola Marciniak; Solon P. Pissis; Karol Pokorski (CoRR, 2025)