Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Wale{\'n}, Tomasz"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Covering problems for partial words and for indeterminate strings
Maxime Crochemore
,
Costas S. Iliopoulos
,
Tomasz Kociumaka
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Waleń
Lecture Notes in Computer Science
8889
, 2014, pp. 220-232
Efficient counting of square substrings in a tree
Tomasz Kociumaka
,
Jakub Pachocki
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Waleń
Theoretical Computer Science
544
, 2014, pp. 60-73
Efficient algorithms for shortest partial seeds in words
Tomasz Kociumaka
,
Solon P. Pissis
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Waleń
Lecture Notes in Computer Science
8486
, 2014, pp. 192-201
Fast algorithm for partial covers in words
Tomasz Kociumaka
,
Solon P. Pissis
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Waleń
Lecture Notes in Computer Science
7922
, 2013, pp. 177-188
The maximum number of squares in a tree
Maxime Crochemore
,
Costas S. Iliopoulos
,
Tomasz Kociumaka
,
Marcin Kubica
,
Jakub Radoszewski
,
Wojciech Rytter
,
Wojciech Tyczyński
,
Tomasz Waleń
Lecture Notes in Computer Science
7354
, 2012, pp. 27-40
Improved algorithms for the range next value problem and applications
Maxime Crochemore
,
Costas S. Iliopoulos
,
Marcin Kubica
,
M. Sohel Rahman
,
German Tischler
,
Tomasz Waleń
Theoretical Computer Science
434
, 2012, pp. 23-34
Efficient counting of square substrings in a tree
Tomasz Kociumaka
,
Jakub Pachocki
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Waleń
Lecture Notes in Computer Science
7676
, 2012, pp. 207-216
Efficient seeds computation revisited
Michalis Christou
,
Maxime Crochemore
,
Costas S. Iliopoulos
,
Marcin Kubica
,
Solon P. Pissis
,
Jakub Radoszewski
,
Wojciech Rytter
,
Bartosz Szreder
,
Tomasz Waleń
Lecture Notes in Computer Science
6661
, 2011, pp. 350-363
Polynomial-time approximation algorithms for weighted LCS problem
Marek Cygan
,
Marcin Kubica
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Waleń
Lecture Notes in Computer Science
6661
, 2011, pp. 455-466
Algorithms for three versions of the shortest common superstring problem
Maxime Crochemore
,
Marek Cygan
,
Costas Iliopoulos
,
Marcin Kubica
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Waleń
Lecture Notes in Computer Science
6129
, 2010, pp. 299-309
Improved algorithms for the range next value problem and applications
Maxime Crochemore
,
Costas S. Iliopoulos
,
Marcin Kubica
,
Mohammad Sohel Rahman
,
Tomasz Waleń
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 205-216
Algorithms for computing the longest parameterized common subsequence
Costas S. Iliopoulos
,
Marcin Kubica
,
M. Sohel Rahman
,
Tomasz Waleń
Lecture Notes in Computer Science
4580
, 2007, pp. 265-273
Approximation of RNA multiple structural alignment
Marcin Kubica
,
Romeo Rizzi
,
Stéphane Vialette
,
Tomasz Waleń
Lecture Notes in Computer Science
4009
, 2006, pp. 211-222