A Note on the Use of Independent Sets for the k-SAT Problem. - Konstantin Kutzkov (J. Satisf. Boolean Model. Comput., 2006)

New Bounds for MAX-SAT by Clause Learning. - Alexander S. Kulikov; Konstantin Kutzkov (CSR, 2007)

New upper bound for the #3-SAT problem. - Konstantin Kutzkov (Inf. Process. Lett., 2007)

Using CSP To Improve Deterministic 3-SAT - Konstantin Kutzkov; Dominik Scheder (CoRR, 2010)

Frequent Pairs in Data Streams: Exploiting Parallelism and Skew. - Andrea Campagna; Konstantin Kutzkov; Rasmus Pagh (ICDM Workshops, 2011)

Improved Counter Based Algorithms for Frequent Pairs Mining in Transactional Data Streams. - Konstantin Kutzkov (ECML/PKDD (1), 2012)

An exact exponential time algorithm for counting bipartite cliques. - Konstantin Kutzkov (Inf. Process. Lett., 2012)

On parallelizing matrix multiplication by the column-row method. - Andrea Campagna; Konstantin Kutzkov; Rasmus Pagh (ALENEX, 2013)

STRIP: stream learning of influence probabilities. - Konstantin Kutzkov; Albert Bifet; Francesco Bonchi; Aristides Gionis (KDD, 2013)

Deterministic algorithms for skewed matrix products. - Konstantin Kutzkov (STACS, 2013)

On the streaming complexity of computing local clustering coefficients. - Konstantin Kutzkov; Rasmus Pagh (WSDM, 2013)

Local correlation clustering. - Francesco Bonchi; David García-Soriano; Konstantin Kutzkov (CoRR, 2013)

Triangle counting in streamed graphs via small vertex covers. - David García-Soriano; Konstantin Kutzkov (SDM, 2014)

Consistent Subset Sampling. - Konstantin Kutzkov; Rasmus Pagh (SWAT, 2014)

Triangle Counting in Dynamic Graph Streams. - Konstantin Kutzkov; Rasmus Pagh (SWAT, 2014)

New exact algorithms for the 2-constraint satisfaction problem. - Alexander Golovnev; Konstantin Kutzkov (Theor. Comput. Sci., 2014)

Weighted Similarity Estimation in Data Streams. - Konstantin Kutzkov; Mohamed Ahmed 001; Sofia Nikitaki (CIKM, 2015)

Learning Convolutional Neural Networks for Graphs. - Mathias Niepert; Mohamed Ahmed 001; Konstantin Kutzkov (ICML, 2016)

Efficient Distributed Decision Trees for Robust Regression. - Tian Guo 002; Konstantin Kutzkov; Mohamed Ahmed 001; Jean-Paul Calbimonte; Karl Aberer (ECML/PKDD (2), 2016)

Triangle Counting in Dynamic Graph Streams. - Laurent Bulteau; Vincent Froese; Konstantin Kutzkov; Rasmus Pagh (Algorithmica, 2016)

KONG: Kernels for ordered-neighborhood graphs. - Moez Draief; Konstantin Kutzkov; Kevin Scaman; Milan Vojnovic (NeurIPS, 2018)

Query-Efficient Correlation Clustering. - David García-Soriano; Konstantin Kutzkov; Francesco Bonchi; Charalampos E. Tsourakakis (WWW, 2020)

COLOGNE: Coordinated Local Graph Neighborhood Sampling. - Konstantin Kutzkov (CoRR, 2021)

LoNe Sampler: Graph Node Embeddings by Coordinated Local Neighborhood Sampling. - Konstantin Kutzkov (AAAI, 2023)

Enhancing Logistic Regression Using Neural Networks for Classification in Actuarial Learning. - George Tzougas; Konstantin Kutzkov (Algorithms, 2023)

Learning Graph Node Embeddings by Smooth Pair Sampling. - Konstantin Kutzkov (AISTATS, 2025)