Tomasz Walen
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
60
Venues
16
Active years
2006–2026
Best venue rank
A*
Where they publish
Papers
60 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPM | Improved Bounds on the Maximum Number of Distinct Squares in Circular Words. | Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2025 | ESA | Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares. | Yuto Nakashima, Jakub Radoszewski, Tomasz Walen |
| 2025 | MFCS | Counting Distinct Square Substrings in Sublinear Time. | Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2024 | STACS | Approximate Circular Pattern Matching Under Edit Distance. | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2024 | SPIRE | Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. | Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2023 | CPM | Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. | Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2022 | CPM | Linear-Time Computation of Shortest Covers of All Rotations of a String. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2022 | CPM | Rectangular Tile Covers of 2D-Strings. | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2022 | ESA | Approximate Circular Pattern Matching. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2022 | SPIRE | Subsequence Covers of Words. | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2021 | CPM | Computing Covers of 2D-Strings. | Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2021 | ESA | Hardness of Detecting Abelian and Additive Square Factors in Strings. | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2021 | SPIRE | String Covers of a Tree. | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | CPM | Counting Distinct Patterns in Internal Dictionary Matching. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | CPM | Unary Words Have the Smallest Levenshtein k-Neighbourhoods. | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba |
| 2020 | ESA | The Number of Repetitions in 2D-Strings. | Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2020 | SPIRE | Efficient Enumeration of Distinct Factors Using Package Representations. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2020 | SPIRE | Internal Quasiperiod Queries. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | WALCOM | Shortest Covers of All Cyclic Shifts of a String. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | CPM | Quasi-Linear-Time Algorithm for Longest Common Circular Factor. | Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | FCT | Circular Pattern Matching with k Mismatches. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | ISAAC | Internal Dictionary Matching. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2019 | LATA | Efficient Representation and Counting of Antipower Factors in Words. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | SPIRE | Weighted Shortest Common Supersequence Problem Revisited. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2018 | CPM | Linear-Time Algorithm for Long LCF with k Mismatches. | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2018 | LATA | On Periodicity Lemma for Partial Words. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2018 | STACS | String Periods in the Order-Preserving Model. | Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen |
| 2018 | SPIRE | Faster Recovery of Approximate Periods over Edit Distance. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2017 | COCOON | Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2016 | CPM | Faster Longest Common Extension Queries in Strings over General Alphabets. | Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen |
| 2016 | SPIRE | Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2015 | CPM | String Powers in Trees. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2015 | SODA | Internal Pattern Matching Queries in a Text and Applications. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2015 | SPIRE | Efficient Algorithms for Longest Closed Factor Array. | Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen |
| 2015 | SPIRE | Tight Bound for the Number of Distinct Palindromes in a Tree. | Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen |
| 2015 | WADS | Universal Reconstruction of a String. | Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | CPM | Efficient Algorithms for Shortest Partial Seeds in Words. | Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | DLT | Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | ISAAC | Covering Problems for Partial Words and for Indeterminate Strings. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | SPIRE | On the String Consensus Problem and the Manhattan Sequence Consensus Problem. | Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2013 | CPM | Fast Algorithm for Partial Covers in Words. | Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2013 | LATA | Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2013 | SPIRE | Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | CPM | The Maximum Number of Squares in a Tree. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen |
| 2012 | ISAAC | Efficient Counting of Square Substrings in a Tree. | Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | SODA | A linear time algorithm for seeds computation. | Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | SPIRE | Efficient Data Structures for the Factor Periodicity Problem. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2011 | CPM | Efficient Seeds Computation Revisited. | Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen |
| 2011 | CPM | Polynomial-Time Approximation Algorithms for Weighted LCS Problem. | Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | CPM | Algorithms for Three Versions of the Shortest Common Superstring Problem. | Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | IWOCA | On the Maximal Sum of Exponents of Runsin a String. | Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | LATA | On the Maximal Number of Cubic Runs in a String. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | SOFSEM | Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
| 2010 | SPIRE | Extracting Powers and Periods in a String from Its Runs Structure. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2009 | IWOCA | LPF Computation Revisited. | Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
| 2009 | IWOCA | On the Maximal Number of Cubic Subwords in a String. | Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2008 | STACS | Improved Algorithms for the Range Next Value Problem and Applications. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen |
| 2007 | CPM | Algorithms for Computing the Longest Parameterized Common Subsequence. | Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen |
| 2006 | CPM | Approximation of RNA Multiple Structural Alignment. | Marcin Kubica, Romeo Rizzi, Stphane Vialette, Tomasz Walen |
| 2006 | WAOA | Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set. | Petr Kolman, Tomasz Walen |