| 2025 | AISTATS | Learning Graph Node Embeddings by Smooth Pair Sampling. | Konstantin Kutzkov |
| 2023 | AAAI | LoNe Sampler: Graph Node Embeddings by Coordinated Local Neighborhood Sampling. | Konstantin Kutzkov |
| 2020 | WWW | Query-Efficient Correlation Clustering. | David Garca-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis |
| 2016 | ICML | Learning Convolutional Neural Networks for Graphs. | Mathias Niepert, Mohamed Ahmed, Konstantin Kutzkov |
| 2015 | CIKM | Weighted Similarity Estimation in Data Streams. | Konstantin Kutzkov, Mohamed Ahmed, Sofia Nikitaki |
| 2014 | SDM | Triangle counting in streamed graphs via small vertex covers. | David Garca-Soriano, Konstantin Kutzkov |
| 2013 | ALENEX | On parallelizing matrix multiplication by the column-row method. | Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh |
| 2013 | KDD | STRIP: stream learning of influence probabilities. | Konstantin Kutzkov, Albert Bifet, Francesco Bonchi, Aristides Gionis |
| 2013 | STACS | Deterministic algorithms for skewed matrix products. | Konstantin Kutzkov |
| 2013 | WSDM | On the streaming complexity of computing local clustering coefficients. | Konstantin Kutzkov, Rasmus Pagh |
| 2011 | ICDM | Frequent Pairs in Data Streams: Exploiting Parallelism and Skew. | Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh |
| 2007 | CSR | New Bounds for MAX-SAT by Clause Learning. | Alexander S. Kulikov, Konstantin Kutzkov |