Alexander S. Kulikov
Alexander S. Kulikov
Steklov Institute of Mathematics at St. Petersburg
Verified email at - Homepage
Cited by
Cited by
SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing
A Bankevich, S Nurk, D Antipov, AA Gurevich, M Dvorkin, AS Kulikov, ...
Journal of computational biology 19 (5), 455-477, 2012
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface
A Roychoudhury, M D'Souza
Finding efficient circuits using SAT-solvers
A Kojevnikov, A Kulikov, G Yaroslavtsev
Theory and Applications of Satisfiability Testing-SAT 2009, 32-44, 2009
A new approach to proving upper bounds for MAX-2-SAT
A Kojevnikov, AS Kulikov
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
On covering graphs by complete bipartite subgraphs
S Jukna, AS Kulikov
Discrete Mathematics 309 (10), 3399-3403, 2009
An Elementary Proof of a 3n− o (n) Lower Bound on the Circuit Complexity of Affine Dispersers
E Demenkov, A Kulikov
Mathematical Foundations of Computer Science 2011, 256-265, 2011
New upper bounds on the Boolean circuit complexity of symmetric functions
E Demenkov, A Kojevnikov, A Kulikov, G Yaroslavtsev
Information Processing Letters 110 (7), 264-267, 2010
A 2^{|E|/4}-Time Algorithm For Max-Cut
SS Fedin, AS Kulikov
Tight bounds for graph homomorphism and subgraph isomorphism
M Cygan, FV Fomin, A Golovnev, AS Kulikov, I Mihajlin, J Pachocki, ...
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
Design and Synthesis of Nitrogen‐Rich Azo‐Bridged Furoxanylazoles as High‐Performance Energetic Materials
AA Larin, AV Shaferov, AS Kulikov, AN Pivkina, KA Monogarov, ...
Chemistry–A European Journal 27 (59), 14628-14637, 2021
Tight lower bounds on graph embedding problems
M Cygan, FV Fomin, A Golovnev, AS Kulikov, I Mihajlin, J Pachocki, ...
Journal of the ACM (JACM) 64 (3), 1-22, 2017
Approximating shortest superstring problem using de bruijn graphs
A Golovnev, AS Kulikov, I Mihajlin
Annual Symposium on Combinatorial Pattern Matching, 120-129, 2013
New bounds for MAX-SAT by clause learning
A Kulikov, K Kutzkov
Computer Science–Theory and Applications, 194-204, 2007
Automated generation of simplification rules for SAT and MAXSAT
A Kulikov
Theory and Applications of Satisfiability Testing, 43-59, 2005
Automated proofs of upper bounds on the running time of splitting algorithms
SS Fedin, AS Kulikov
Parameterized and Exact Computation, 248-259, 2004
Circuit complexity and multiplicative complexity of Boolean functions
A Kojevnikov, A Kulikov
Programs, Proofs, Processes, 239-245, 2010
N-Oxide-controlled chemoselective reduction of nitrofuroxans
LL Fershtat, DM Bystrov, ES Zhilin, NN Makhova
Synthesis 51 (03), 747-756, 2019
Computing majority by constant depth majority circuits with low fan-in gates
AS Kulikov, VV Podolskii
Theory of Computing Systems 63, 956-986, 2019
Parameterized complexity of secluded connectivity problems
FV Fomin, PA Golovach, N Karpov, AS Kulikov
Theory of Computing Systems 61, 795-819, 2017
Regioselective synthesis, structural diversification and cytotoxic activity of (thiazol-4-yl) furoxans
AS Kulikov, MA Epishina, AI Churakov, LV Anikina, LL Fershtat, ...
Mendeleev Communications 28 (6), 623-625, 2018
The system can't perform the operation now. Try again later.
Articles 1–20