Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Tomasz Waleń
2018
- Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, On the string consensus problem and the Manhattan sequence consensus problem, Theoretical Computer Science 710 2018, p. 126–138.see in PBN
- Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient algorithms for shortest partial seeds in words, Theoretical Computer Science 710 2018, p. 139–147.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń and Wiktor Zuba, Faster Recovery of Approximate Periods over Edit Distance, in: String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings, 2018, p. 233–240.see in PBN
- Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Linear-Time Algorithm for Long LCF with k Mismatches, in: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 23, p. 23:1–23:16.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, On Periodicity Lemma for Partial Words, in: Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings, Springer, 2018, p. 232–244.see in PBN
- Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur and Tomasz Waleń, String Periods in the Order-Preserving Model, in: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 38, p. 38:1–38:16.see in PBN
- Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient enumeration of non-equivalent squares in partial words with few holes, Journal Of Combinatorial Optimization 2018.see in PBN
2017
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, String Powers in Trees, Algorithmica 79 (3) 2017, p. 814–834.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Covering problems for partial words and for indeterminate strings, Theoretical Computer Science 698 2017, p. 25–39.see in PBN
- Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes, in: Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings, 2017, p. 99–111.see in PBN
2016
- Marek Adam Cygan, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Polynomial-time approximation algorithms for weighted LCS problem, Discrete Applied Mathematics 204 2016, p. 38–48.see in PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Maximum number of distinct and nonequivalent nonstandard squares in a word, Theoretical Computer Science 648 2016, p. 84–95.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Order-preserving indexing, Theoretical Computer Science 638 2016, p. 122–135.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries, in: String Processing and Information Retrieval - 23rd International Symposium, 2016, p. 22–34.see in PBN
- Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter and Tomasz Waleń, Faster longest common extension queries in strings over general alphabets, in: 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, 2016, r. 5, p. 5:1–5:13.see in PBN
- Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, On the greedy algorithm for the Shortest Common Superstring problem with reversals, Information Processing Letters 116 (3) 2016, p. 245–251.see in PBN
2015
- Grzegorz Chojnowski, Tomasz Waleń, Paweł Piątkowski, Wojciech Marek Potrzebowski and Janusz Bujnicki, Brickworx builds recurrent RNA and DNA structural motifs into medium- and low-resolution electron-density maps, Acta Crystallographica Section D: Biological Crystallography 71 (3) 2015, p. 697–705.see in PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Internal Pattern Matching Queries in a Text and Applications, in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2015, p. 532–551.see in PBN
- Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Fast Algorithm for Partial Covers in Words, Algorithmica 73 (1) 2015, p. 217–233.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Theoretical Computer Science 602 2015, p. 7–21.see in PBN
- Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder and Tomasz Waleń, A note on the longest common compatible prefix problem for partial words, Journal Of Discrete Algorithms 34 2015, p. 49–53.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, String Powers in Trees, in: Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings, Springer, 2015, p. 284–294.see in PBN
- Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Universal Reconstruction of a String, in: Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, Springer, 2015, p. 386–397.see in PBN
- Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto and Tomasz Waleń, Efficient Algorithms for Longest Closed Factor Array, in: String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, Springer, 2015, p. 95–102.see in PBN
- Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter and Tomasz Waleń, Tight Bound for the Number of Distinct Palindromes in a Tree, in: String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, Springer, 2015, p. 270–276.see in PBN
2014
- Grzegorz Chojnowski, Tomasz Waleń and Janusz Bujnicki, RNA Bricks - a database of RNA 3D motifs and their interactions, Nucleic Acids Research 42 (Database-Issue) 2014, p. 123–131.see in PBN
- Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient counting of square substrings in a tree, Theoretical Computer Science 544 2014, p. 60–73.see in PBN
- Tomasz Waleń, Grzegorz Chojnowski, Przemysław Gierski and Janusz Bujnicki, ClaRNA: a classifier of contacts in RNA 3D structures based on a comparative analysis of various classification schemes, Nucleic Acids Research 42 (19) 2014, p. e151.see in PBN
- Tomasz Kociumaka, Solon Pissis, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient Algorithms for Shortest Partial Seeds in Words, Lecture Notes In Computer Science 8486 2014, p. 192–201.see in PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word, Lecture Notes In Computer Science 8633 2014, p. 215–226.see in PBN
- Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Covering Problems for Partial Words and for Indeterminate Strings, Lecture Notes In Computer Science 8889 2014, p. 220––232.see in PBN
- Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, On the String Consensus Problem and the Manhattan Sequence Consensus Problem, Lecture Notes In Computer Science 8799 2014, p. 244–255.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Extracting powers and periods in a word from its runs structure, Theoretical Computer Science 521 (Complete) 2014, p. 29–41.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter, Krzysztof Stencel and Tomasz Waleń, New simple efficient algorithms computing powers and runs in strings, Discrete Applied Mathematics 163 2014, p. 258–267.see in PBN
2013
- Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter and Tomasz Waleń, Computing the Longest Previous Factor, European Journal Of Combinatorics 34 (1) 2013, p. 15–26.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes, Lecture Notes In Computer Science 8214 2013, p. 84–95.see in PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Lecture Notes In Computer Science 7810 2013, p. 383–394.see in PBN
- Tomasz Kociumaka, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Fast Algorithm for Partial Covers in Words, Lecture Notes In Computer Science 7922 2013, p. 177–188.see in PBN
- Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter, Bartosz Szreder and Tomasz Waleń, Efficient seed computation revisited, Theoretical Computer Science 483 (Complete) 2013, p. 171–181.see in PBN
- Marcin Kubica, Tomasz Kulczyński, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, A linear time algorithm for consecutive permutation pattern matching, Information Processing Letters 113 (12) 2013, p. 430–433.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter, Wojciech Tyczyński and Tomasz Waleń, A note on efficient computation of all Abelian periods in a string, Information Processing Letters 113 (3) 2013, p. 74–77.see in PBN
- Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, On the maximum number of cubic subwords in a word, European Journal Of Combinatorics 34 (1) 2013, p. 27–37.see in PBN
2012
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter, Wojciech Tyczyński and Tomasz Waleń, The Maximum Number of Squares in a Tree, in: Computer Vision and Graphics. International Conference, ICCVG 2012, Warsaw, Poland, September 24-26, 2012. Proceedings, Springer, Berlin 2012, r. 7354, p. 27–40.see in PBN
- Maxime Crochemore, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, On the maximal sum of exponents of runs in a string, Journal Of Discrete Algorithms 14 2012, p. 29–36.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, The maximal number of cubic runs in a word, Journal Of Computer And System Sciences 78 (6) 2012, p. 1828–1836.see in PBN
- Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, On the Maximal Number of Cubic Runs in a String, Journal Of Computer And System Sciences 78 (6) 2012, p. 1828–1836.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter and Tomasz Waleń, Efficient algorithms for three variants of the LPF table, Journal Of Discrete Algorithms 11 2012, p. 51–61.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient Data Structures for the Factor Periodicity Problem, in: SPIRE, 2012.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler and Tomasz Waleń, Improved algorithms for the range next value problem and applications, Theoretical Computer Science 434 2012, p. 23–34.see in PBN
- Tomasz Kociumaka, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, A linear time algorithm for seeds computation, in: SODA, 2012, p. 1095–1112.see in PBN
- Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient Counting of Square Substrings in a Tree, in: Lecture Notes in Computer Science, Springer, Heidelberg 2012, r. 7676, p. 207–216.see in PBN
2011
- Grzegorz Jakacki, Marcin Kubica and Tomasz Waleń, Codility. Application of Olympiad-Style Code Assessment to Pre-Hire Screening of Programmers, Olympiads In Informatics 5 2011, p. 32–43.see in PBN
- Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Polynomial-Time Approximation Algorithms for Weighted LCS Problem, Lecture Notes In Computer Science 6661 2011, p. 455–466.see in PBN
- Marcin Kubica, Romeo Rizzi, Stephane Vialette and Tomasz Waleń, Approximation of RNA multiple structural alignment, Journal Of Discrete Algorithms 9 (4) 2011, p. 365–376.see in PBN
- Michałis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder and Tomasz Waleń, Efficient Seeds Computation Revisited, in: CPM, 2011.see in PBN
- Michalis Christou, Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Solon Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder and Tomasz Waleń, Efficient Seeds Computation Revisited, Lecture Notes In Computer Science 6661 2011, p. 350–363.see in PBN
2010
- Maxime Crochemore, Marcin Kubica, Tomasz Waleń, Costas S. Iliopoulos and M. Sohel Rahman, Finding Patterns In Given Intervals, Fundamenta Informaticae 101 (3) 2010, p. 173–186.see in PBN
- Marcin Kubica, Wojciech Rytter, Tomasz Waleń, Krzysztof Stencel, Jakub Radoszewski, Maxime Crochemore and Costas Iliopoulos, New Simple Efficient Algorithms Computing Powers and Runs in Strings, in: PSC, 2010, p. 138–149.see in PBN
- Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, On the Maximal Sum of Exponents of Runs in a String, Lecture Notes In Computer Science 6460 2010, p. 10–19.see in PBN
- Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Algorithms for Three Versions of the Shortest Common Superstring Problem, Lecture Notes In Computer Science 6129 2010, p. 299–309.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter and Tomasz Waleń, Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays, Lecture Notes In Computer Science 5901 2010, p. 296–307.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Extracting Powers and Periods in a String from Its Runs Structure, Lecture Notes In Computer Science 6393 2010, p. 258–269.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, On the Maximal Number of Cubic Runs in a String, Lecture Notes In Computer Science 6031 2010, p. 227–238.see in PBN
- Rok Erman, Łukasz Kowalik, Matjaz Krnc and Tomasz Waleń, Improved induced matchings in sparse graphs, Discrete Applied Mathematics 158 (18) 2010, p. 1994–2003.see in PBN
2009
- Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, On the Maximal Number of Cubic Subwords in a String, Lecture Notes In Computer Science 5874 2009, p. 345–355.see in PBN
- Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter and Tomasz Waleń, LPF Computation Revisited, Lecture Notes In Computer Science 5874 2009, p. 158–169.see in PBN
- Rok Erman, Łukasz Kowalik, Matjaz Krnc and Tomasz Waleń, Improved Induced Matchings in Sparse Graphs, Lecture Notes In Computer Science 5917 2009, p. 134–148.see in PBN
- Marcin Kubica and Tomasz Waleń, Improved Algorithm for Rhythm Recognition in Musical Sequences, in: London Algorithmics 2008: Theory and Practice, College Publications, London 2009.see in PBN
2008
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman and Tomasz Waleń, Improved Algorithms for the Range Next Value Problem and Applications, in: STACS, 2008.see in PBN
2006
- S. Bereg, Marcin Kubica, Tomasz Waleń and B. Zhu, RNA multiple structural alignment with longest common subsequences, Journal Of Combinatorial Optimization 13 (2) 2006, p. 179–188.see in PBN
- Marcin Kubica, R. Rizzi, St, Vialette and Tomasz Waleń, Approximation of RNA Multiple Structural Alignment, Lecture Notes In Computer Science 4009 2006, p. 211–222.see in PBN
- P. Kolman and Tomasz Waleń, Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set, Lecture Notes In Computer Science 4368 2006, p. 281–291.see in PBN
2004
- Krzysztof Ciebiera, Janina Mincer-Daszkiewicz and Tomasz Waleń, New Course Registration Module for the University Study-Oriented System, in: EUNIS 2004, The Tenth International Conference of European University Information Systems, University of Ljubljana, Faculty of Computer and Information, Bled, Slovenia 2004, p. 247–252.see in PBN
- Krzysztof Diks, Krzysztof Onak and Tomasz Waleń (eds.), XI Olimpiada Informatyczna 2003/2004, Komitet Główny Olimpiady Informatycznej, Warszawa 2004.see in PBN
2003
- Krzysztof Ciebiera and Tomasz Waleń, Large scale programming contest system, in: EUNIS 2003, 9th International Conference of European University Information Systems, Universiteit van Amsterdam, Amsterdam, the Netherlands 2003.see in PBN
You are not logged in | log in
