| 2024 | ICDM | Fast and Accurate Triangle Counting in Graph Streams Using Predictions. | Cristian Boldrin, Fabio Vandin |
| 2024 | KDD | Scalable Rule Lists Learning with Sampling. | Leonardo Pellegrina, Fabio Vandin |
| 2024 | KDD | Scalable Temporal Motif Densest Subnetwork Discovery. | Ilie Sarpe, Fabio Vandin, Aristides Gionis |
| 2023 | ICDE | VC-dimension and Rademacher Averages of Subgraphs, with Applications to Graph Mining. | Paolo Pellizzoni, Fabio Vandin |
| 2023 | IJCAI | Bounding the Family-Wise Error Rate in Local Causal Discovery Using Rademacher Averages (Extended Abstract). | Dario Simionato, Fabio Vandin |
| 2022 | IJCNN | Graph Representation Learning for Multi-Task Settings: a Meta-Learning Approach. | Davide Buffelli, Fabio Vandin |
| 2021 | CIKM | odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks. | Ilie Sarpe, Fabio Vandin |
| 2021 | ICDM | CASPITA: Mining Statistically Significant Paths in Time Series Data from an Unknown Network. | Andrea Tonon, Fabio Vandin |
| 2021 | SDM | Scalable Distributed Approximation of Internal Measures for Clustering Evaluation. | Federico Altieri, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin |
| 2021 | SDM | PRESTO: Simple and Scalable Sampling Techniques for the Rigorous Approximation of Temporal Motif Counts. | Ilie Sarpe, Fabio Vandin |
| 2020 | ICDM | GRosSo: Mining Statistically Robust Patterns from a Sequence of Datasets. | Andrea Tonon, Fabio Vandin |
| 2020 | KDD | MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining. | Leonardo Pellegrina, Cyrus Cousins, Fabio Vandin, Matteo Riondato |
| 2019 | ICDM | Permutation Strategies for Mining Significant Sequential Patterns. | Andrea Tonon, Fabio Vandin |
| 2019 | KDD | SPuManTE: Significant Pattern Mining with Unconditional Testing. | Leonardo Pellegrina, Matteo Riondato, Fabio Vandin |
| 2019 | KDD | Hypothesis Testing and Statistically-sound Pattern Mining. | Leonardo Pellegrina, Matteo Riondato, Fabio Vandin |
| 2019 | RECOMB | Fast Approximation of Frequent k-mers and Applications to Metagenomics. | Leonardo Pellegrina, Cinzia Pizzi, Fabio Vandin |
| 2018 | KDD | Efficient Mining of the Most Significant Patterns with Permutation Testing. | Leonardo Pellegrina, Fabio Vandin |
| 2018 | KDD | MiSoSouP: Mining Interesting Subgroups with Sampling and Pseudodimension. | Matteo Riondato, Fabio Vandin |
| 2018 | RECOMB | Efficient Algorithms to Discover Alterations with Complementary Functional Association in Cancer. | Rebecca Sarto Basso, Dorit S. Hochbaum, Fabio Vandin |
| 2018 | WABI | Differentially Mutated Subnetworks Discovery. | Morteza Chalabi Hajkarim, Eli Upfal, Fabio Vandin |
| 2016 | AAAI | Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic. | Lorenzo De Stefani, Alessandro Epasto, Eli Upfal, Fabio Vandin |
| 2016 | RECOMB | Finding Mutated Subnetworks Associated with Survival in Cancer. | Tommy Hansen, Fabio Vandin |
| 2016 | RECOMB | The Second Decade of the International Conference on Research in Computational Molecular Biology (RECOMB). | Farhad Hormozdiari, Fereydoun Hormozdiari, Carl Kingsford, Paul Medvedev, Fabio Vandin |
| 2016 | WABI | An Efficient Branch and Cut Algorithm to Find Frequently Mutated Subnetworks in Cancer. | Anna Bomersbach, Marco Chiarandini, Fabio Vandin |
| 2015 | RECOMB | CoMEt: A Statistical Approach to Identify Combinations of Mutually Exclusive Alterations in Cancer. | Mark D. M. Leiserson, Hsin-Ta Wu, Fabio Vandin, Benjamin J. Raphael |
| 2015 | RECOMB | On the Sample Complexity of Cancer Pathways Identification. | Fabio Vandin, Benjamin J. Raphael, Eli Upfal |
| 2014 | RECOMB | Simultaneous Inference of Cancer Pathways and Tumor Progression from Cross-Sectional Mutation Data. | Benjamin J. Raphael, Fabio Vandin |
| 2014 | SDM | Finding the True Frequent Itemsets. | Matteo Riondato, Fabio Vandin |
| 2013 | MFCS | Space-Efficient Parallel Algorithms for Combinatorial Search Problems. | Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin |
| 2013 | RECOMB | Genome-Wide Survival Analysis of Somatic Mutations in Cancer. | Fabio Vandin, Alexandra Papoutsaki, Benjamin J. Raphael, Eli Upfal |
| 2012 | PSB | Discovery of Mutated Subnetworks Associated with Clinical Data in Cancer. | Fabio Vandin, Patrick Clay, Eli Upfal, Benjamin J. Raphael |
| 2012 | RECOMB | Ballast: A Ball-Based Algorithm for Structural Motifs. | Lu He, Fabio Vandin, Gopal Pandurangan, Chris Bailey-Kellogg |
| 2011 | RECOMB | Untitled record | Fabio Vandin, Eli Upfal, Benjamin J. Raphael |
| 2011 | WABI | Finding Driver Pathways in Cancer: Models and Algorithms. | Fabio Vandin, Eli Upfal, Benjamin J. Raphael |
| 2010 | RECOMB | Algorithms for Detecting Significantly Mutated Pathways in Cancer. | Fabio Vandin, Eli Upfal, Benjamin J. Raphael |
| 2009 | PODS | An efficient rigorous approach for identifying statistically significant frequent itemsets. | Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin |
| 2009 | WABI | MADMX: A Novel Strategy for Maximal Dense Motif Extraction. | Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin |
| 2007 | DIS | Efficient Incremental Mining of Top-K Frequent Closed Itemsets. | Andrea Pietracaprina, Fabio Vandin |