Tomasz Walen

Affiliations:
  • University of Warsaw, Poland


According to our database1, Tomasz Walen authored at least 80 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Approximate Circular Pattern Matching Under Edit Distance.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023
Tight Bound for the Number of Distinct Palindromes in a Tree.
Electron. J. Comb., 2023

Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022
A periodicity lemma for partial words.
Inf. Comput., 2022

Efficient representation and counting of antipower factors in words.
Inf. Comput., 2022

Subsequence Covers of Words.
Proceedings of the String Processing and Information Retrieval, 2022

Approximate Circular Pattern Matching.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Rectangular Tile Covers of 2D-Strings.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

Linear-Time Computation of Shortest Covers of All Rotations of a String.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
Shortest covers of all cyclic shifts of a string.
Theor. Comput. Sci., 2021

Circular pattern matching with <i>k</i> mismatches.
J. Comput. Syst. Sci., 2021

Internal Dictionary Matching.
Algorithmica, 2021

String Covers of a Tree.
Proceedings of the String Processing and Information Retrieval, 2021

Hardness of Detecting Abelian and Additive Square Factors in Strings.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Computing Covers of 2D-Strings.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
Universal reconstruction of a string.
Theor. Comput. Sci., 2020

A Linear-Time Algorithm for Seeds Computation.
ACM Trans. Algorithms, 2020

String periods in the order-preserving model.
Inf. Comput., 2020

Internal Quasiperiod Queries.
Proceedings of the String Processing and Information Retrieval, 2020

Efficient Enumeration of Distinct Factors Using Package Representations.
Proceedings of the String Processing and Information Retrieval, 2020

The Number of Repetitions in 2D-Strings.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Unary Words Have the Smallest Levenshtein k-Neighbourhoods.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Counting Distinct Patterns in Internal Dictionary Matching.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
Efficient enumeration of non-equivalent squares in partial words with few holes.
J. Comb. Optim., 2019

Weighted Shortest Common Supersequence Problem Revisited.
Proceedings of the String Processing and Information Retrieval, 2019

Circular Pattern Matching with k Mismatches.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Quasi-Linear-Time Algorithm for Longest Common Circular Factor.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Efficient algorithms for shortest partial seeds in words.
Theor. Comput. Sci., 2018

On the string consensus problem and the Manhattan sequence consensus problem.
Theor. Comput. Sci., 2018

Faster Recovery of Approximate Periods over Edit Distance.
Proceedings of the String Processing and Information Retrieval, 2018

How Much Different Are Two Words with Different Shortest Periods.
Proceedings of the Artificial Intelligence Applications and Innovations, 2018

Linear-Time Algorithm for Long LCF with k Mismatches.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017
Covering problems for partial words and for indeterminate strings.
Theor. Comput. Sci., 2017

String Powers in Trees.
Algorithmica, 2017

2016
Maximum number of distinct and nonequivalent nonstandard squares in a word.
Theor. Comput. Sci., 2016

Order-preserving indexing.
Theor. Comput. Sci., 2016

On the greedy algorithm for the Shortest Common Superstring problem with reversals.
Inf. Process. Lett., 2016

Polynomial-time approximation algorithms for weighted LCS problem.
Discret. Appl. Math., 2016

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.
Proceedings of the String Processing and Information Retrieval, 2016

Faster Longest Common Extension Queries in Strings over General Alphabets.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Linear-time version of Holub's algorithm for morphic imprimitivity testing.
Theor. Comput. Sci., 2015

A note on the longest common compatible prefix problem for partial words.
J. Discrete Algorithms, 2015

Fast Algorithm for Partial Covers in Words.
Algorithmica, 2015

Efficient Algorithms for Longest Closed Factor Array.
Proceedings of the String Processing and Information Retrieval, 2015

Internal Pattern Matching Queries in a Text and Applications.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Efficient counting of square substrings in a tree.
Theor. Comput. Sci., 2014

Extracting powers and periods in a word from its runs structure.
Theor. Comput. Sci., 2014

RNA Bricks - a database of RNA 3D motifs and their interactions.
Nucleic Acids Res., 2014

New simple efficient algorithms computing powers and runs in strings.
Discret. Appl. Math., 2014

2013
Efficient seed computation revisited.
Theor. Comput. Sci., 2013

A linear time algorithm for consecutive permutation pattern matching.
Inf. Process. Lett., 2013

A note on efficient computation of all Abelian periods in a string.
Inf. Process. Lett., 2013

On the maximum number of cubic subwords in a word.
Eur. J. Comb., 2013

Computing the Longest Previous Factor.
Eur. J. Comb., 2013

Order-Preserving Suffix Trees and Their Algorithmic Applications
CoRR, 2013

Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications.
CoRR, 2013

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.
Proceedings of the String Processing and Information Retrieval, 2013

2012
Improved algorithms for the range next value problem and applications.
Theor. Comput. Sci., 2012

On the maximal sum of exponents of runs in a string.
J. Discrete Algorithms, 2012

Efficient algorithms for three variants of the LPF table.
J. Discrete Algorithms, 2012

The maximal number of cubic runs in a word.
J. Comput. Syst. Sci., 2012

Efficient Data Structures for the Factor Periodicity Problem.
Proceedings of the String Processing and Information Retrieval, 2012

The Maximum Number of Squares in a Tree.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Approximation of RNA multiple structural alignment.
J. Discrete Algorithms, 2011

Efficient Seeds Computation Revisited.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010
Finding Patterns In Given Intervals.
Fundam. Informaticae, 2010

Improved induced matchings in sparse graphs.
Discret. Appl. Math., 2010

Extracting Powers and Periods in a String from Its Runs Structure.
Proceedings of the String Processing and Information Retrieval, 2010

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

On the Maximal Number of Cubic Runs in a String.
Proceedings of the Language and Automata Theory and Applications, 2010

On the Maximal Sum of Exponents of Runsin a String.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Algorithms for Three Versions of the Shortest Common Superstring Problem.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009
On the maximal number of highly periodic runs in a string
CoRR, 2009

On the Maximal Number of Cubic Subwords in a String.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

LPF Computation Revisited.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Improved Algorithms for the Range Next Value Problem and Applications.
Proceedings of the STACS 2008, 2008

2007
RNA multiple structural alignment with longest common subsequences.
J. Comb. Optim., 2007

Approximating reversal distance for strings with bounded number of duplicates.
Discret. Appl. Math., 2007

Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set.
Electron. J. Comb., 2007

Algorithms for Computing the Longest Parameterized Common Subsequence.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007


  Loading...