Marco Bressan

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 46

Top Topics

Exact And Approximate

Query Complexity

Adaptive Sampling

Connected Subgraphs

Top Venues

Publications

Marco Bressan, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen
A Theory of Interpretable Approximations. COLT (2024)
Marco Bressan, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen
A Theory of Interpretable Approximations. CoRR (2024)
Marco Bressan, Emmanuel Esposito, Maximilian Thiessen
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs. COLT (2024)
Marco Bressan, Emmanuel Esposito, Maximilian Thiessen
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs. CoRR (2024)
Marco Bressan, Matthias Lanzinger, Marc Roth
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. STOC (2023)
Marco Bressan, Enoch Peserico, Luca Pretto
Sublinear Algorithms for Local Graph-Centrality Estimation. SIAM J. Comput. 52 (4) (2023)
Marco Bressan, Gabriel Damay, Mauro Sozio
Fully-Dynamic Decision Trees. AAAI (2023)
Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
Counting Subgraphs in Somewhere Dense Graphs. ITCS (2023)
Marco Bressan
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs. ACM Trans. Algorithms 19 (3) (2023)
Marco Bressan, Mauro Sozio
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees. CoRR (2023)
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice, Maximilian Thiessen
Active Learning of Classifiers with Label and Seed Queries. CoRR (2022)
Marco Bressan, Matthias Lanzinger, Marc Roth
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. CoRR (2022)
Marco Bressan, Marc Roth
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies. FOCS (2022)
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice, Maximilian Thiessen
Active Learning of Classifiers with Label and Seed Queries. NeurIPS (2022)
Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
Counting Subgraphs in Somewhere Dense Graphs. CoRR (2022)
Marco Bressan, Gabriel Damay, Mauro Sozio
Fully-Dynamic Decision Trees. CoRR (2022)
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
On Margin-Based Cluster Recovery with Oracle Queries. CoRR (2021)
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. COLT (2021)
Marco Bressan, Marc Roth
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies. FOCS (2021)
Marco Bressan, Marc Roth
Counting homomorphisms, subgraphs, and induced subgraphs in degenerate graphs: new hardness results and complete complexity classifications. CoRR (2021)
Marco Bressan
Efficient and near-optimal algorithms for sampling connected subgraphs. STOC (2021)
Marco Bressan
Faster algorithms for counting subgraphs in sparse graphs. Algorithmica 83 (8) (2021)
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. CoRR (2021)
Marco Bressan, Stefano Leucci, Alessandro Panconesi
Faster Motif Counting via Succinct Color Coding and Adaptive Sampling. ACM Trans. Knowl. Discov. Data 15 (6) (2021)
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
On Margin-Based Cluster Recovery with Oracle Queries. NeurIPS (2021)
Marco Bressan, Enoch Peserico, Luca Pretto
On Approximating the Stationary Distribution of Time-Reversible Markov Chains. Theory Comput. Syst. 64 (3) (2020)
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
Exact Recovery of Mangled Clusters with Same-Cluster Queries. CoRR (2020)
Marco Bressan, Stefano Leucci, Alessandro Panconesi
Faster motif counting via succinct color coding and adaptive sampling. CoRR (2020)
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
Exact Recovery of Mangled Clusters with Same-Cluster Queries. NeurIPS (2020)
Marco Bressan
Faster algorithms for sampling connected induced subgraphs. CoRR (2020)
Marco Bressan, Stefano Leucci, Alessandro Panconesi
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling. Proc. VLDB Endow. 12 (11) (2019)
Marco Bressan, Stefano Leucci, Alessandro Panconesi
Motivo: fast motif counting via succinct color coding and adaptive sampling. CoRR (2019)
Matteo Agostini, Marco Bressan, Shahrzad Haddadan
Mixing time bounds for graphlet random walks. Inf. Process. Lett. 152 (2019)
Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale
Correlation Clustering with Adaptive Similarity Queries. NeurIPS (2019)
Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale
Correlation Clustering with Adaptive Similarity Queries. CoRR (2019)
Marco Bressan
Faster Subgraph Counting in Sparse Graphs. IPEC (2019)
Marco Bressan, Enoch Peserico, Luca Pretto
On Approximating the Stationary Distribution of Time-reversible Markov Chains. STACS (2018)
Marco Bressan
On degeneracy and the parameterized complexity of subgraph counting. CoRR (2018)
Marco Bressan, Enoch Peserico, Luca Pretto
Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity. SPAA (2018)
Marco Bressan, Enoch Peserico, Luca Pretto
Sublinear Algorithms for Local Graph Centrality Estimation. FOCS (2018)
Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi
Motif Counting Beyond Five Nodes. ACM Trans. Knowl. Discov. Data 12 (4) (2018)
Marco Bressan, Enoch Peserico, Luca Pretto
On approximating the stationary distribution of time-reversible Markov chains. CoRR (2018)
Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi
Counting Graphlets: Space vs Time. WSDM (2017)
Marco Bressan, Enoch Peserico, Luca Pretto
The Power of Local Information in PageRank. CoRR (2016)
Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. CoRR (2016)
Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. KDD (2016)
Marco Bressan, Enoch Peserico, Luca Pretto
Simple set cardinality estimation through random sampling. CoRR (2015)
Marco Bressan, Enoch Peserico, Luca Pretto
Approximating PageRank locally with sublinear query complexity. CoRR (2014)
Marco Bressan, Enoch Peserico, Luca Pretto
The power of local information in PageRank. WWW (Companion Volume) (2013)
Francesco Peruch, Federica Bogo, Michele Bonazza, Marco Bressan, Vincenzo-Maria Cappelleri, Enoch Peserico
Simple, Fast, Accurate Melanocytic Lesion Segmentation in 1D Colour Space. VISAPP (1) (2013)
Paolo Bertasi, Marco Bressan, Enoch Peserico
, yet another fast stable sorting software. ACM J. Exp. Algorithmics 16 (2011)
Marco Bressan, Luca Pretto
Local computation of PageRank: the ranking side. CIKM (2011)
Paolo Bertasi, Michele Bonazza, Marco Bressan, Enoch Peserico
Datamation: A Quarter of a Century and Four Orders of Magnitude Later. CLUSTER (2011)
Marco Bressan, Enoch Peserico
Choose the damping, choose the ranking? J. Discrete Algorithms 8 (2) (2010)
Marco Bressan, Enoch Peserico
Urban Hitchhiking. FUN (2010)
Paolo Bertasi, Marco Bressan, Enoch Peserico
psort, Yet Another Fast Stable Sorting Software. SEA (2009)
Marco Bressan, Enoch Peserico
Choose the Damping, Choose the Ranking?. WAW (2009)