Fabio Vandin

97 papers A* 16A 5B 13C 4Misc 1Journal 54Unranked 4
YearRankTypeTitle / Venue / Authors
2025 — conf
Efficient Approximate Temporal Triangle Counting in Streaming with Predictions.
ECML/PKDD (3)
Giorgio Venturin, Ilie Sarpe, Fabio Vandin
2025 J jnl
Efficient Approximate Temporal Triangle Counting in Streaming with Predictions.
CoRR
Giorgio Venturin, Ilie Sarpe, Fabio Vandin
2024 J jnl
<tt>ALLSTAR</tt>: inference of reliAble causaL ruLes between Somatic muTAtions and canceR phenotypes.
Bioinform.
Dario Simionato, Antonio Collesei, Federica Miglietta, Fabio Vandin
2024 J jnl
Bounding the family-wise error rate in local causal discovery using Rademacher averages.
Data Min. Knowl. Discov.
Dario Simionato, Fabio Vandin
2024 J jnl
Efficient Discovery of Significant Patterns with Few-Shot Resampling.
CoRR
Leonardo Pellegrina, Fabio Vandin
2024 J jnl
Efficient Discovery of Significant Patterns with Few-Shot Resampling.
Proc. VLDB Endow.
Leonardo Pellegrina, Fabio Vandin
2024 A* conf
Fast and Accurate Triangle Counting in Graph Streams Using Predictions.
ICDM
Cristian Boldrin, Fabio Vandin
2024 J jnl
Fast and Accurate Triangle Counting in Graph Streams Using Predictions.
CoRR
Cristian Boldrin, Fabio Vandin
2024 J jnl
SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds.
ACM Trans. Knowl. Discov. Data
Leonardo Pellegrina, Fabio Vandin
2024 A* conf
Scalable Rule Lists Learning with Sampling.
KDD
Leonardo Pellegrina, Fabio Vandin
2024 J jnl
Scalable Rule Lists Learning with Sampling.
CoRR
Leonardo Pellegrina, Fabio Vandin
2024 A* conf
Scalable Temporal Motif Densest Subnetwork Discovery.
KDD
Ilie Sarpe, Fabio Vandin, Aristides Gionis
2024 J jnl
Scalable Temporal Motif Densest Subnetwork Discovery.
CoRR
Ilie Sarpe, Fabio Vandin, Aristides Gionis
2023 A* conf
Bounding the Family-Wise Error Rate in Local Causal Discovery Using Rademacher Averages (Extended Abstract).
IJCAI
Dario Simionato, Fabio Vandin
2023 A* conf
VC-dimension and Rademacher Averages of Subgraphs, with Applications to Graph Mining.
ICDE
Paolo Pellizzoni, Fabio Vandin
2023 J jnl
caSPiTa: mining statistically significant paths in time series data from an unknown network.
Knowl. Inf. Syst.
Andrea Tonon, Fabio Vandin
2022 — conf
Bounding the Family-Wise Error Rate in Local Causal Discovery Using Rademacher Averages.
ECML/PKDD (5)
Dario Simionato, Fabio Vandin
2022 J jnl
Discovering significant evolutionary trajectories in cancer phylogenies.
Bioinform.
Leonardo Pellegrina, Fabio Vandin
2022 B conf
Graph Representation Learning for Multi-Task Settings: a Meta-Learning Approach.
IJCNN
Davide Buffelli, Fabio Vandin
2022 J jnl
Graph Representation Learning for Multi-Task Settings: a Meta-Learning Approach.
CoRR
Davide Buffelli, Fabio Vandin
2022 J jnl
MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining.
ACM Trans. Knowl. Discov. Data
Leonardo Pellegrina, Cyrus Cousins, Fabio Vandin, Matteo Riondato
2022 J jnl
SPRISS: approximating frequent
Bioinform.
Diego Santoro, Leonardo Pellegrina, Matteo Comin, Fabio Vandin
2022 A* conf
SizeShiftReg: a Regularization Method for Improving Size-Generalization in Graph Neural Networks.
NeurIPS
Davide Buffelli, Pietro Lió, Fabio Vandin
2022 J jnl
SizeShiftReg: a Regularization Method for Improving Size-Generalization in Graph Neural Networks.
CoRR
Davide Buffelli, Pietro Liò, Fabio Vandin
2022 J jnl
Technical perspective: Evaluating sampled metrics is challenging.
Commun. ACM
Fabio Vandin
2022 J jnl
The Impact of Global Structural Information in Graph Neural Networks Applications.
Data
Davide Buffelli, Fabio Vandin
2022 J jnl
gRosSo: mining statistically robust patterns from a sequence of datasets.
Knowl. Inf. Syst.
Andrea Tonon, Fabio Vandin
2021 A* conf
CASPITA: Mining Statistically Significant Paths in Time Series Data from an Unknown Network.
ICDM
Andrea Tonon, Fabio Vandin
2021 J jnl
Comparison of microbiome samples: methods and computational challenges.
Briefings Bioinform.
Matteo Comin, Barbara Di Camillo, Cinzia Pizzi, Fabio Vandin
2021 A conf
PRESTO: Simple and Scalable Sampling Techniques for the Rigorous Approximation of Temporal Motif Counts.
SDM
Ilie Sarpe, Fabio Vandin
2021 J jnl
PRESTO: Simple and Scalable Sampling Techniques for the Rigorous Approximation of Temporal Motif Counts.
CoRR
Ilie Sarpe, Fabio Vandin
2021 J jnl
SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds.
CoRR
Leonardo Pellegrina, Fabio Vandin
2021 A conf
Scalable Distributed Approximation of Internal Measures for Clustering Evaluation.
SDM
Federico Altieri, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin
2021 A conf
odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks.
CIKM
Ilie Sarpe, Fabio Vandin
2021 J jnl
odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks.
CoRR
Ilie Sarpe, Fabio Vandin
2020 J jnl
A Meta-Learning Approach for Graph Representation Learning in Multi-Task Settings.
CoRR
Davide Buffelli, Fabio Vandin
2020 J jnl
Are Graph Convolutional Networks Fully Exploiting Graph Structure?
CoRR
Davide Buffelli, Fabio Vandin
2020 J jnl
Attention-Based Deep Learning Framework for Human Activity Recognition with User Adaptation.
CoRR
Davide Buffelli, Fabio Vandin
2020 J jnl
Efficient mining of the most significant patterns with permutation testing.
Data Min. Knowl. Discov.
Leonardo Pellegrina, Fabio Vandin
2020 J jnl
Fast Approximation of Frequent k-Mers and Applications to Metagenomics.
J. Comput. Biol.
Leonardo Pellegrina, Cinzia Pizzi, Fabio Vandin
2020 A* conf
GRosSo: Mining Statistically Robust Patterns from a Sequence of Datasets.
ICDM
Andrea Tonon, Fabio Vandin
2020 A* conf
MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining.
KDD
Leonardo Pellegrina, Cyrus Cousins, Fabio Vandin, Matteo Riondato
2020 J jnl
MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining.
CoRR
Leonardo Pellegrina, Cyrus Cousins, Fabio Vandin, Matteo Riondato
2020 J jnl
MiSoSouP: Mining Interesting Subgroups with Sampling and Pseudodimension.
ACM Trans. Knowl. Discov. Data
Matteo Riondato, Fabio Vandin
2020 J jnl
Mining Sequential Patterns with VC-Dimension and Rademacher Complexity.
Algorithms
Diego Santoro, Andrea Tonon, Fabio Vandin
2020 J jnl
Scalable Distributed Approximation of Internal Measures for Clustering Evaluation.
CoRR
Federico Altieri, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin
2019 J jnl
CoExpresso: assess the quantitative behavior of protein complexes in human cells.
BMC Bioinform.
Morteza Chalabi Hajkarim, Vasileios Tsiamis, Lukas Käll, Fabio Vandin, Veit Schwämmle
2019 J jnl
Differentially mutated subnetworks discovery.
Algorithms Mol. Biol.
Morteza Chalabi Hajkarim, Eli Upfal, Fabio Vandin
2019 J jnl
Efficient algorithms to discover alterations with complementary functional association in cancer.
PLoS Comput. Biol.
Rebecca Sarto Basso, Dorit S. Hochbaum, Fabio Vandin
2019 B conf
Fast Approximation of Frequent k-mers and Applications to Metagenomics.
RECOMB
Leonardo Pellegrina, Cinzia Pizzi, Fabio Vandin
2019 A* conf
Hypothesis Testing and Statistically-sound Pattern Mining.
KDD
Leonardo Pellegrina, Matteo Riondato, Fabio Vandin
2019 A* conf
Permutation Strategies for Mining Significant Sequential Patterns.
ICDM
Andrea Tonon, Fabio Vandin
2019 A* conf
SPuManTE: Significant Pattern Mining with Unconditional Testing.
KDD
Leonardo Pellegrina, Matteo Riondato, Fabio Vandin
2018 C conf
Differentially Mutated Subnetworks Discovery.
WABI
Morteza Chalabi Hajkarim, Eli Upfal, Fabio Vandin
2018 B conf
Efficient Algorithms to Discover Alterations with Complementary Functional Association in Cancer.
RECOMB
Rebecca Sarto Basso, Dorit S. Hochbaum, Fabio Vandin
2018 A* conf
Efficient Mining of the Most Significant Patterns with Permutation Testing.
KDD
Leonardo Pellegrina, Fabio Vandin
2018 A* conf
MiSoSouP: Mining Interesting Subgroups with Sampling and Pseudodimension.
KDD
Matteo Riondato, Fabio Vandin
2017 J jnl
Clustering Uncertain Graphs.
Proc. VLDB Endow.
Matteo Ceccarello, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin
2017 J jnl
Efficient detection of differentially methylated regions using DiMmeR.
Bioinform.
Diogo Almeida, Ida Skov, Artur Silva, Fabio Vandin, Qihua Tan, Richard Röttger, Jan Baumbach
2016 C conf
An Efficient Branch and Cut Algorithm to Find Frequently Mutated Subnetworks in Cancer.
WABI
Anna Bomersbach, Marco Chiarandini, Fabio Vandin
2016 J jnl
Clustering Uncertain Graphs.
CoRR
Matteo Ceccarello, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin
2016 B conf
Finding Mutated Subnetworks Associated with Survival in Cancer.
RECOMB
Tommy Hansen, Fabio Vandin
2016 J jnl
Jllumina - A comprehensive Java-based API for statistical Illumina Infinium HumanMethylation450 and MethylationEPIC data processing.
J. Integr. Bioinform.
Diogo Almeida, Ida Skov, Jesper Lund, Afsaneh Mohammadnejad, Artur Silva, Fabio Vandin, Qihua Tan, Jan Baumbach, Richard Röttger
2016 J jnl
On the Sample Complexity of Cancer Pathways Identification.
J. Comput. Biol.
Fabio Vandin, Benjamin J. Raphael, Eli Upfal
2016 A* conf
Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic.
AAAI
Lorenzo De Stefani, Alessandro Epasto, Eli Upfal, Fabio Vandin
2016 B conf
The Second Decade of the International Conference on Research in Computational Molecular Biology (RECOMB).
RECOMB
Farhad Hormozdiari, Fereydoun Hormozdiari, Carl Kingsford, Paul Medvedev, Fabio Vandin
2015 J jnl
Accurate Computation of Survival Statistics in Genome-Wide Studies.
PLoS Comput. Biol.
Fabio Vandin, Alexandra Papoutsaki, Benjamin J. Raphael, Eli Upfal
2015 B conf
CoMEt: A Statistical Approach to Identify Combinations of Mutually Exclusive Alterations in Cancer.
RECOMB
Mark D. M. Leiserson, Hsin-Ta Wu, Fabio Vandin, Benjamin J. Raphael
2015 B conf
On the Sample Complexity of Cancer Pathways Identification.
RECOMB
Fabio Vandin, Benjamin J. Raphael, Eli Upfal
2015 J jnl
Simultaneous Inference of Cancer Pathways and Tumor Progression from Cross-Sectional Mutation Data.
J. Comput. Biol.
Benjamin J. Raphael, Fabio Vandin
2015 J jnl
Space-efficient parallel algorithms for combinatorial search problems.
J. Parallel Distributed Comput.
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin
2014 A conf
Finding the True Frequent Itemsets.
SDM
Matteo Riondato, Fabio Vandin
2014 B conf
Simultaneous Inference of Cancer Pathways and Tumor Progression from Cross-Sectional Mutation Data.
RECOMB
Benjamin J. Raphael, Fabio Vandin
2013 J jnl
Ballast: A Ball-based Algorithm for Structural Motifs.
J. Comput. Biol.
Lu He, Fabio Vandin, Gopal Pandurangan, Chris Bailey-Kellogg
2013 J jnl
Controlling False Positives in Frequent Itemsets Mining through the VC-Dimension
CoRR
Matteo Riondato, Fabio Vandin
2013 B conf
Genome-Wide Survival Analysis of Somatic Mutations in Cancer.
RECOMB
Fabio Vandin, Alexandra Papoutsaki, Benjamin J. Raphael, Eli Upfal
2013 — conf
Identifying significant mutations in large cohorts of cancer genomes.
ICCABS
Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2013 B conf
Space-Efficient Parallel Algorithms for Combinatorial Search Problems.
MFCS
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin
2013 J jnl
Space-Efficient Parallel Algorithms for Combinatorial Search Problems.
CoRR
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin
2012 J jnl
Algorithms and Genome Sequencing: Identifying Driver Pathways in Cancer.
Computer
Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2012 A conf
Algorithms on evolving graphs.
ITCS
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal, Fabio Vandin
2012 J jnl
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets.
J. ACM
Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2012 B conf
Ballast: A Ball-Based Algorithm for Structural Motifs.
RECOMB
Lu He, Fabio Vandin, Gopal Pandurangan, Chris Bailey-Kellogg
2012 Misc conf
Discovery of Mutated Subnetworks Associated with Clinical Data in Cancer.
Pacific Symposium on Biocomputing
Fabio Vandin, Patrick Clay, Eli Upfal, Benjamin J. Raphael
2012 J jnl
Finding Driver Pathways in Cancer: Models and Algorithms.
Algorithms Mol. Biol.
Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2012 — conf
Workshop: Algorithms for discovery of mutated pathways in cancer.
ICCABS
Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2011 J jnl
Algorithms for Detecting Significantly Mutated Pathways in Cancer.
J. Comput. Biol.
Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2011 C conf
Finding Driver Pathways in Cancer: Models and Algorithms.
WABI
Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2011 J jnl
MADMX: A Strategy for Maximal Dense Motif Extraction.
J. Comput. Biol.
Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
2010 B conf
Algorithms for Detecting Significantly Mutated Pathways in Cancer.
RECOMB
Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2010 J jnl
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets
CoRR
Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2010 J jnl
MADMX: A Novel Strategy for Maximal Dense Motif Extraction
CoRR
Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
2010 J jnl
Mining Top-K Frequent Itemsets Through Progressive Sampling
CoRR
Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin
2010 J jnl
Mining top-
Data Min. Knowl. Discov.
Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin
2009 A* conf
An efficient rigorous approach for identifying statistically significant frequent itemsets.
PODS
Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2009 C conf
MADMX: A Novel Strategy for Maximal Dense Motif Extraction.
WABI
Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
2007 B conf
Efficient Incremental Mining of Top-K Frequent Closed Itemsets.
Discovery Science
Andrea Pietracaprina, Fabio Vandin