Jakub Radoszewski

EDBT 2026 Demo / reviewers in the wild / expert

dblp:83/7216 · DBLP profile ↗

← Back

21ranked-venue papers in the field

4as first author

4since 2021 · last 2024

0000-0002-0067-6401ORCID · verified

Domains — venue-derived; a paper can count in several

Information Retrieval & Web Search · 16 (3 first)Other / Interdisciplinary · 4Big Data, Cloud & Distributed Data Systems · 1 (1 first)

Year	Publication	Venue	Position
2024	Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	SPIRE	1
2024	Computing String Covers in Sublinear Time Jakub Radoszewski, Wiktor Zuba	SPIRE	1
2022	Subsequence Covers of Words Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba	SPIRE	3
2021	String Covers of a Tree Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba	SPIRE	1
2020	Efficient Enumeration of Distinct Factors Using Package Representations Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba	SPIRE	3
2020	Internal Quasiperiod Queries Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba	SPIRE	3
2019	Weighted Shortest Common Supersequence Problem Revisited Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba	SPIRE	4
2018	Efficient Computation of Sequence Mappability Mai Abdulaziz Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski	SPIRE	6
2018	Faster Recovery of Approximate Periods over Edit Distance Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba	SPIRE	2
2017	Streaming K-Mismatch with Error Correcting and Applications abstract We present a new streaming algorithm for the k-Mismatch problem, one of the most basic problems in pattern matching. Given a pattern and a text, the task is to find all substrings of the text that are at the Hamming distance at most k from the pattern. Our algorithm is enhanced with an important new feature called Error Correcting, and its complexities for k = 1 and for a general k match those of the best known solutions for the k-Mismatch problem from FOCS 2009 and SODA 2016. As a corollary we develop a series of streaming algorithms for pattern matching on weighted strings, which are a commonly used representation of uncertain sequences in molecular biology. Jakub Radoszewski, Tatiana Starikovskaya	DCC	1
2017	Longest Common Factor After One Edit Operation Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski	SPIRE	5
2017	Two strings at Hamming distance 1 cannot be both quasiperiodic Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski	Inf. Process. Lett.	3
2016	Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	SPIRE	6
2016	On the greedy algorithm for the Shortest Common Superstring problem with reversals Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	Inf. Process. Lett.	3
2015	Efficient Algorithms for Longest Closed Factor Array Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen	SPIRE	5
2014	On the String Consensus Problem and the Manhattan Sequence Consensus Problem Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	SPIRE	3
2013	Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica 0001, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	SPIRE	7
2013	A note on efficient computation of all Abelian periods in a string Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica 0001, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen	Inf. Process. Lett.	6
2013	A linear time algorithm for consecutive permutation pattern matching Marcin Kubica 0001, Tomasz Kulczynski, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	Inf. Process. Lett.	3
2012	Efficient Data Structures for the Factor Periodicity Problem Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	SPIRE	2
2010	Extracting Powers and Periods in a String from Its Runs Structure Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica 0001, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	SPIRE	4