| 2025 | AAAI | From Your Block to Our Block: How to Find Shared Structure Between Stochastic Block Models over Multiple Graphs. | Iiro Kumpulainen, Sebastian Dalleiger, Jilles Vreeken, Nikolaj Tatti |
| 2025 | CIKM | SpeedSteiner: A Fast | Guangyi Zhang, Nikolaj Tatti, Aristides Gionis |
| 2025 | KDD | Fair Diversity Maximization with Few Representatives. | Florian Adriaens, Nikolaj Tatti |
| 2025 | SDM | Approximating splits for decision trees quickly in sparse data streams. | Nikolaj Tatti |
| 2024 | KDD | Dense Subgraph Discovery Meets Strong Triadic Closure. | Chamalee Wickrama Arachchi, Iiro Kumpulainen, Nikolaj Tatti |
| 2024 | KDD | Max-Min Diversification with Asymmetric Distances. | Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti |
| 2023 | DIS | Jaccard-Constrained Dense Subgraph Discovery. | Chamalee Wickrama Arachchi, Nikolaj Tatti |
| 2023 | KDD | Finding Favourite Tuples on Data Streams with Provably Few Comparisons. | Guangyi Zhang, Nikolaj Tatti, Aristides Gionis |
| 2023 | SDM | Ranking with submodular functions on the fly. | Guangyi Zhang, Nikolaj Tatti, Aristides Gionis |
| 2023 | SDM | Node ranking in labeled networks. | Chamalee Wickrama Arachchi, Nikolaj Tatti |
| 2022 | DIS | Recurrent Segmentation Meets Block Models in Temporal Networks. | Chamalee Wickrama Arachchi, Nikolaj Tatti |
| 2022 | DIS | Community Detection in Edge-Labeled Graphs. | Iiro Kumpulainen, Nikolaj Tatti |
| 2022 | ICDM | Coresets remembered and items forgotten: submodular maximization with deletions. | Guangyi Zhang, Nikolaj Tatti, Aristides Gionis |
| 2021 | ICDM | Fast computation of distance-generalized cores using sampling. | Nikolaj Tatti |
| 2019 | SDM | Boolean matrix factorization meets consecutive ones property. | Nikolaj Tatti, Pauli Miettinen |
| 2018 | ICDM | Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery. | Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti |
| 2018 | SDM | Reconstructing a cascade from temporal observations. | Han Xiao, Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis |
| 2017 | KDD | Inferring the Strength of Social Ties: A Community-Driven Approach. | Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis |
| 2017 | SDM | Community-aware network sparsification. | Aristides Gionis, Polina Rozenshtein, Nikolaj Tatti, Evimaria Terzi |
| 2017 | SDM | Discovering bursts revisited: guaranteed optimization of the model parameters. | Nikolaj Tatti |
| 2016 | ICDM | A Combinatorial Approach to Role Discovery. | Albert Arockiasamy, Aristides Gionis, Nikolaj Tatti |
| 2015 | ICDM | Hierarchies in Directed Networks. | Nikolaj Tatti |
| 2015 | WWW | Density-friendly Graph Decomposition. | Nikolaj Tatti, Aristides Gionis |
| 2014 | KDD | Event detection in activity networks. | Polina Rozenshtein, Aris Anagnostopoulos, Aristides Gionis, Nikolaj Tatti |
| 2013 | ICDM | Itemsets for Real-Valued Datasets. | Nikolaj Tatti |
| 2013 | SDM | Mining Connection Pathways for Marked Nodes in Large Graphs. | Leman Akoglu, Duen Horng Chau, Christos Faloutsos, Nikolaj Tatti, Hanghang Tong, Jilles Vreeken |
| 2012 | KDD | The long and the short of it: summarising event sequences with serial episodes. | Nikolaj Tatti, Jilles Vreeken |
| 2012 | SDM | MARBLES: Mining Association Rules Buried in Long Event Sequences. | Boris Cule, Nikolaj Tatti, Bart Goethals |
| 2011 | ICDM | Finding Robust Itemsets under Subsampling. | Nikolaj Tatti, Fabian Moerchen |
| 2011 | KDD | Tell me what i need to know: succinctly summarizing data with itemsets. | Michael Mampaey, Nikolaj Tatti, Jilles Vreeken |
| 2011 | KDD | Mining closed episodes with simultaneous events. | Nikolaj Tatti, Boris Cule |
| 2011 | SDM | Are your Items in Order. | Nikolaj Tatti |
| 2010 | ICDM | Mining Closed Strict Episodes. | Nikolaj Tatti, Boris Cule |
| 2010 | KDD | Probably the best itemsets. | Nikolaj Tatti |
| 2009 | ICDM | Significance of Episodes Based on Minimal Windows. | Nikolaj Tatti |
| 2009 | KDD | Tell me something I don't know: randomization strategies for iterative data mining. | Sami Hanhijrvi, Markus Ojala, Niko Vuokko, Kai Puolamki, Nikolaj Tatti, Heikki Mannila |
| 2008 | ICDM | Finding Good Itemsets by Packing Data. | Nikolaj Tatti, Jilles Vreeken |
| 2007 | ICDM | Maximum Entropy Based Significance of Itemsets. | Nikolaj Tatti |
| 2006 | ICDM | What is the Dimension of Your Binary Data? | Nikolaj Tatti, Taneli Mielikinen, Aristides Gionis, Heikki Mannila |