Nikolai Karpov
Nikolai Karpov
Verified email at - Homepage
Cited by
Cited by
A multi-labeled tree dissimilarity measure for comparing “clonal trees” of tumor progression
N Karpov, S Malikic, MK Rahman, SC Sahinalp
Algorithms for Molecular Biology 14 (1), 1-18, 2019
Parameterized complexity of secluded connectivity problems
FV Fomin, PA Golovach, N Karpov, AS Kulikov
Theory of Computing Systems 61 (3), 795-819, 2017
An exponential lower bound for cut sparsifiers in planar graphs
N Karpov, M Pilipczuk, A Zych-Pawlewicz
Algorithmica 81 (10), 4029-4042, 2019
Sketching algorithms for genomic data analysis and querying in a secure enclave
C Kockan, K Zhu, N Dokmai, N Karpov, MO Kulekci, DP Woodruff, ...
Nature methods 17 (3), 295-301, 2020
Distributed and streaming linear programming in low dimensions
S Assadi, N Karpov, Q Zhang
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2019
Parameterized algorithms for partitioning graphs into highly connected clusters
I Bliznets, N Karpov
arXiv preprint arXiv:1706.09487, 2017
Collaborative top distribution identifications with limited interaction
N Karpov, Q Zhang, Y Zhou
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
Batched Coarse Ranking in Multi-Armed Bandits.
N Karpov, Q Zhang
NeurIPS, 2020
Leibniz International Proceedings in Informatics (LIPIcs)
N Karpov, S Malikic, MK Rahman, SC Sahinalp
Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit
N Karpov, Q Zhang
arXiv preprint arXiv:2012.01499, 2020
42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
R Impagliazzo, V Kabanets, A Kolokolova, P McKenzie, S Romani, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017
Parameterized complexity of superstring problems
I Bliznets, FV Fomin, PA Golovach, N Karpov, AS Kulikov, S Saurabh
Annual Symposium on Combinatorial Pattern Matching, 89-99, 2015
The system can't perform the operation now. Try again later.
Articles 1–12