Broadcasting in Complete Networks with Dynamic Edge Faults. - Zsuzsanna Lipták; A. Nickelsen (OPODIS, 2000)

Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. - Mark Cieliebak; Thomas Erlebach; Zsuzsanna Lipták; Jens Stoye; Emo Welzl (IFIP TCS, 2002)

A Method for Evaluating the Quality of String Dissimilarity Measures and Clustering Algorithms for EST Clustering. - Judith Zimmermann; Zsuzsanna Lipták; Scott Hazelhurst (BIBE, 2004)

Efficient Algorithms for Finding Submasses in Weighted Strings. - Nikhil Bansal 001; Mark Cieliebak; Zsuzsanna Lipták (CPM, 2004)

Algorithmic complexity of protein identification: combinatorics of weighted strings. - Mark Cieliebak; Thomas Erlebach; Zsuzsanna Lipták; Jens Stoye; Emo Welzl (Discret. Appl. Math., 2004)

The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(k a1). - Sebastian Böcker; Zsuzsanna Lipták (COCOON, 2005)

Efficient mass decomposition. - Sebastian Böcker; Zsuzsanna Lipták (SAC, 2005)

Strings in proteomics and transcriptomics : algorithmic and combinatorial questions in mass spectrometry and EST clustering - Zsuzsanna Lipták (2005)

Decomposing Metabolomic Isotope Patterns. - Sebastian Böcker; Matthias C. Letzel; Zsuzsanna Lipták; Anton Pervukhin (WABI, 2006)

A Fast and Simple Algorithm for the Money Changing Problem. - Sebastian Böcker; Zsuzsanna Lipták (Algorithmica, 2007)

Finding submasses in weighted strings with Fast Fourier Transform. - Nikhil Bansal 001; Mark Cieliebak; Zsuzsanna Lipták (Discret. Appl. Math., 2007)

DECOMP - from interpreting Mass Spectrometry peaks to solving the Money Changing Problem. - Sebastian Böcker; Zsuzsanna Lipták; Marcel Martin; Anton Pervukhin; Henner Sudek (Bioinform., 2008)

An overview of the wcd EST clustering tool. - Scott Hazelhurst; Winston Hide; Zsuzsanna Lipták; Ramon Nogueira; Richard Starfield (Bioinform., 2008)

Searching for Jumbled Patterns in Strings. - Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (PSC, 2009)

SIRIUS: decomposing isotope patterns for metabolite identification. - Sebastian Böcker; Matthias C. Letzel; Zsuzsanna Lipták; Anton Pervukhin (Bioinform., 2009)

On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. - Peter Burcsi; Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (FUN, 2010)

Efficient Reconstruction of RC-Equivalent Strings. - Ferdinando Cicalese; Péter L. Erdös; Zsuzsanna Lipták (IWOCA, 2010)

On Prefix Normal Words. - Gabriele Fici; Zsuzsanna Lipták (Developments in Language Theory, 2011)

KABOOM! A new suffix array based algorithm for clustering expression data. - Scott Hazelhurst; Zsuzsanna Lipták (Bioinform., 2011)

Melodic String Matching via Interval Consolidation and Fragmentation. - Carl Barton; Emilios Cambouropoulos; Costas S. Iliopoulos; Zsuzsanna Lipták (AIAI (2), 2012)

Binary Jumbled String Matching: Faster Indexing in Less Space - Golnaz Badkobeh; Gabriele Fici; Steve Kroon; Zsuzsanna Lipták (CoRR, 2012)

Algorithms for Jumbled Pattern Matching in Strings. - Peter Burcsi; Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (Int. J. Found. Comput. Sci., 2012)

Efficient algorithms for the periodic subgraphs mining problem. - Alberto Apostolico; Péter L. Erdös; Ervin Györi; Zsuzsanna Lipták; Cinzia Pizzi (J. Discrete Algorithms, 2012)

A linear algorithm for string reconstruction in the reverse complement equivalence model. - Ferdinando Cicalese; Péter L. Erdös; Zsuzsanna Lipták (J. Discrete Algorithms, 2012)

On Approximate Jumbled Pattern Matching in Strings. - Peter Burcsi; Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (Theory Comput. Syst., 2012)

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. - Ferdinando Cicalese; Travis Gagie; Emanuele Giaquinta; Eduardo Sany Laber; Zsuzsanna Lipták; Romeo Rizzi; Alexandru I. Tomescu (SPIRE, 2013)

A Note on Words With the Smallest Number of Closed Factors - Golnaz Badkobeh; Gabriele Fici; Zsuzsanna Lipták (CoRR, 2013)

Report on StringMasters 2013. - Zsuzsanna Lipták (Bull. EATCS, 2013)

Binary jumbled string matching for highly run-length compressible texts. - Golnaz Badkobeh; Gabriele Fici; Steve Kroon; Zsuzsanna Lipták (Inf. Process. Lett., 2013)

On Combinatorial Generation of Prefix Normal Words. - Peter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Frank Ruskey; Joe Sawada (CPM, 2014)

Normal, Abby Normal, Prefix Normal. - Peter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Frank Ruskey; Joe Sawada (FUN, 2014)

StringMasters 2012 & 2013 special issue - volume 1. - Maxime Crochemore; Jacqueline W. Daykin; Zsuzsanna Lipták (J. Discrete Algorithms, 2014)

On the Number of Closed Factors in a Word. - Golnaz Badkobeh; Gabriele Fici; Zsuzsanna Lipták (LATA, 2015)

IWOCA 2015 in Verona, Italy. - Zsuzsanna Lipták; Bill Smyth (Bull. EATCS, 2015)

StringMasters 2012 & 2013 special issue - volume 2. - Maxime Crochemore; Jacqueline W. Daykin; Zsuzsanna Lipták (J. Discrete Algorithms, 2015)

Reconstruction of Trees from Jumbled and Weighted Subtrees. - Dénes Bartha; Peter Burcsi; Zsuzsanna Lipták (CPM, 2016)

On the Parikh-de-Bruijn grid. - Peter Burcsi; Zsuzsanna Lipták; W. F. Smyth (CoRR, 2017)

On prefix normal words and prefix normal forms. - Peter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Frank Ruskey; Joe Sawada (Theor. Comput. Sci., 2017)

Bubble-Flip - A New Generation Algorithm for Prefix Normal Words. - Ferdinando Cicalese; Zsuzsanna Lipták; Massimiliano Rossi 001 (LATA, 2018)

Preface. - Zsuzsanna Lipták; W. F. Smyth (Discret. Appl. Math., 2018)

Preface. - Jan Kratochvíl; Zsuzsanna Lipták (Eur. J. Comb., 2018)

When a Dollar Makes a BWT. - Sara Giuliani; Zsuzsanna Lipták; Romeo Rizzi (ICTCS, 2019)

On Infinite Prefix Normal Words. - Ferdinando Cicalese; Zsuzsanna Lipták; Massimiliano Rossi 001 (SOFSEM, 2019)

Pattern Discovery in Colored Strings. - Zsuzsanna Lipták; Simon J. Puglisi; Massimiliano Rossi 001 (SEA, 2020)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. - Péter Burcsi; Gabriele Fici; Zsuzsanna Lipták; Rajeev Raman; Joe Sawada (Theor. Comput. Sci., 2020)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. - Sara Giuliani; Shunsuke Inenaga; Zsuzsanna Lipták; Nicola Prezza; Marinella Sciortino; Anna Toffanello (SOFSEM, 2021)

r-Indexing the eBWT. - Christina Boucher 001; Davide Cenzato; Zsuzsanna Lipták; Massimiliano Rossi 001; Marinella Sciortino (SPIRE, 2021)

Computing the Original eBWT Faster, Simpler, and with Less Memory. - Christina Boucher 001; Davide Cenzato; Zsuzsanna Lipták; Massimiliano Rossi 001; Marinella Sciortino (SPIRE, 2021)

When a dollar makes a BWT. - Sara Giuliani; Zsuzsanna Lipták; Francesco Masillo; Romeo Rizzi (Theor. Comput. Sci., 2021)

A Theoretical and Experimental Analysis of BWT Variants for String Collections. - Davide Cenzato; Zsuzsanna Lipták (CPM, 2022)

On different variants of the Burrows-Wheeler-Transform of string collections. - Davide Cenzato; Zsuzsanna Lipták (DCC, 2022)

CSTs for Terabyte-Sized Data. - Marco Oliva; Davide Cenzato; Massimiliano Rossi 001; Zsuzsanna Lipták; Travis Gagie; Christina Boucher 001 (DCC, 2022)

On Compressing Collections of Substring Samples. - Golnaz Badkobeh; Sara Giuliani; Zsuzsanna Lipták; Simon J. Puglisi (ICTCS, 2022)

When a Dollar in a Fully Clustered Word Makes a BWT. - Sara Giuliani; Zsuzsanna Lipták; Francesco Masillo (ICTCS, 2022)

Suffix Sorting via Matching Statistics. - Zsuzsanna Lipták; Francesco Masillo; Simon J. Puglisi (WABI, 2022)

Computing the optimal BWT of very large string collections. - Davide Cenzato; Veronica Guerrini; Zsuzsanna Lipták; Giovanna Rosone (DCC, 2023)

Bit Catastrophes for the Burrows-Wheeler Transform. - Sara Giuliani; Shunsuke Inenaga; Zsuzsanna Lipták; Giuseppe Romana; Marinella Sciortino; Cristian Urbina (DLT, 2023)

On the Number of Equal-Letter Runs of the Bijective Burrows-Wheeler Transform. - Elena Biagi 002; Davide Cenzato; Zsuzsanna Lipták; Giuseppe Romana (ICTCS, 2023)

Constant Time and Space Updates for the Sigma-Tau Problem. - Zsuzsanna Lipták; Francesco Masillo; Gonzalo Navarro 001; Aaron Williams 001 (SPIRE, 2023)

Maintaining the cycle structure of dynamic permutations. - Zsuzsanna Lipták; Francesco Masillo; Gonzalo Navarro 001 (CoRR, 2023)

BAT-LZ out of hell. - Zsuzsanna Lipták; Francesco Masillo; Gonzalo Navarro 001 (CPM, 2024)

A Textbook Solution for Dynamic Strings. - Zsuzsanna Lipták; Francesco Masillo; Gonzalo Navarro 001 (ESA, 2024)

A BWT-Based Algorithm for Random de Bruijn Sequence Construction. - Zsuzsanna Lipták; Luca Parmigiani (LATIN (1), 2024)

Fast Matching Statistics for Sets of Long Similar Strings. - Zsuzsanna Lipták; Martina Luca; Francesco Masillo; Simon J. Puglisi (PSC, 2024)

A simpler data structure for dynamic strings. - Zsuzsanna Lipták; Francesco Masillo; Gonzalo Navarro 001 (CoRR, 2024)

A Survey of the Bijective Burrows-Wheeler Transform. - Hideo Bannai; Dominik Köppl; Zsuzsanna Lipták (The Expanding World of Compressed Data, 2025)

BWT for String Collections. - Davide Cenzato; Zsuzsanna Lipták; Nadia Pisanti; Giovanna Rosone; Marinella Sciortino (The Expanding World of Compressed Data, 2025)

Prefix-Free Parsing for Merging Big BWTs. - Diego Díaz-Domínguez; Travis Gagie; Veronica Guerrini; Ben Langmead; Zsuzsanna Lipták; Giovanni Manzini; Francesco Masillo; Vikram Shivakumar (SPIRE, 2025)