| ||
1. | Efficient algorithms for three variants of the LPF table
JOURNAL OF DISCRETE ALGORITHMS Tom 11 r. 2012, str. 51-61 (Artyku³) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleñ | |
2. | Improved algorithms for the range next value problem and applications
THEORETICAL COMPUTER SCIENCE Tom 434 r. 2012, str. 23-34 (Artyku³) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler, Tomasz Waleñ | |
3. | On the maximal sum of exponents of runs in a string
JOURNAL OF DISCRETE ALGORITHMS Tom 14 r. 2012, str. 29-36 (Artyku³) Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleñ | |
4. | The maximal number of cubic runs in a word
JOURNAL OF COMPUTER AND SYSTEM SCIENCES Tom 78 Nr 6 r. 2012, str. 1828-1836 (Artyku³) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleñ | |
5. | Approximation of RNA multiple structural alignment
JOURNAL OF DISCRETE ALGORITHMS Tom 9 Nr 4 r. 2011, str. 365-376 (Artyku³) Marcin Kubica, Romeo Rizzi, Stephane Vialette, Tomasz Waleñ | |
6. | Efficient Seeds Computation Revisited
LECTURE NOTES IN COMPUTER SCIENCE Tom 6661 r. 2011, str. 350-363 (Artyku³ konferencyjny) Michalis Christou, Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Solon Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Waleñ | |
7. | Polynomial-Time Approximation Algorithms for Weighted LCS Problem
LECTURE NOTES IN COMPUTER SCIENCE Tom 6661 r. 2011, str. 455-466 (Artyku³ konferencyjny) Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleñ | |
8. | Algorithms for Three Versions of the Shortest Common Superstring Problem
LECTURE NOTES IN COMPUTER SCIENCE Tom 6129 r. 2010, str. 299-309 (Artyku³) Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleñ | |
9. | Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
LECTURE NOTES IN COMPUTER SCIENCE Tom 5901 r. 2010, str. 296-307 (Artyku³) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleñ | |
10. | Extracting Powers and Periods in a String from Its Runs Structure
LECTURE NOTES IN COMPUTER SCIENCE Tom 6393 r. 2010, str. 258-269 (Artyku³) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleñ | |
11. | Finding Patterns In Given Intervals
FUNDAMENTA INFORMATICAE Tom 101 Nr 3 r. 2010, str. 173-186 (Artyku³) Maxime Crochemore, Marcin Kubica, Tomasz Waleñ, Costas S. Iliopoulos, M. Sohel Rahman | |
12. | Improved induced matchings in sparse graphs
DISCRETE APPLIED MATHEMATICS Tom 158 Nr 18 r. 2010, str. 1994-2003 (Artyku³) Rok Erman, £ukasz Kowalik, Matjaz Krnc, Tomasz Waleñ | |
13. | On the Maximal Number of Cubic Runs in a String
LECTURE NOTES IN COMPUTER SCIENCE Tom 6031 r. 2010, str. 227-238 (Artyku³) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleñ | |
14. | On the Maximal Sum of Exponents of Runs in a String
LECTURE NOTES IN COMPUTER SCIENCE Tom 6460 r. 2010, str. 10-19 (Artyku³ konferencyjny) Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleñ | |
15. | Improved Induced Matchings in Sparse Graphs
LECTURE NOTES IN COMPUTER SCIENCE Tom 5917 r. 2009, str. 134-148 (Artyku³) Rok Erman, £ukasz Kowalik, Matjaz Krnc, Tomasz Waleñ | |
16. | LPF Computation Revisited
LECTURE NOTES IN COMPUTER SCIENCE Tom 5874 r. 2009, str. 158-169 (Artyku³) Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleñ | |
17. | On the Maximal Number of Cubic Subwords in a String
LECTURE NOTES IN COMPUTER SCIENCE Tom 5874 r. 2009, str. 345-355 (Artyku³) Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleñ | |
18. | Algorithms for Computing the Longest Parameterized Common Subsequence
LECTURE NOTES IN COMPUTER SCIENCE Tom 4580 r. 2007, str. 265-273 (Artyku³ konferencyjny) C. Iliopoulos, Marcin Kubica, M. Rahman, Tomasz Waleñ | |
19. | Approximation of RNA Multiple Structural Alignment
LECTURE NOTES IN COMPUTER SCIENCE Tom 4009 r. 2006, str. 211-222 (Artyku³ konferencyjny) Marcin Kubica, R. Rizzi, St, Vialette, Tomasz Waleñ | |
20. | Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
LECTURE NOTES IN COMPUTER SCIENCE Tom 4368 r. 2006, str. 281-291 (Artyku³ konferencyjny) P. Kolman, Tomasz Waleñ | |
21. | RNA multiple structural alignment with longest common subsequences
JOURNAL OF COMBINATORIAL OPTIMIZATION Tom 13 Nr 2 r. 2006, str. 179-188 (Artyku³) S. Bereg, Marcin Kubica, Tomasz Waleñ, B. Zhu | |
22. | Postman
THE 7TH BALTIC OLYMPIAD IN INFORMATICS, BOI 2001 r. 2001, str. 23-26 (Artyku³) V. Leppanen, Tomasz Waleñ | |
23. | Mars maps
THE 7TH BALTIC OLYMPIAD IN INFORMATICS, BOI 2001 r. 2001, str. 31-36 (Artyku³) W. Pohl, Tomasz Waleñ | |
| ||
24. | XI Olimpiada Informatyczna 2003/2004
[ LINK ]
Komitet G³ówny Olimpiady Informatycznej, r. 2004 (Ksi±¿ka) Krzysztof Diks (Redaktor), Krzysztof Onak (Redaktor), Tomasz Waleñ (Redaktor) | |
25. | IX Olimpiada Informatyczna 2001/2002
Komitet G³ówny Olimpiady Informatycznej, r. 2002 (Ksi±¿ka) Zbigniew Czech, Piotr Chrz±stowski-Wachtel, Krzysztof Diks, Wojciech Guzicki, Przemys³awa Kanarek, Marcin Kubica, Marcin Mucha, Krzysztof Onak, Marcin Sawicki, Jakub Pawlewicz, Marcin Stefaniak, Krzysztof Stencel, Tomasz Waleñ, Pawe³ Wolff |