Publications



2017



2016

  • C M. Crochemore, C. S. Iliopoulos, T. Kociumaka, R. Kundu, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń
    Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries
    SPIRE 2016:22-34

    Details Publisher version ArXiv

  • J T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń
    Maximum number of distinct and nonequivalent nonstandard squares in a word
    Theoretical Computer Science 648:84-95 (2016)

    Details Publisher version ArXiv Conference version

  • C P. Gawrychowski, T. Kociumaka, W. Rytter, T. Waleń
    Faster Longest Common Extension Queries in Strings over General Alphabets
    CPM 2016:5:1-5:13

    Details Publisher version ArXiv BibTeX Slides

  • J M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, A. Langiu, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń
    Order-preserving indexing
    Theoretical Computer Science 638:122-135 (2016)

    Details Publisher version BibTeX Conference version

  • J M. Cygan, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń
    Polynomial-time approximation algorithms for weighted LCS problem
    Discrete Applied Mathematics 204:38-48 (2016)

    Details Publisher version BibTeX Conference version



2015

  • J G. Fici, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń
    On the greedy algorithm for the Shortest Common Superstring problem with reversals
    Information Processing Letters 116(3):245-251 (2016)

    Details Publisher version ArXiv BibTeX

  • J T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń
    Linear-time version of Holub's algorithm for morphic imprimitivity testing
    Theoretical Computer Science 602:7-21 (2015)

    Details Publisher version BibTeX Conference version

  • C H. Bannai, S. Inenaga, T. Kociumaka, A. Lefebvre, J. Radoszewski, W. Rytter, S. Sugimoto, T. Waleń
    Efficient Algorithms for Longest Closed Factor Array
    SPIRE 2015:95-102

    Details Publisher version BibTeX

  • C P. Gawrychowski, T. Kociumaka, W. Rytter, T. Waleń
    Tight Bound for the Number of Distinct Palindromes in a Tree
    SPIRE 2015:270-276

    Details Publisher version BibTeX

  • J M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, A. Langiu, J. Radoszewski, W. Rytter, B. Szreder, T. Waleń
    A note on the longest common compatible prefix problem for partial words
    Journal of Discrete Algorithms 34:49-53 (2015)

    Details Publisher version ArXiv BibTeX

  • C P. Gawrychowski, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń
    Universal Reconstruction of a String
    WADS 2015:386-397

    Details Publisher version BibTeX

  • J T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń
    Fast Algorithm for Partial Covers in Words
    Algorithmica 73(1):217-233 (2015)

    Details Publisher version ArXiv BibTeX Conference version

  • C T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń
    String Powers in Trees
    CPM 2015:284-294

    Details Publisher version BibTeX Full journal version

  • C T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń
    Internal Pattern Matching Queries in a Text and Applications
    SODA 2015:532-551

    Details Publisher version BibTeX



2014

  • C M. Crochemore, C. S. Iliopoulos, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń
    Covering Problems for Partial Words and for Indeterminate Strings
    ISAAC 2014:220-232

    Details Publisher version ArXiv BibTeX

  • C T. Kociumaka, J. W. Pachocki, J. Radoszewski, W. Rytter, T. Waleń
    On the String Consensus Problem and the Manhattan Sequence Consensus Problem
    SPIRE 2014:244-255

    Details Publisher version ArXiv BibTeX Full journal version

  • C T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń
    Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
    Developments in Language Theory 2014:215-226

    Details Publisher version ArXiv BibTeX Slides Full journal version

  • J M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, K. Stencel, T. Waleń
    New simple efficient algorithms computing powers and runs in strings
    Discrete Applied Mathematics 163:258-267 (2014)

    Details Publisher version BibTeX Conference version

  • J T. Kociumaka, J. Pachocki, J. Radoszewski, W. Rytter, T. Waleń
    Efficient counting of square substrings in a tree
    Theoretical Computer Science 544:60-73 (2014)

    Details Publisher version BibTeX Conference version

  • C T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń
    Efficient Algorithms for Shortest Partial Seeds in Words
    CPM 2014:192-201

    Details Publisher version BibTeX

  • J G. Chojnowski, T. Waleń, J. M. Bujnicki
    RNA Bricks - a database of RNA 3D motifs and their interactions
    Nucleic Acids Research 42(Database-Issue):123-131 (2014)

    Details Publisher version BibTeX

  • J M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń
    Extracting powers and periods in a word from its runs structure
    Theoretical Computer Science 521:29-41 (2014)

    Details Publisher version BibTeX Conference version

  • J T. Waleń, G. Chojnowski, P. Gierski, J. M. Bujnicki
    ClaRNA: a classifier of contacts in RNA 3D structures based on a comparative analysis of various classification schemes
    Nucleic Acids Research (NAR) (2014) (2014) (2014) (2014) (2014)

    Details Publisher version



2013



2012

  • C T. Kociumaka, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń
    A linear time algorithm for seeds computation
    SODA 2012:1095-1112

    Details Publisher version ArXiv BibTeX Slides by TK

  • J M. Crochemore, C. S. Iliopoulos, M. Kubica, M. Sohel Rahman, G. Tischler, T. Waleń
    Improved algorithms for the range next value problem and applications
    Theoretical Computer Science 434:23-34 (2012)

    Details Publisher version BibTeX Conference version

  • J M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń
    The maximal number of cubic runs in a word
    Journal of Computer and System Sciences 78(6):1828-1836 (2012)

    Details Publisher version BibTeX Conference version

  • J M. Crochemore, L. Ilie, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Waleń
    Computing the Longest Previous Factor
    European Journal of Combinatorics 34(1):15-26 (2013)

    Details Publisher version BibTeX Conference version

  • J M. Kubica, J. Radoszewski, W. Rytter, T. Waleń
    On the maximum number of cubic subwords in a word
    European Journal of Combinatorics 34(1):27-37 (2013)

    Details Publisher version BibTeX

  • C T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń
    Efficient Data Structures for the Factor Periodicity Problem
    SPIRE 2012:284-294

    Details Publisher version BibTeX Slides by TK

  • J M. Crochemore, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń
    On the maximal sum of exponents of runs in a string
    Journal of Discrete Algorithms 14:29-36 (2012)

    Details Publisher version ArXiv BibTeX

  • C M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, J. Radoszewski, W. Rytter, W. Tyczyński, T. Waleń
    The Maximum Number of Squares in a Tree
    CPM 2012:27-40

    Details Publisher version PDF BibTeX Slides by TK

  • J M. Crochemore, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Waleń
    Efficient algorithms for three variants of the LPF table
    Journal of Discrete Algorithms 11:51-61 (2012)

    Details Publisher version BibTeX



2011



2010



2009



2008



2007



2006



2004

  • C K. Ciebiera, J. Mincer-Daszkiewicz, T. Waleń
    New Course Registration Module for the University Study-Oriented System
    The 10th International Conference of European University Information Systems, EUNIS 2004

    Details