Paul Medvedev

Available identifiers

Publication	Date of Publication	Type
Exact sketch-based read mapping	2024-12-09	Paper
Compression algorithm for colored de Bruijn graphs	2024-12-09	Paper
Disk compression of \(k\)-mer sets	2023-02-07	Paper
Representation of \(k\)-mer sets using spectrum-preserving string sets	2022-10-14	Paper
Optimal Omnitig Listing for Safe and Complete Contig Assembly	2020-05-25	Paper
Bipartite graphs of small readability	2020-01-16	Paper
An optimal \(O(nm)\) algorithm for enumerating all walks common to all closed edge-covering walks of a graph	2019-12-02	Paper
\textit{De novo} clustering of long-read transcriptome data using a greedy, quality-value based algorithm	2019-05-21	Paper
The relative worst order ratio applied to seat reservation	2018-11-05	Paper
Bipartite graphs of small readability	2018-10-04	Paper
Safe and complete contig assembly via omnitigs	2016-06-22	Paper
On the readability of overlap digraphs	2016-04-07	Paper
On the Readability of Overlap Digraphs	2015-08-20	Paper
On the plane-width of graphs	2013-10-10	Paper
Complexity of independent set reconfigurability problems	2012-08-08	Paper
The plane-width of graphs	2011-11-15	Paper
Shortest paths between shortest paths	2011-10-10	Paper
Shortest Paths between Shortest Paths and Independent Sets	2011-05-19	Paper
Algorithm Theory - SWAT 2004	2005-09-07	Paper

This page was built for person: Paul Medvedev