Tomasz Walen

Orcid: 0000-0002-7369-3309

Affiliations:

University of Warsaw, Poland

According to our database¹, Tomasz Walen authored at least 81 papers between 2007 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Internal Pattern Matching Queries in a Text and Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 2024

Approximate Circular Pattern Matching Under Edit Distance.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words.

[BibT_eX]

[DOI]

Jakub Radoszewski

Wojciech Rytter

Tomasz Walen

Proceedings of the String Processing and Information Retrieval, 2024

2023

Tight Bound for the Number of Distinct Palindromes in a Tree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

A periodicity lemma for partial words.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Efficient representation and counting of antipower factors in words.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Subsequence Covers of Words.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Proceedings of the String Processing and Information Retrieval, 2022

Approximate Circular Pattern Matching.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Rectangular Tile Covers of 2D-Strings.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

Linear-Time Computation of Shortest Covers of All Rotations of a String.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Shortest covers of all cyclic shifts of a string.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Circular pattern matching with <i>k</i> mismatches.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

J. Comput. Syst. Sci., 2021

Internal Dictionary Matching.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Algorithmica, 2021

String Covers of a Tree.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

Hardness of Detecting Abelian and Additive Square Factors in Strings.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Computing Covers of 2D-Strings.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

Universal reconstruction of a string.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A Linear-Time Algorithm for Seeds Computation.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

String periods in the order-preserving model.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Internal Quasiperiod Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2020

Efficient Enumeration of Distinct Factors Using Package Representations.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Proceedings of the String Processing and Information Retrieval, 2020

The Number of Repetitions in 2D-Strings.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Unary Words Have the Smallest Levenshtein k-Neighbourhoods.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Counting Distinct Patterns in Internal Dictionary Matching.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Efficient enumeration of non-equivalent squares in partial words with few holes.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

J. Comb. Optim., 2019

Weighted Shortest Common Supersequence Problem Revisited.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Proceedings of the String Processing and Information Retrieval, 2019

Circular Pattern Matching with k Mismatches.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Quasi-Linear-Time Algorithm for Longest Common Circular Factor.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Efficient algorithms for shortest partial seeds in words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

On the string consensus problem and the Manhattan sequence consensus problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Faster Recovery of Approximate Periods over Edit Distance.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

How Much Different Are Two Words with Different Shortest Periods.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Applications and Innovations, 2018

Linear-Time Algorithm for Long LCF with k Mismatches.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

Covering problems for partial words and for indeterminate strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

String Powers in Trees.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

Maximum number of distinct and nonequivalent nonstandard squares in a word.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Order-preserving indexing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On the greedy algorithm for the Shortest Common Superstring problem with reversals.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Polynomial-time approximation algorithms for weighted LCS problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

Faster Longest Common Extension Queries in Strings over General Alphabets.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

Linear-time version of Holub's algorithm for morphic imprimitivity testing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

A note on the longest common compatible prefix problem for partial words.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Fast Algorithm for Partial Covers in Words.

[BibT_eX]

[DOI]

Algorithmica, 2015

Efficient Algorithms for Longest Closed Factor Array.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

2014

Efficient counting of square substrings in a tree.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Extracting powers and periods in a word from its runs structure.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

RNA Bricks - a database of RNA 3D motifs and their interactions.

[BibT_eX]

[DOI]

Grzegorz Chojnowski

Tomasz Walen

Janusz M. Bujnicki

Nucleic Acids Res., 2014

New simple efficient algorithms computing powers and runs in strings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Efficient seed computation revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

A linear time algorithm for consecutive permutation pattern matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

A note on efficient computation of all Abelian periods in a string.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

On the maximum number of cubic subwords in a word.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Computing the Longest Previous Factor.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Order-Preserving Suffix Trees and Their Algorithmic Applications

[BibT_eX]

[DOI]

CoRR, 2013

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

[BibT_eX]

[DOI]

CoRR, 2013

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

2012

Improved algorithms for the range next value problem and applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On the maximal sum of exponents of runs in a string.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Efficient algorithms for three variants of the LPF table.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

The maximal number of cubic runs in a word.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Efficient Data Structures for the Factor Periodicity Problem.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

The Maximum Number of Squares in a Tree.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Approximation of RNA multiple structural alignment.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

Efficient Seeds Computation Revisited.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

Finding Patterns In Given Intervals.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Improved induced matchings in sparse graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Extracting Powers and Periods in a String from Its Runs Structure.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2010

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

On the Maximal Number of Cubic Runs in a String.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2010

On the Maximal Sum of Exponents of Runsin a String.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Algorithms for Three Versions of the Shortest Common Superstring Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

On the maximal number of highly periodic runs in a string

[BibT_eX]

[DOI]

CoRR, 2009

On the Maximal Number of Cubic Subwords in a String.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

LPF Computation Revisited.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Improved Algorithms for the Range Next Value Problem and Applications.

[BibT_eX]

[DOI]

Maxime Crochemore

Costas S. Iliopoulos

Marcin Kubica

Mohammad Sohel Rahman

Tomasz Walen

Proceedings of the STACS 2008, 2008

2007

RNA multiple structural alignment with longest common subsequences.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Approximating reversal distance for strings with bounded number of duplicates.

[BibT_eX]

[DOI]

Petr Kolman

Tomasz Walen

Discret. Appl. Math., 2007

Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set.

[BibT_eX]

[DOI]

Petr Kolman

Tomasz Walen

Electron. J. Comb., 2007

Algorithms for Computing the Longest Parameterized Common Subsequence.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Tomasz Walen

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...