BRESSAN, MARCO
BRESSAN, MARCO
Dipartimento di Informatica Giovanni Degli Antoni
A Theory of Interpretable Approximations
2024 M. Bressan, N. Cesa Bianchi, E. Esposito, Y. Mansour, S. Moran, M. Thiessen
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
2023 M. Bressan, M. Lanzinger, M. Roth
Sublinear Algorithms for Local Graph-Centrality Estimation
2023 M. Bressan, E. Peserico, L. Pretto
Fully-Dynamic Decision Trees
2023 M. Bressan, G. Damay, M. Sozio
Counting Subgraphs in Somewhere Dense Graphs
2023 M. Bressan, L. Ann Goldberg, K. Meeks, M. Roth
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs
2023 M. Bressan
Active Learning of Classifiers with Label and Seed Queries
2022 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice, M. Thiessen
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
2022 M. Bressan, M. Roth
Faster Motif Counting via Succinct Color Coding and Adaptive Sampling
2021 M. Bressan, S. Leucci, A. Panconesi
Faster algorithms for counting subgraphs in sparse graphs
2021 M. Bressan
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries
2021 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice
Efficient and near-optimal algorithms for sampling connected subgraphs
2021 M. Bressan
On Margin-Based Cluster Recovery with Oracle Queries
2021 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice
Exact Recovery of Mangled Clusters with Same-Cluster Queries
2020 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice
On Approximating the Stationary Distribution of Time-Reversible Markov Chains
2020 M. Bressan, E. Peserico, L. Pretto
Mixing time bounds for graphlet random walks
2019 M. Agostini, M. Bressan, S. Haddadan
Motivo: Fast motif counting via succinct color coding and adaptive sampling
2019 M. Bressan, S. Leucci, A. Panconesi
Correlation Clustering with Adaptive Similarity Queries
2019 M. Bressan, N. Cesa-Bianchi, A. Paudice, F. Vitale
Faster subgraph counting in sparse graphs
2019 M. Bressan
Motif counting beyond five nodes
2018 M. Bressan, F. Chierichetti, R. Kumar, S. Leucci, A. Panconesi