Skip to content

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.

YearVenueTitleAuthors
2026CPMImproved Bounds on the Maximum Number of Distinct Squares in Circular Words.Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2025ESAFast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares.Yuto Nakashima, Jakub Radoszewski, Tomasz Walen
2025MFCSCounting Distinct Square Substrings in Sublinear Time.Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2024STACSApproximate Circular Pattern Matching Under Edit Distance.Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2024SPIREFaster Algorithms for Ranking/Unranking Bordered and Unbordered Words.Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2023CPMLinear-Time Computation of Cyclic Roots and Cyclic Covers of a String.Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2022CPMLinear-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
2022CPMRectangular Tile Covers of 2D-Strings.Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2022ESAApproximate Circular Pattern Matching.Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2022SPIRESubsequence Covers of Words.Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2021CPMComputing Covers of 2D-Strings.Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2021ESAHardness of Detecting Abelian and Additive Square Factors in Strings.Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021SPIREString Covers of a Tree.Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020CPMCounting Distinct Patterns in Internal Dictionary Matching.Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020CPMUnary Words Have the Smallest Levenshtein k-Neighbourhoods.Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba
2020ESAThe Number of Repetitions in 2D-Strings.Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2020SPIREEfficient Enumeration of Distinct Factors Using Package Representations.Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2020SPIREInternal Quasiperiod Queries.Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020WALCOMShortest Covers of All Cyclic Shifts of a String.Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019CPMQuasi-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
2019FCTCircular Pattern Matching with k Mismatches.Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019ISAACInternal Dictionary Matching.Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019LATAEfficient Representation and Counting of Antipower Factors in Words.Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019SPIREWeighted Shortest Common Supersequence Problem Revisited.Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018CPMLinear-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
2018LATAOn Periodicity Lemma for Partial Words.Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018STACSString Periods in the Order-Preserving Model.Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2018SPIREFaster Recovery of Approximate Periods over Edit Distance.Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2017COCOONEfficient 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
2016CPMFaster Longest Common Extension Queries in Strings over General Alphabets.Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2016SPIRENear-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
2015CPMString Powers in Trees.Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015SODAInternal Pattern Matching Queries in a Text and Applications.Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015SPIREEfficient Algorithms for Longest Closed Factor Array.Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen
2015SPIRETight Bound for the Number of Distinct Palindromes in a Tree.Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2015WADSUniversal Reconstruction of a String.Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014CPMEfficient Algorithms for Shortest Partial Seeds in Words.Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014DLTMaximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word.Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014ISAACCovering Problems for Partial Words and for Indeterminate Strings.Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014SPIREOn the String Consensus Problem and the Manhattan Sequence Consensus Problem.Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013CPMFast Algorithm for Partial Covers in Words.Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013LATALinear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing.Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013SPIREOrder-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
2012CPMThe Maximum Number of Squares in a Tree.Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2012ISAACEfficient Counting of Square Substrings in a Tree.Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012SODAA linear time algorithm for seeds computation.Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012SPIREEfficient Data Structures for the Factor Periodicity Problem.Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2011CPMEfficient Seeds Computation Revisited.Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2011CPMPolynomial-Time Approximation Algorithms for Weighted LCS Problem.Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010CPMAlgorithms for Three Versions of the Shortest Common Superstring Problem.Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010IWOCAOn the Maximal Sum of Exponents of Runsin a String.Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010LATAOn the Maximal Number of Cubic Runs in a String.Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010SOFSEMEfficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays.Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2010SPIREExtracting Powers and Periods in a String from Its Runs Structure.Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2009IWOCALPF Computation Revisited.Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2009IWOCAOn the Maximal Number of Cubic Subwords in a String.Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2008STACSImproved Algorithms for the Range Next Value Problem and Applications.Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen
2007CPMAlgorithms for Computing the Longest Parameterized Common Subsequence.Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen
2006CPMApproximation of RNA Multiple Structural Alignment.Marcin Kubica, Romeo Rizzi, Stphane Vialette, Tomasz Walen
2006WAOAReversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set.Petr Kolman, Tomasz Walen