Tomasz Kociumaka

266 papers A* 40A 16B 32C 18Misc 3Journal 153Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries. SODA Dominik Kempa, Tomasz Kociumaka
2026	J	`jnl`	Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts. Theory Comput. Syst. Anouk Duyster, Tomasz Kociumaka
2026	J	`jnl`	On the complexity of computing the co-lexicographic width of a regular language. J. Comput. Syst. Sci. Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Tomasz Kociumaka, Bojana Kodric, Alberto Policriti, Nicola Prezza
2026	J	`jnl`	Random Access in Grammar-Compressed Strings: Optimal Trade-Offs in Almost All Parameter Regimes. CoRR Anouk Duyster, Tomasz Kociumaka
2026	A*	`conf`	Space-Efficient k-Mismatch Text Indexes. SODA Tomasz Kociumaka, Jakub Radoszewski
2026	A*	`conf`	Tight Lower Bounds for Central String Queries in Compressed Space. SODA Dominik Kempa, Tomasz Kociumaka
2026	A	`conf`	Time-Optimal Construction of String Synchronizing Sets. STACS Jonas Ellert, Tomasz Kociumaka
2026	J	`jnl`	Time-Optimal Construction of String Synchronizing Sets. CoRR Jonas Ellert, Tomasz Kociumaka
2025	A*	`conf`	Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights. STOC Egor Gorbachev, Tomasz Kociumaka
2025	A	`conf`	Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds. ESA Itai Boneh, Egor Gorbachev, Tomasz Kociumaka
2025	J	`jnl`	Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds. CoRR Itai Boneh, Egor Gorbachev, Tomasz Kociumaka
2025	A	`conf`	Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications. ESA Pawel Gawrychowski, Egor Gorbachev, Tomasz Kociumaka
2025	A*	`conf`	Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance. FOCS Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
2025	J	`jnl`	Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance. CoRR Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
2025	J	`jnl`	Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries. CoRR Dominik Kempa, Tomasz Kociumaka
2025	A	`conf`	Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime. ESA Tomasz Kociumaka, Ali Shahali
2025	J	`jnl`	Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime. CoRR Tomasz Kociumaka, Ali Shahali
2025	J	`jnl`	Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts. CoRR Anouk Duyster, Tomasz Kociumaka
2025	A*	`conf`	Near-Optimal Property Testers for Pattern Matching. FOCS Ce Jin, Tomasz Kociumaka
2025	J	`jnl`	Near-Optimal Property Testers for Pattern Matching. CoRR Ce Jin, Tomasz Kociumaka
2025	A*	`conf`	Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. SODA Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2025	J	`jnl`	On the Hardness Hierarchy for the O(n √(log n)) Complexity in the Word RAM. CoRR Dominik Kempa, Tomasz Kociumaka
2025	A*	`conf`	On the Hardness Hierarchy for the O(n√log n) Complexity in the Word RAM. STOC Dominik Kempa, Tomasz Kociumaka
2025	A*	`conf`	Pattern Matching under Weighted Edit Distance. FOCS Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2025	J	`jnl`	Pattern Matching under Weighted Edit Distance. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2025	J	`jnl`	Space-Efficient k-Mismatch Text Indexes. CoRR Tomasz Kociumaka, Jakub Radoszewski
2025	J	`jnl`	Tight Lower Bounds for Central String Queries in Compressed Space. CoRR Dominik Kempa, Tomasz Kociumaka
2024	J	`jnl`	An Improved Algorithm for The ACM Trans. Algorithms Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
2024	J	`jnl`	Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights. CoRR Egor Gorbachev, Tomasz Kociumaka
2024	B	`conf`	Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. SPAA Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
2024	J	`jnl`	Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
2024	J	`jnl`	Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications. CoRR Pawel Gawrychowski, Egor Gorbachev, Tomasz Kociumaka
2024	A*	`conf`	Dynamic Dynamic Time Warping. SODA Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg
2024	A*	`conf`	Faster Sublinear-Time Edit Distance. SODA Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka
2024	J	`jnl`	Internal Pattern Matching Queries in a Text and Applications. SIAM J. Comput. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2024	A*	`conf`	Lempel-Ziv (LZ77) Factorization in Sublinear Time. FOCS Dominik Kempa, Tomasz Kociumaka
2024	J	`jnl`	Lempel-Ziv (LZ77) Factorization in Sublinear Time. CoRR Dominik Kempa, Tomasz Kociumaka
2024	C	`conf`	Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts. SPIRE Anouk Duyster, Tomasz Kociumaka
2024	A*	`conf`	Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. SODA Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan
2024	J	`jnl`	Near-Optimal Search Time in δ-Optimal Space, and Vice Versa. Algorithmica Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares
2024	J	`jnl`	Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. CoRR Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2024	A*	`conf`	On the Communication Complexity of Approximate Pattern Matching. STOC Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2024	J	`jnl`	On the Communication Complexity of Approximate Pattern Matching. CoRR Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2024	J	`jnl`	On the Complexity of Computing the Co-lexicographic Width of a Regular Language. CoRR Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Tomasz Kociumaka, Bojana Kodric, Alberto Policriti, Nicola Prezza
2023	A	`conf`	An Algorithmic Bridge Between Hamming and Levenshtein Distances. ITCS Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha
2023	A*	`conf`	Approximating Edit Distance in the Fully Dynamic Model. FOCS Tomasz Kociumaka, Anish Mukherjee, Barna Saha
2023	J	`jnl`	Approximating Edit Distance in the Fully Dynamic Model. CoRR Tomasz Kociumaka, Anish Mukherjee, Barna Saha
2023	A	`conf`	Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. ESA Tomasz Kociumaka, Adam Polak
2023	A*	`conf`	Breaking the 𝒪( SODA Dominik Kempa, Tomasz Kociumaka
2023	A*	`conf`	Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. FOCS Dominik Kempa, Tomasz Kociumaka
2023	J	`jnl`	Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. CoRR Dominik Kempa, Tomasz Kociumaka
2023	J	`jnl`	Dynamic Dynamic Time Warping. CoRR Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg
2023	J	`jnl`	Faster Sublinear-Time Edit Distance. CoRR Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka
2023	B	`conf`	Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. CPM Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2023	J	`jnl`	Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. CoRR Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan
2023	A*	`conf`	Optimal Algorithms for Bounded Weighted Edit Distance. FOCS Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
2023	J	`jnl`	Optimal Algorithms for Bounded Weighted Edit Distance. CoRR Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
2023	J	`jnl`	Publisher Correction: Longest Common Substring with Approximately k Mismatches. Algorithmica Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
2023	B	`conf`	Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. ISAAC Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya
2023	J	`jnl`	Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. CoRR Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya
2023	J	`jnl`	Tight Bound for the Number of Distinct Palindromes in a Tree. Electron. J. Comb. Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2023	J	`jnl`	Toward a Definitive Compressibility Measure for Repetitive Sequences. IEEE Trans. Inf. Theory Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
2023	J	`jnl`	Weighted Edit Distance Computation: Strings, Trees and Dyck. CoRR Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
2023	A*	`conf`	Weighted Edit Distance Computation: Strings, Trees, and Dyck. STOC Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
2022	J	`jnl`	A periodicity lemma for partial words. Inf. Comput. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2022	J	`jnl`	An Algorithmic Bridge Between Hamming and Levenshtein Distances. CoRR Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha
2022	A*	`conf`	An Improved Algorithm for The k-Dyck Edit Distance Problem. SODA Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
2022	A	`conf`	Approximate Circular Pattern Matching. ESA Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2022	J	`jnl`	Approximate Circular Pattern Matching. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2022	C	`conf`	Computing Longest (Common) Lyndon Subsequences. IWOCA Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
2022	J	`jnl`	Computing Longest (Common) Lyndon Subsequences. CoRR Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
2022	J	`jnl`	Dynamic Suffix Array with Polylogarithmic Queries and Updates. CoRR Dominik Kempa, Tomasz Kociumaka
2022	A*	`conf`	Dynamic suffix array with polylogarithmic queries and updates. STOC Dominik Kempa, Tomasz Kociumaka
2022	J	`jnl`	Efficient Computation of Sequence Mappability. Algorithmica Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
2022	J	`jnl`	Efficient representation and counting of antipower factors in words. Inf. Comput. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2022	A*	`conf`	Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. FOCS Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2022	J	`jnl`	Faster Pattern Matching under Edit Distance. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2022	A*	`conf`	Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. FOCS Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha
2022	A*	`conf`	How Compression and Approximation Affect Efficiency in String Distance Measures. SODA Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha
2022	A*	`conf`	Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. ICALP Debarati Das, Tomasz Kociumaka, Barna Saha
2022	B	`conf`	Near-Optimal Search Time in δ-Optimal Space. LATIN Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares
2022	J	`jnl`	Near-Optimal Search Time in δ-Optimal Space. CoRR Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares
2022	J	`jnl`	Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. CoRR Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh
2022	J	`jnl`	Resolution of the burrows-wheeler transform conjecture. Commun. ACM Dominik Kempa, Tomasz Kociumaka
2022	B	`conf`	The Dynamic k-Mismatch Problem. CPM Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
2022	A*	`conf`	Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. FOCS Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh
2021	J	`jnl`	An Improved Algorithm for The k-Dyck Edit Distance Problem. CoRR Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
2021	J	`jnl`	Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays. CoRR Dominik Kempa, Tomasz Kociumaka
2021	J	`jnl`	Circular pattern matching with J. Comput. Syst. Sci. Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021	A	`conf`	Faster Algorithms for Longest Common Substring. ESA Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
2021	J	`jnl`	Faster Algorithms for Longest Common Substring. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
2021	J	`jnl`	Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. CoRR Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha
2021	J	`jnl`	How Compression and Approximation Affect Efficiency in String Distance Measures. CoRR Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha
2021	J	`jnl`	Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. CoRR Debarati Das, Tomasz Kociumaka, Barna Saha
2021	A*	`conf`	Improved dynamic algorithms for longest increasing subsequence. STOC Tomasz Kociumaka, Saeed Seddighin
2021	J	`jnl`	Internal Dictionary Matching. Algorithmica Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2021	J	`jnl`	Maximal unbordered factors of random strings. Theor. Comput. Sci. Patrick Hagge Cording, Travis Gagie, Mathias Bæk Tejs Knudsen, Tomasz Kociumaka
2021	J	`jnl`	Optimal-Time Dictionary-Compressed Indexes. ACM Trans. Algorithms Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
2021	J	`jnl`	Small space and streaming pattern matching with k edits. CoRR Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya
2021	A*	`conf`	Small-space and streaming pattern matching with $k$ edits. FOCS Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya
2021	J	`jnl`	The Dynamic k-Mismatch Problem. CoRR Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
2020	J	`jnl`	A Linear-Time Algorithm for Seeds Computation. ACM Trans. Algorithms Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2020	B	`conf`	Approximating Longest Common Substring with k mismatches: Theory and Practice. CPM Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
2020	J	`jnl`	Approximating Text-to-Pattern Hamming Distances. CoRR Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2020	J	`jnl`	Approximating longest common substring with $k$ mismatches: Theory and practice. CoRR Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
2020	A*	`conf`	Approximating text-to-pattern Hamming distances. STOC Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2020	B	`conf`	Counting Distinct Patterns in Internal Dictionary Matching. CPM Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	J	`jnl`	Counting Distinct Patterns in Internal Dictionary Matching. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	B	`conf`	Dynamic String Alignment. CPM Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes
2020	C	`conf`	Efficient Enumeration of Distinct Factors Using Package Representations. SPIRE Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2020	A*	`conf`	Faster Approximate Pattern Matching: A Unified Approach. FOCS Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2020	J	`jnl`	Faster Approximate Pattern Matching: A Unified Approach. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2020	—	`conf`	Improved Circular k-Mismatch Sketches. APPROX-RANDOM Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski
2020	J	`jnl`	Improved Circular k-Mismatch Sketches. CoRR Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski
2020	J	`jnl`	Improved Dynamic Algorithms for Longest Increasing Subsequence. CoRR Tomasz Kociumaka, Saeed Seddighin
2020	J	`jnl`	Indexing weighted sequences: Neat and efficient. Inf. Comput. Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski
2020	A	`conf`	Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ESA Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz
2020	A*	`conf`	Resolution of the Burrows-Wheeler Transform Conjecture. FOCS Dominik Kempa, Tomasz Kociumaka
2020	J	`jnl`	String periods in the order-preserving model. Inf. Comput. Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2020	A*	`conf`	Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance. FOCS Tomasz Kociumaka, Barna Saha
2020	J	`jnl`	Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance. CoRR Tomasz Kociumaka, Barna Saha
2020	B	`conf`	The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. CPM Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2020	J	`jnl`	The Streaming k-Mismatch Problem: Tradeoffs between Space and Total Time. CoRR Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2020	J	`jnl`	Tight Bound for the Number of Distinct Palindromes in a Tree. CoRR Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2020	B	`conf`	Time-Space Tradeoffs for Finding a Long Common Substring. CPM Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, Matan Kraus
2020	J	`jnl`	Time-Space Tradeoffs for Finding a Long Common Substring. CoRR Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, Matan Kraus
2020	B	`conf`	Towards a Definitive Measure of Repetitiveness. LATIN Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
2020	J	`jnl`	Universal reconstruction of a string. Theor. Comput. Sci. Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019	B	`conf`	Circular Pattern Matching with k Mismatches. FCT Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Circular Pattern Matching with k Mismatches. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Correction to: Longest Common Substring with Approximately k Mismatches. Algorithmica Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
2019	J	`jnl`	Deleting Vertices to Graphs of Bounded Genus. Algorithmica Tomasz Kociumaka, Marcin Pilipczuk
2019	B	`conf`	Dynamic Dictionary Matching in the Online Model. WADS Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2019	C	`conf`	Efficient Representation and Counting of Antipower Factors in Words. LATA Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019	A*	`conf`	Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. ICALP Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid
2019	J	`jnl`	Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. CoRR Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid
2019	B	`conf`	Internal Dictionary Matching. ISAAC Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019	J	`jnl`	Internal Dictionary Matching. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019	J	`jnl`	Linear Search by a Pair of Distinct-Speed Robots. Algorithmica Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak
2019	J	`jnl`	Longest Common Substring with Approximately k Mismatches. Algorithmica Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
2019	C	`conf`	On Longest Common Property Preserved Substring Queries. SPIRE Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
2019	J	`jnl`	On Longest Common Property Preserved Substring Queries. CoRR Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
2019	J	`jnl`	Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. Theory Comput. Syst. Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
2019	B	`conf`	Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CoRR Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	B	`conf`	RLE Edit Distance in Near Optimal Time. MFCS Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
2019	J	`jnl`	RLE edit distance in near optimal time. CoRR Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
2019	J	`jnl`	Resolution of the Burrows-Wheeler Transform Conjecture. CoRR Dominik Kempa, Tomasz Kociumaka
2019	J	`jnl`	String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure. CoRR Dominik Kempa, Tomasz Kociumaka
2019	A*	`conf`	String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. STOC Dominik Kempa, Tomasz Kociumaka
2019	A*	`conf`	The streaming k-mismatch problem. SODA Raphaël Clifford, Tomasz Kociumaka, Ely Porat
2019	J	`jnl`	Towards a Definitive Measure of Repetitiveness. CoRR Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
2019	C	`conf`	Weighted Shortest Common Supersequence Problem Revisited. SPIRE Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Weighted Shortest Common Supersequence Problem Revisited. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018	A	`conf`	Edit Distance with Block Operations. ESA Michal Ganczorz, Pawel Gawrychowski, Artur Jez, Tomasz Kociumaka
2018	C	`conf`	Efficient Computation of Sequence Mappability. SPIRE Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
2018	J	`jnl`	Efficient Computation of Sequence Mappability. CoRR Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
2018	J	`jnl`	Efficient Representation and Counting of Antipower Factors in Words. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018	J	`jnl`	Efficient algorithms for shortest partial seeds in words. Theor. Comput. Sci. Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	C	`conf`	Faster Recovery of Approximate Periods over Edit Distance. SPIRE Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018	J	`jnl`	Faster Recovery of Approximate Periods over Edit Distance. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018	—	`conf`	How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	B	`conf`	Linear-Time Algorithm for Long LCF with k Mismatches. CPM Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	J	`jnl`	Linear-Time Algorithm for Long LCF with k Mismatches. CoRR Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	B	`conf`	Longest Unbordered Factor in Quasilinear Time. ISAAC Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis
2018	J	`jnl`	Longest Unbordered Factor in Quasilinear Time. CoRR Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis
2018	J	`jnl`	On Abelian Longest Common Factor with and without RLE. CoRR Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski
2018	J	`jnl`	On Abelian Longest Common Factor with and without RLE. Fundam. Informaticae Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski
2018	C	`conf`	On Periodicity Lemma for Partial Words. LATA Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	J	`jnl`	On Periodicity Lemma for Partial Words. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	J	`jnl`	On the string consensus problem and the Manhattan sequence consensus problem. Theor. Comput. Sci. Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	A*	`conf`	Optimal Dynamic Strings. SODA Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
2018	A	`conf`	String Periods in the Order-Preserving Model. STACS Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2018	J	`jnl`	String Periods in the Order-Preserving Model. CoRR Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2017	J	`jnl`	Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2017	J	`jnl`	Deleting vertices to graphs of bounded genus. CoRR Tomasz Kociumaka, Marcin Pilipczuk
2017	Misc	`conf`	Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2017	J	`jnl`	Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. Algorithmica Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2017	J	`jnl`	Fast algorithms for Abelian periods in words and greatest common divisor queries. J. Comput. Syst. Sci. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2017	J	`jnl`	Hardness of Approximation for Strip Packing. ACM Trans. Comput. Theory Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk
2017	J	`jnl`	Indexing Weighted Sequences: Neat and Efficient. CoRR Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski
2017	J	`jnl`	Longest common substring with approximately k mismatches. CoRR Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
2017	C	`conf`	On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. SPIRE Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi
2017	J	`jnl`	On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. CoRR Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi
2017	A*	`conf`	Sparse Suffix Tree Construction in Optimal Time and Space. SODA Pawel Gawrychowski, Tomasz Kociumaka
2017	J	`jnl`	String Powers in Trees. Algorithmica Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2017	J	`jnl`	The streaming k-mismatch problem. CoRR Raphaël Clifford, Tomasz Kociumaka, Ely Porat
2016	J	`jnl`	A Fast Branching Algorithm for Cluster Vertex Deletion. Theory Comput. Syst. Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk
2016	J	`jnl`	Computing minimal and maximal suffixes of a substring. Theor. Comput. Sci. Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Ignat I. Kolesnichenko, Tatiana Starikovskaya
2016	B	`conf`	Efficient Index for Weighted Sequences. CPM Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
2016	J	`jnl`	Efficient Index for Weighted Sequences. CoRR Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
2016	J	`jnl`	Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. SIAM J. Discret. Math. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2016	J	`jnl`	Fast computation of abelian runs. Theor. Comput. Sci. Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston
2016	B	`conf`	Faster Longest Common Extension Queries in Strings over General Alphabets. CPM Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Faster Longest Common Extension Queries in Strings over General Alphabets. CoRR Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Hardness of approximation for strip packing. CoRR Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk
2016	B	`conf`	Linear Search by a Pair of Distinct-Speed Robots. SIROCCO Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak
2016	J	`jnl`	Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Maximum number of distinct and nonequivalent nonstandard squares in a word. Theor. Comput. Sci. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	B	`conf`	Minimal Suffix and Rotation of a Substring in Optimal Time. CPM Tomasz Kociumaka
2016	J	`jnl`	Minimal Suffix and Rotation of a Substring in Optimal Time. CoRR Tomasz Kociumaka
2016	C	`conf`	Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	On the greedy algorithm for the Shortest Common Superstring problem with reversals. Inf. Process. Lett. Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Order-preserving indexing. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Parameterizing PWM- and Profile-Matching and Knapsack by the feasible-weight solutions count. CoRR Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
2016	B	`conf`	Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. ISAAC Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
2016	J	`jnl`	Sparse Suffix Tree Construction in Optimal Time and Space. CoRR Pawel Gawrychowski, Tomasz Kociumaka
2015	J	`jnl`	A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2015	J	`jnl`	An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph. Inf. Process. Lett. Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk
2015	A	`conf`	Approximating LZ77 via Small-Space Multiple-Pattern Matching. ESA Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka
2015	J	`jnl`	Approximating LZ77 via Small-Space Multiple-Pattern Matching. CoRR Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka
2015	—	`conf`	Approximating Upper Degree-Constrained Partial Orientations. APPROX-RANDOM Marek Cygan, Tomasz Kociumaka
2015	C	`conf`	Efficient Algorithms for Longest Closed Factor Array. SPIRE Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen
2015	J	`jnl`	Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2015	J	`jnl`	Fast Algorithm for Partial Covers in Words. Algorithmica Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015	J	`jnl`	Fast Computation of Abelian Runs. CoRR Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston
2015	A*	`conf`	Internal Pattern Matching Queries in a Text and Applications. SODA Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015	J	`jnl`	Linear-time version of Holub's algorithm for morphic imprimitivity testing. Theor. Comput. Sci. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015	J	`jnl`	On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals. CoRR Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015	J	`jnl`	Optimal Dynamic Strings. CoRR Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
2015	B	`conf`	String Powers in Trees. CPM Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015	—	`conf`	Subquadratic-Time Algorithms for Abelian Stringology Problems. MACIS Tomasz Kociumaka, Jakub Radoszewski, Bartlomiej Wisniewski
2015	C	`conf`	Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2015	B	`conf`	Universal Reconstruction of a String. WADS Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015	A*	`conf`	Wavelet Trees Meet Suffix Trees. SODA Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
2014	Misc	`conf`	A Fast Branching Algorithm for Cluster Vertex Deletion. CSR Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk
2014	J	`jnl`	An LP-Rounding $2\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph. CoRR Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk
2014	J	`jnl`	Approximating Upper Degree-Constrained Partial Orientations. CoRR Marek Cygan, Tomasz Kociumaka
2014	B	`conf`	Computing Minimal and Maximal Suffixes of a Substring Revisited. CPM Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
2014	B	`conf`	Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. CPM Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2014	A	`conf`	Constant Factor Approximation for Capacitated k-Center with Outliers. STACS Marek Cygan, Tomasz Kociumaka
2014	J	`jnl`	Constant Factor Approximation for Capacitated k-Center with Outliers. CoRR Tomasz Kociumaka, Marek Cygan
2014	B	`conf`	Covering Problems for Partial Words and for Indeterminate Strings. ISAAC Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	Covering Problems for Partial Words and for Indeterminate Strings. CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	B	`conf`	Efficient Algorithms for Shortest Partial Seeds in Words. CPM Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	Efficient counting of square substrings in a tree. Theor. Comput. Sci. Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	Fast Algorithm for Partial Covers in Words. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Solon P. Pissis, Tomasz Walen
2014	J	`jnl`	Faster deterministic Feedback Vertex Set. Inf. Process. Lett. Tomasz Kociumaka, Marcin Pilipczuk
2014	C	`conf`	Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Developments in Language Theory Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	C	`conf`	On the String Consensus Problem and the Manhattan Sequence Consensus Problem. SPIRE Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	On the String Consensus Problem and the Manhattan Sequence Consensus Problem. CoRR Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	A	`conf`	Sublinear Space Algorithms for the Longest Common Substring Problem. ESA Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhøj
2014	J	`jnl`	Sublinear Space Algorithms for the Longest Common Substring Problem. CoRR Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhøj
2014	J	`jnl`	Wavelet Trees Meet Suffix Trees. CoRR Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
2013	J	`jnl`	A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2013	J	`jnl`	A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2013	A	`conf`	Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. ESA Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2013	J	`jnl`	Enhanced string covering. Theor. Comput. Sci. Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczynski
2013	B	`conf`	Fast Algorithm for Partial Covers in Words. CPM Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	A	`conf`	Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. STACS Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2013	J	`jnl`	Fast branching algorithm for Cluster Vertex Deletion. CoRR Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk
2013	J	`jnl`	Faster deterministic Feedback Vertex Set. CoRR Tomasz Kociumaka, Marcin Pilipczuk
2013	C	`conf`	Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. LATA Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	C	`conf`	Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	Order-Preserving Suffix Trees and Their Algorithmic Applications CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	Substring Suffix Selection. CoRR Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
2012	J	`jnl`	A Note on Efficient Computation of All Abelian Periods in a String CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2012	A*	`conf`	A linear time algorithm for seeds computation. SODA Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012	B	`conf`	Efficient Counting of Square Substrings in a Tree. ISAAC Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012	C	`conf`	Efficient Data Structures for the Factor Periodicity Problem. SPIRE Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012	Misc	`conf`	New and Efficient Approaches to the Quasiperiodic Characterisation of a String. PSC Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, William F. Smyth, Wojciech Tyczynski
2012	B	`conf`	The Maximum Number of Squares in a Tree. CPM Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2011	J	`jnl`	A Linear Time Algorithm for Seeds Computation CoRR Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen