Wiktor Zuba

Full Name

Dr. W.P. Zuba

Email

Wiktor.Zuba@cwi.nl

Room

M245

Department(s)

Networks and Optimization

Function(s)

Researcher

Wiktor Zuba

Grossi, R, Iliopoulos, C.S, Jansson, J, Lim, Z, Sung, W.-K, & Zuba, W.P. (2023). Finding the cyclic covers of a string. In International Conference and Workshops on Algorithms and Computation, WALCOM 2023 (pp. 139–150). doi:10.1007/978-3-031-27051-2_13
Charalampopoulos, P, Pissis, S, Radoszewski, J, Rytter, W, Waleń, T, & Zuba, W.P. (2022). Subsequence covers of words. In Proceedings of the International Symposium on String Processing and Information Retrieval (pp. 3–15). doi:10.1007/978-3-031-20643-6_1
Bernardini, G, Gabory, E.A.D, Pissis, S, Stougie, L, Sweering, M.J.M, & Zuba, W.P. (2022). Elastic-degenerate string matching with 1 error. In LATIN: Latin American Symposium on Theoretical Informatics (pp. 20–37). doi:10.1007/978-3-031-20624-5_2
Charalampopoulos, P, Kociumaka, T, Radoszewski, J, Pissis, S, Rytter, W, Waleń, T, & Zuba, W.P. (2022). Approximate circular pattern matching. In Annual European Symposium on Algorithms (pp. 35:1–35:19). doi:10.4230/LIPIcs.ESA.2022.35
Crochemore, M, Iliopoulos, C.S, Radoszewski, J, Rytter, W, Straszyński, J, Waleń, T, & Zuba, W.P. (2022). Linear-time computation of shortest covers of all rotations of a string. In 33rd Annual Symposium on Combinatorial Pattern Matching (pp. 22:1–22:15). doi:10.4230/LIPIcs.CPM.2022.22
Radoszewski, J, Rytter, W, Straszyński, J, Waleń, T, & Zuba, W.P. (2022). Rectangular tile covers of 2D-strings. In Annual Symposium on Combinatorial Pattern Matching (pp. 23:1–23:14). doi:10.4230/LIPIcs.CPM.2022.23
Charalampopoulos, P, Kociumaka, T, Pissis, S, Radoszewski, J, Rytter, W, Straszyński, J, … Zuba, W.P. (2021). Circular pattern matching with k mismatches. Journal of Computer and System Sciences, 115, 73–85. doi:10.1016/j.jcss.2020.07.003
Charalampopoulos, P, Pissis, S, Radoszewski, J, Waleń, T, & Zuba, W.P. (2020). Unary Words Have the Smallest Levenshtein k-Neighbourhoods. In 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020 (pp. 10:1–10:12). doi:10.4230/LIPIcs.CPM.2020.10
Charalampopoulos, P, Kociumaka, T, Pissis, S, Radoszewski, J, Rytter, W, Straszyński, J, … Zuba, W.P. (2019). Weighted Shortest Common Supersequence problem revisited. In Proceedings of the International Symposium on String Processing and Information Retrieval (pp. 221–238). doi:10.1007/978-3-030-32686-9_16
Charalampopoulos, P, Kociumaka, T, Pissis, S, Radoszewski, J, Rytter, W, Straszyński, J, … Zuba, W.P. (2019). Circular pattern matching with k mismatches. In Proceedings of Fundamentals of Computation Theory (pp. 213–228). doi:10.1007/978-3-030-25027-0_15

Best Paper Award of SPIRE 2022 (2022)

Networks COFUND postdocs (Networks COFUND postdocs)