Variable-length contexts for PPM. - Przemyslaw Skibinski; Szymon Grabowski (Data Compression Conference, 2004)

Reducing the Computational Demands for Nearest Centroid Neighborhood Classifiers. - Szymon Grabowski (ICAISC, 2004)

First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index. - Szymon Grabowski; Veli Mäkinen; Gonzalo Navarro 001 (SPIRE, 2004)

Practical and Optimal String Matching. - Kimmo Fredriksson; Szymon Grabowski (SPIRE, 2005)

A simple alphabet-independent FM-index. - Szymon Grabowski; Veli Mäkinen; Gonzalo Navarro 001; Alejandro Salinger (Stringology, 2005)

Revisiting dictionary-based compression. - Przemyslaw Skibinski; Szymon Grabowski; Sebastian Deorowicz (Softw. Pract. Exp., 2005)

Efficient Algorithms for Pattern Matching with General Gaps and Character Classes. - Kimmo Fredriksson; Szymon Grabowski (SPIRE, 2006)

Efficient algorithms for (delta, gamma, alpha)-matching. - Kimmo Fredriksson; Szymon Grabowski (Stringology, 2006)

FM-KZ: An even simpler alphabet-independent FM-index. - Rafal Przywarski; Szymon Grabowski; Gonzalo Navarro 001; Alejandro Salinger (Stringology, 2006)

Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching. - Kimmo Fredriksson; Szymon Grabowski (WEA, 2006)

A Simple Alphabet-independent Fm-index. - Szymon Grabowski; Gonzalo Navarro 001; Rafal Przywarski; Alejandro Salinger; Veli Mäkinen (Int. J. Found. Comput. Sci., 2006)

A general compression algorithm that supports fast searching. - Kimmo Fredriksson; Szymon Grabowski (Inf. Process. Lett., 2006)

A Highly Efficient XML Compression Scheme for the Web. - Przemyslaw Skibinski; Jakub Swacha; Szymon Grabowski (SOFSEM, 2008)

Efficient Preprocessing for Web Log Compression. - Sebastian Deorowicz; Szymon Grabowski (Int. J. Comput., 2008)

Efficient Algorithms for (delta, gamma, alpha) and (delta, kDelta, alpha)-Matching. - Kimmo Fredriksson; Szymon Grabowski (Int. J. Found. Comput. Sci., 2008)

Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time. - Szymon Grabowski; Kimmo Fredriksson (Inf. Process. Lett., 2008)

Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance. - Kimmo Fredriksson; Szymon Grabowski (Inf. Retr., 2008)

Effective asymmetric XML compression. - Przemyslaw Skibinski; Szymon Grabowski; Jakub Swacha (Softw. Pract. Exp., 2008)

Preprocessing for Real-Time Handwritten Character Recognition. - Bartosz Paszkowski; Wojciech Bieniecki; Szymon Grabowski (Computer Recognition Systems 2, 2008)

On Two Variants of the Longest Increasing Subsequence Problem. - Sebastian Deorowicz; Szymon Grabowski (ICMMI, 2009)

Fast Convolutions and Their Applications in Approximate String Matching. - Kimmo Fredriksson; Szymon Grabowski (IWOCA, 2009)

Nested Counters in Bit-Parallel String Matching. - Kimmo Fredriksson; Szymon Grabowski (LATA, 2009)

A hybrid algorithm for the longest common transposition-invariant subsequence problem. - Sebastian Deorowicz; Szymon Grabowski (Comput. Informatics, 2009)

Range mode and range median queries in constant time and sub-quadratic space. - Holger Petersen 001; Szymon Grabowski (Inf. Process. Lett., 2009)

Average-optimal string matching. - Kimmo Fredriksson; Szymon Grabowski (J. Discrete Algorithms, 2009)

Tight and Simple Web Graph Compression. - Szymon Grabowski; Wojciech Bieniecki (Stringology, 2010)

Merging Adjacency Lists for Efficient Web Graph Compression. - Szymon Grabowski; Wojciech Bieniecki (ICMMI, 2011)

Compression of DNA sequence reads in FASTQ format. - Sebastian Deorowicz; Szymon Grabowski (Bioinform., 2011)

Robust relative compression of genomes with random access. - Sebastian Deorowicz; Szymon Grabowski (Bioinform., 2011)

Engineering Relative Compression of Genomes - Szymon Grabowski; Sebastian Deorowicz (CoRR, 2011)

String matching with inversions and translocations in linear average time (most of the time). - Szymon Grabowski; Simone Faro; Emanuele Giaquinta (Inf. Process. Lett., 2011)

Subcubic Algorithms for the Sequence Excluded LCS Problem. - Sebastian Deorowicz; Szymon Grabowski (ICMMI, 2013)

Fast and Simple Circular Pattern Matching. - Robert Susik; Szymon Grabowski; Sebastian Deorowicz (ICMMI, 2013)

Motif Matching Using Gapped Patterns. - Emanuele Giaquinta; Kimmo Fredriksson; Szymon Grabowski; Esko Ukkonen (IWOCA, 2013)

Data compression for sequencing data. - Sebastian Deorowicz; Szymon Grabowski (Algorithms Mol. Biol., 2013)

Genome compression: a novel approach for large collections. - Sebastian Deorowicz; Agnieszka Danek; Szymon Grabowski (Bioinform., 2013)

Disk-based k-mer counting on a PC. - Sebastian Deorowicz; Agnieszka Debudaj-Grabysz; Szymon Grabowski (BMC Bioinform., 2013)

Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching. - Kimmo Fredriksson; Szymon Grabowski (Eur. J. Comb., 2013)

New algorithms for binary jumbled pattern matching. - Emanuele Giaquinta; Szymon Grabowski (Inf. Process. Lett., 2013)

Approximate pattern matching with k-mismatches in packed text. - Emanuele Giaquinta; Szymon Grabowski; Kimmo Fredriksson (Inf. Process. Lett., 2013)

Fast Matching of Transcription Factor Motifs Using Generalized Position Weight Matrix Models. - Emanuele Giaquinta; Szymon Grabowski; Esko Ukkonen (J. Comput. Biol., 2013)

Experimental evaluation of selected tree structures for exact and approximate k-nearest neighbor classification. - Aleksander Cislak; Szymon Grabowski (FedCSIS, 2014)

Two Simple Full-Text Indexes Based on the Suffix Array. - Szymon Grabowski; Marcin Raniszewski (Stringology, 2014)

Multiple Pattern Matching Revisited. - Robert Susik; Szymon Grabowski; Kimmo Fredriksson (Stringology, 2014)

Indexing large genome collections on a PC. - Agnieszka Danek; Sebastian Deorowicz; Szymon Grabowski (CoRR, 2014)

KMC 2: Fast and resource-frugal k-mer counting. - Sebastian Deorowicz; Marek Kokot; Szymon Grabowski; Agnieszka Debudaj-Grabysz (CoRR, 2014)

Disk-based genome sequencing data compression. - Szymon Grabowski; Sebastian Deorowicz; Lukasz Roguski (CoRR, 2014)

Tight and simple Web graph compression for forward and reverse neighbor queries. - Szymon Grabowski; Wojciech Bieniecki (Discret. Appl. Math., 2014)

Efficient algorithms for the longest common subsequence in k-length substrings. - Sebastian Deorowicz; Szymon Grabowski (Inf. Process. Lett., 2014)

Motif matching using gapped patterns. - Emanuele Giaquinta; Kimmo Fredriksson; Szymon Grabowski; Alexandru I. Tomescu; Esko Ukkonen (Theor. Comput. Sci., 2014)

OFR: An Efficient Representation of RDF Datasets. - Jakub Swacha; Szymon Grabowski (SLATE, 2015)

Sampling the Suffix Array with Minimizers. - Szymon Grabowski; Marcin Raniszewski (SPIRE, 2015)

KMC 2: fast and resource-frugal k-mer counting. - Sebastian Deorowicz; Marek Kokot; Szymon Grabowski; Agnieszka Debudaj-Grabysz (Bioinform., 2015)

Disk-based compression of data from genome sequencing. - Szymon Grabowski; Sebastian Deorowicz; Lukasz Roguski (Bioinform., 2015)

A note on the longest common Abelian factor problem. - Szymon Grabowski (CoRR, 2015)

A bloated FM-index reducing the number of cache misses during the search. - Szymon Grabowski; Aleksander Cislak (CoRR, 2015)

A Bloom filter based semi-index on q-grams. - Szymon Grabowski; Robert Susik; Marcin Raniszewski (CoRR, 2015)

Indexing arbitrary-length k-mers in sequencing reads. - Tomasz Marek Kowalski; Szymon Grabowski; Sebastian Deorowicz (CoRR, 2015)

A note on the longest common substring with k-mismatches problem. - Szymon Grabowski (Inf. Process. Lett., 2015)

Longest Common Abelian Factors and Large Alphabets. - Golnaz Badkobeh; Travis Gagie; Szymon Grabowski; Yuto Nakashima 001; Simon J. Puglisi; Shiho Sugimoto (SPIRE, 2016)

Comment on: 'ERGC: an efficient referential genome compression algorithm'. - Sebastian Deorowicz; Szymon Grabowski; Idoia Ochoa; Mikel Hernaez; Tsachy Weissman (Bioinform., 2016)

Suffix arrays with a twist. - Tomasz Marek Kowalski; Szymon Grabowski; Kimmo Fredriksson; Marcin Raniszewski (CoRR, 2016)

New tabulation and sparse dynamic programming based techniques for sequence similarity problems. - Szymon Grabowski (Discret. Appl. Math., 2016)

FM-index for Dummies. - Szymon Grabowski; Marcin Raniszewski; Sebastian Deorowicz (BDAS, 2017)

Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings. - Szymon Grabowski (SPIRE, 2017)

Faster Batched Range Minimum Queries. - Szymon Grabowski; Tomasz Marek Kowalski (Stringology, 2017)

A Practical Index for Approximate Dictionary Matching with Few Mismatches. - Aleksander Cislak; Szymon Grabowski (Comput. Informatics, 2017)

Sampled suffix array with minimizers. - Szymon Grabowski; Marcin Raniszewski (Softw. Pract. Exp., 2017)

A Bloom filter based semi-index on q-grams. - Szymon Grabowski; Robert Susik; Marcin Raniszewski (Softw. Pract. Exp., 2017)

SOPanG: online text searching over a pan-genome. - Aleksander Cislak; Szymon Grabowski; Jan Holub 001 (Bioinform., 2018)

On Abelian Longest Common Factor with and without RLE. - Szymon Grabowski; Tomasz Kociumaka; Jakub Radoszewski (Fundam. Informaticae, 2018)

Rank and select: Another lesson learned. - Szymon Grabowski; Marcin Raniszewski (Inf. Syst., 2018)

Faster range minimum queries. - Tomasz Marek Kowalski; Szymon Grabowski (Softw. Pract. Exp., 2018)

Viral Genome Deep Classifier. - Anna Fabijanska; Szymon Grabowski (IEEE Access, 2019)

Whisper: read sorting allows robust mapping of DNA sequencing data. - Sebastian Deorowicz; Agnieszka Debudaj-Grabysz; Adam Gudys; Szymon Grabowski (Bioinform., 2019)

copMEM: finding maximal exact matches via sampling both genomes. - Szymon Grabowski; Wojciech Bieniecki (Bioinform., 2019)

Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations. - Aleksander Cislak; Szymon Grabowski (Comput. Informatics, 2019)

Suffix Arrays with a Twist. - Tomasz Marek Kowalski; Szymon Grabowski; Kimmo Fredriksson (Comput. Informatics, 2019)

Revisiting Multiple Pattern Matching. - Robert Susik; Szymon Grabowski; Kimmo Fredriksson (Comput. Informatics, 2019)

PgRC: pseudogenome-based read compressor. - Tomasz Marek Kowalski; Szymon Grabowski (Bioinform., 2020)

SOPanG 2: online searching over a pan-genome without false positives. - Aleksander Cislak; Szymon Grabowski (CoRR, 2020)

Algorithms for all-pairs Hamming distance based similarity. - Szymon Grabowski; Tomasz Marek Kowalski (Softw. Pract. Exp., 2021)

Efficient and compact representations of some non-canonical prefix-free codes. - Antonio Fariña; Travis Gagie; Szymon Grabowski; Giovanni Manzini; Gonzalo Navarro 001; Alberto Ordóñez Pereira (Theor. Comput. Sci., 2022)

Space-efficient Huffman codes revisited. - Szymon Grabowski; Dominik Köppl (Inf. Process. Lett., 2023)

copMEM2: robust and scalable maximum exact match finding. - Szymon Grabowski; Wojciech Bieniecki (Bioinform., 2023)

Keydrop: Dynamic Keyboard Layout for Faster Typing and Fewer Typos. - Robert Susik; Szymon Grabowski (Int. J. Hum. Comput. Interact., 2024)

Boosting exact pattern matching with extreme gradient boosting (and more). - Robert Susik; Szymon Grabowski (J. Supercomput., 2025)