Affiliation

Teaching (in Polish)

• Wstęp do programowania, potok funkcyjny (WPF)
• Programowanie funkcyjne (PF)

Selected Publications

Scientific

• M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, A. Langiu, S. Pissis, J. Radoszewski, W. Rytter, T. Waleń, Order-Preserving Indexing, in: Theoretical Computer Science, vol. 638, pp. 122-135, Elsevier, 2016, DOI: 10.1016/j.tcs.2015.06.050.
• G. Badkobeh, M. Crochemore, C. S. Iliopoulos, M. Kubica, Text redundancies, chapter in: V. Berthé, M. Rigo, Combinatorics, Words and Symbolic Dynamics, Cambridge University Press, 2016, ISBN 9781107077027.
• 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, in: Journal of Discrete Algorithms, vol. 34, pp. 49-53, Elsevier 2015, DOI: 10.1016/j.jda.2015.05.003.
• M. Cygan, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń, Polynomial-Time Approximation Algorithms for Weighted LCS Problem in: 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, R. Giancarlo, G. Manzini (Eds.), Discrete Applied Mathematics, vol. 204, pp. 38-48, Elsevier 2015, DOI: 10.1016/j.dam.2015.11.011.
• M. Crochemore, C.S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń Extracting powers and periods in a word from its runs structure, in: Theoretical Computer Science, vol. 521, pp. 29–41, Elsevier 2014, DOI: 10.1016/j.tcs.2013.11.018.
• M. Crochemore, M. Cygan, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, K. Stencel, T.Waleń, New Simple Efficient Algorithms Computing Powers and Runs in Strings, in: Discrete Applied Mathematics, vol. 163(3), pp. 258–267, Elsevier 2014, DOI: 10.1016/j.dam.2013.05.009,
• M. Christou, M. Crochemore, C. S. Iliopoulos, M. Kubica, S. Pissis, J. Radoszewski, W. Rytter, B. Szreder, T. Waleń, Efficient Seeds Computation Revisited, in: Theoretical Computer Science, vol. 483, pp. 171–181, Elsevier 2013, DOI: 10.1016/j.tcs.2011.12.078.
• M. Kubica, T. Kulczyński, J. Radoszewski, W. Rytter, T. Waleń, A Linear Time Algorithm for Consecutive Permutation Pattern Matching, in: Information Processing Letters, vol. 113 (12), pp. 430-433, Elsevier 2013, .
• M. Crochemore, C.S. Iliopoulos, T. Kociumaka, M. Kubica, J. Pachocki, J. Radoszewski, W. Rytter, W. Tyczyński, T. Waleń, A Note on Efficient Computation of All Abelian Periods in a String, in: Information Processing Letters, vol. 113 (3), pp. 74-77, Elsevier 2013, DOI: 10.1016/j.ipl.2012.11.001.
• M. Crochemore, L. Ilie, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Waleń, Computing the Longest Previous Factor, in: European Journal of Combinatorics, vol. 34 (1), pp. 15-26, Elsevier 2013, DOI: 10.1016/j.ejc.2012.07.011.
• M. Kubica, J. Radoszewski, W. Rytter, T. Waleń, On the Maximum Number of Cubic Subwords in a Word, in: European Journal of Combinatorics, vol. 34 (1), pp. 27–37, Elsevier 2013, DOI: 10.1016/j.ejc.2012.07.012.
• M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, J. Radoszewski, W. Rytter, W. Tyczyński and T. Waleń, The Maximum Number of Squares in a Tree, in: 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, Juha Kärkkäinen, Jens Stoye (Eds.), LNCS 7354, pp. 27-40, DOI: 10.1007/978-3-642-31265-6_3, BibTeX.
• M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń, On the Maximal Number of Cubic Runs in a Word, in: Journal of Computer and System Sciences, vol. 78(6), pp. 1828–1836, Elsevier 2012, DOI: 10.1016/j.jcss.2011.12.005.
• T. Kociumaka, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń, A linear time algorithm for seeds computation, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 1095-1112, PDF, BibTeX.
• M. Crochemore, C. S. Iliopoulos, M. Kubica, M. S. Rahman, T. Waleń, Improved Algorithms for the Range Next Value Problem and Applications, in: Theoretical Computer Science, vol. 434, pp. 23-34, Elsevier 2012, DOI: 10.1016/j.tcs.2012.02.015.
• M. Crochemore, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń, On the Maximal Sum of Exponents of Runs in a String, in: Journal of Discrete Algorithms, vol. 14, pp. 29-36, Elsevier 2012, DOI: 10.1016/j.jda.2011.12.016.
• M. Crochemore, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Waleń, Efficient algorithms for three variants of the LPF table, in: Journal of Discrete Algorithms, vol. 11, pp. 51–61, Elsevier 2012, DOI: 10.1016/j.jda.2011.02.002, BibTeX.
• M. Cygan, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń, Polynomial-Time Approximation Algorithms for Weighted LCS Problem in: 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, R. Giancarlo, G. Manzini (Eds.), LNCS 6661, pp. 455-466, DOI: 10.1007/978-3-642-21458-5_38, BibTeX.
• M. Christou, M. Crochemore, C. S. Iliopoulos, M. Kubica, S. Pissis, J. Radoszewski, W. Rytter, B. Szreder, T. Waleń, Efficient Seeds Computation Revisited, in: 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, R. Giancarlo, G. Manzini (Eds.), LNCS 6661, pp. 350-363, DOI: 10.1007/978-3-642-21458-5_30, BibTeX.
• M. Kubica, R. Rizzi, St. Vialette, T. Waleń, Approximation of RNA Multiple Structural Alignment, in: Journal of Discrete Algorithms, vol. 9(4), pp. 365–376, Elsevier 2011, DOI: 10.1016/j.jda.2010.03.002, BibTeX.
• M. Crochemore, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń, On the Maximal Sum of Exponents of Runs in a String, in: Combinatorial Algorithms -- 21st International Workshop, IWOCA 2010, C. S. Iliopoulos, W. F. Smyth (Eds.), LNCS 6460, pp. 10-19, Springer, 2011, DOI: 10.1007/978-3-642-19222-7, BibTeX.
• G. Jakacki, M. Kubica, T. Waleń, Codility. Application of Olympiad-Style Code Assessment to Pre-Hire Screening of Programmers, in: Olympiads in Informatics, vol. 5, 2011, pp. 32-43, PDF.
• M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Walen, Extracting Powers and Periods in a String from its Runs Structure, in: String Processing and Information Retrieval Symposium, SPIRE 2010, E. Chavez, St. Lonardi (Eds.), LNCS 6393, pp. 258-269, Springer-Verlag, 2010, DOI: 10.1007/978-3-642-16321-0_27, BibTeX.
• M. Crochemore, M. Cygan, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, K. Stencel, T.Waleń, New Simple Efficient Algorithms Computing Powers and Runs in Strings, in: Prague Stringology Conference, PSC 2010, J. Holub and J. Žďárek (Eds.), Proceedings of PSC 2010, ISBN 978-80-01-04597-8, pp. 138-149, Czech Technical University in Prague, 2010, BibTeX, PDF.
• M. Crochemore, M. Cygan, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T.Waleń, Algorithms for Three Versions of the Shortest Common Superstring Problem, in: 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, A. Amir and L. Parida (Eds.), LNCS 6129, pp. 299-309, Springer-Verlag, 2010, DOI: 10.1007/978-3-642-13509-5_27, BibTeX.
• M. Crochemore, C. S. Iliopoulos, M. Kubica, M. S. Rahman, T. Waleń, Finding Patterns in Given Intervals, in: Fundamenta Informaticae, vol. 101 (3), 2010, pp. 173-186, BibTeX.
• M. Kubica, J. Radoszewski, Algorithms without Programming, in: Olympiads in Informatics, vol. 4, 2010, pp. 52-66, PDF, BibTeX.
• M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń, On the Maximal Number of Cubic Runs in a String, in: 4th International Conference on Language and Automata Theory and Applications, LATA 2010, A. H. Dediu, H. Fernau, C. Martin-Vide (Eds.), LNCS 6031, pp. 227-238, Springer-Verlag, 2010, DOI: 10.1007/978-3-642-13089-2_19, BibTeX.
• M. Crochemore, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Waleń, Efficient algorithms for two extensions of LPF table: the power of suffix arrays, in: 36th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2010, J. van Leeuwen, A. Muscholl, D. Peleg, J. Pokorný, B. Rumpe (Eds.), LNCS 5901, pp. 296-307, Springer-Verlag, 2010, DOI: 10.1007/978-3-642-11266-9_25, BibTeX.
• T. Poranen, V. Dagiene, A. Eldhuset, H. Hyyro, M. Kubica, A. Laaksonen, M. Opmanis, W. Pohl, J. Skupiene, P Soderhjelm, A. Truu, Baltic Olympiads in Informatics: Challenges for Training Together, in: Olympiads in Informatics, vol. 3, 2009, pp. 112-131, PDF, BibTeX.
• M. Crochemore, L. Ilie, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Waleń, LPF computation revisited, in: 20th International Workshop on Combinatorial Algorithms, IWOCA 2009, J. Fiala, J. Kratochvíl and M. Miller (Eds.), LNCS 5874, pp. 158-169, Springer-Verlag, 2009, DOI: 10.1007/978-3-642-10217-2_18, BibTeX.
• M. Kubica, J. Radoszewski, W. Rytter, T. Waleń, On the Maximal Number of Cubic Subwords in a String, in: 20th International Workshop on Combinatorial Algorithms, IWOCA 2009, J. Fiala, J. Kratochvíl and M. Miller (Eds.), LNCS 5874, pp. 345-355, Springer-Verlag, 2009, DOI: 10.1007/978-3-642-10217-2_34, BibTeX.
• M. Kubica, T. Waleń, Improved Algorithm for Rhythm Recognition in Musical Sequences, in: London Algorithmics 2008: Theory and Practice, J. Chan, J. W. Daykin and M. S. Rahman (Eds.), Texts in Algorithmics, vol. 11, College Publications, 2009, BibTeX.
• K. Diks, M. Kubica, J. Radoszewski, K. Stencel, A Proposal for a Task Preparation Process, in: Olympiads in Informatics, vol. 2, 2008, pp. 64-74, PDF, BibTeX.
• M. Crochemore, C. S. Iliopoulos, M. Kubica, M. S. Rahman, T. Waleń, Improved Algorithms for the Range Next Value Problem and Applications, in: 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008, S. Albers, P. Weil (Eds.), IBFI, Schloss Dagstuhl, Germany, 2008, pp. 205-216, BibTeX, PDF.
• K. Diks, M. Kubica, K. Stencel, Polish Olympiad in Informatics - 14 Years of Experience, in: Olympiads in Informatics, vol. 1, 2007, pp. 50-56, BibTeX, PDF.
• C. S. Iliopoulos, M. Kubica, M. S. Rahman, T. Waleń, Algorithms for Computing the Longest Parameterized Common Subsequence, in: Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, B. Ma and K. Zhang (Eds.), LNCS 4580, pp. 265-273, Springer-Verlag, 2007, DOI: 10.1007/978-3-540-73437-6_27, BibTeX, PDF.
• S. Bereg, M. Kubica, T. Waleń, B. Zhu, RNA multiple structural alignment with longest common subsequences, in: Journal of Combinatorial Optimization, vol. 13(2), pp. 179-188, Springer-Verlag, 2007, BibTeX.
• M. Kubica, R. Rizzi, St. Vialette, T. Waleń, Approximation of RNA Multiple Structural Alignment, in: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, M. Lewenstein, G. Valiente (Eds.), LNCS 4009, pp. 211-222, Springer-Verlag, 2006, DOI: 10.1007/11780441_20, BibTeX, PDF, PS.
• M. Kubica, A Temporal Approach to Specification of Pointer Data-Structures, in: Fundamental Approaches to Software Engineering, FASE'2003, M. Pezze (Ed.), LNCS 2621, pp. 231-245, Springer-Verlag, 2003, DOI: 10.1007/3-540-36578-8_17, BibTeX, PDF, PS.
• A. Bałaban, M. Kubica, Specification and verification of programs operating on pointer data-structures, KKIO'2001, (in Polish), ISBN 83-914678-4-8, BibTeX, PDF, PS.
• M. Kubica, Formal Specifications of Pointer Data-Structures, Warsaw University, Department of Mathematics, Informatics and Mechanics, PhD. thesis (in Polish), Warszawa 2000, BibTeX, PDF, PS.
• M. Iglewski, M. Kubica, J. Madey, J. Mincer-Daszkiewicz, K. Stencel, TAM'97: the Trace Assertion Method of Module Interface Specification. Reference Manual, Technical Report TR 97-01 (238), Institute of Informatics, Warsaw University, Warszawa 1997, BibTeX, PDF, PS.
• M. Iglewski, M. Kubica, J. Madey, Trace Specifications of Non-deterministic Multi-object Modules, in: Algorithms, Concurrency and Knowledge, K. Kanchacasut, J-J. Levy (Eds.), LNCS 1023, pp. 381-395, Springer-Verlag, 1995, DOI: 10.1007/3-540-60688-2_57, BibTeX, PDF, PS.
• M. Iglewski, M. Kubica, J. Madey, Editor for the Trace Assertion Method, in: Proceedings of the 10th ISPE/IFAC International Conference on CAD/CAM, Robotics and Factories of the Future, CARs & FOF'94, M. Zaremba (Ed.), OCRI, Ottawa, Canada, 1994, ISBN 1-895634-06-7, pp. 876-881, BibTeX, PDF, PS.
• M. Engel, M. Kubica, J. Madey, D. L. Parnas, A. P. Ravn, A. J. van Schouwen, A Formal Approach to Computer Systems Requirements Documentation, in: Hybrid Systems, R.L. Grossman, A. Nerode, A.P. Ravn, H. Rischel (Eds), LNCS 736, pp. 452-474, Springer-Verlag, 1993, DOI: 10.1007/3-540-57318-6_40, BibTeX, PDF, PS.

Educational (mainly in Polish)

• Looking for a Challenge? The Ultimate Problem Set from the University of Warsaw Programming Competitions, Warsaw 2012, (co-author).
• XVI Olimpiada Informatyczna 2008/2009, Warszawa 2009, (co-author).
• XV Olimpiada Informatyczna 2007/2008, Warszawa 2008, (co-author).
• Baltic Olympiad in Informatics, BOI'2008, Tasks and Solutions, Marcin Kubica, Jakub Łącki, Jakub Radoszewski (Eds.), Warszawa 2008, PDF.
• XIV Olimpiada Informatyczna 2006/2007, Warszawa 2007, (co-author).
• XIII Olimpiada Informatyczna 2005/2006, Warszawa 2006, (co-author).
• XII Olimpiada Informatyczna 2004/2005, Warszawa 2005, (co-author).
• The 17th International Olympiad in Informatics, IOI 2005, Tasks and Solutions, Marcin Kubica (Ed.), Nowy Sącz 2005, PDF, PS.
• XI Olimpiada Informatyczna 2003/2004, Warszawa 2004, (co-author).
• The 11th Central European Olympiad in Informatics, CEOI 2004, Tasks and Solutions, Marcin Kubica (Ed.), Warszawa 2004, PDF, PS.
• X Olimpiada Informatyczna 2002/2003, Warszawa 2003, (co-author).
• H. Abelson, G. J. Sussman, Structure and Interpretation of Computer Programs / Struktura i interpretacja programów komputerowych, translation to Polish by Marcin Kubica, WNT, Warszawa 2002.
• IX Olimpiada Informatyczna 2001/2002, Warszawa 2002, (co-author).
• VIII Olimpiada Informatyczna 2000/2001, Warszawa 2001, (co-author).
• The 7th Baltic Olympiad in Informatics, BOI 2001, Tasks and Solutions, Marcin Kubica (Ed.), Warszawa 2001, PDF, PS.
• VII Olimpiada Informatyczna 1999/2000, Warszawa 2000, (co-author).
• VI Olimpiada Informatyczna 1998/1999, Warszawa 1999, (co-author).
• V Olimpiada Informatyczna 1997/1998, Warszawa 1998, (co-author).
• IV Olimpiada Informatyczna 1996/1997, Warszawa 1997, (co-author).
• III Olimpiada Informatyczna 1995/1996, Warszawa 1996, (co-author).
• II Olimpiada Informatyczna 1994/1995, Warszawa 1995, (co-author).

Other activities

Current

• Polish Olympiad in Informatics / Olimpiada Informatyczna, Main Committee member.

Former

• Polish Olympiad in Informatics / Olimpiada Informatyczna, scientific secretary in years 1999 - 2013.
• Olympiads in Informatics, Editorial Board member in years 2009 - 2013.
• International Workshop on Combinatorial Algorithms, IWOCA 2010, 2011, 2012, 2013
  Program Committee member.
• 18th International Symposium on String Processing and Information Retrieval, SPIRE 2011,
  Program Committee member.
• International Olympiad in Informatics (IOI),
  International Scientific Committee (ISC)
  member for terms September 2003 - August 2006 and September 2007 - August 2010.
• Baltic Olympiad in Informatics 2008, Gdynia, Poland,
  Chair of the Scientific Committee.
  Booklet: PDF.
• International Olympiad in Informatics (IOI) 2005, Nowy Sącz, Poland.
  Chair of the Scientific Committee.
  Booklet: PDF, PS.
• Central European Olympiad in Informatics (CEOI) 2004, Rzeszów, Poland.
  Chair of the Scientific Committee.
  Booklet: PDF, PS.
• The European Joint Conferences on Theory and Practice of Software (ETAPS) 2003, Warszawa, Poland.
  Member of the Organizing Committee.
• III Krajowa Konferencja Inżynierii Oprogramowania (KKIO) 2001, Otwock, Poland.
  Member of the Programme Committee and Organizing Committee.
• Baltic Olympiad in Informatics 2001, Sopot, Poland.
  Chair of the Scientific Committee.
  Booklet: PDF, PS.