Marco Bressan

69 papers A* 18A 5B 3C 2Misc 1Journal 37Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Learning Conditional Averages.
CoRR
Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen
2026 A* conf
The Parameterised Complexity of Counting Small Sub-Hypergraphs.
SODA
Marco Bressan, Julian Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz
2025 A* conf
A Fine-grained Characterization of PAC Learnability.
COLT
Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen
2025 J jnl
Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs.
CoRR
Marco Bressan, Victor Chepoi, Emmanuel Esposito, Maximilian Thiessen
2025 A* conf
Of Dice and Games: A Theory of Generalized Boosting.
COLT
Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen
2025 A conf
On Finding Randomly Planted Cliques in Arbitrary Graphs.
APPROX/RANDOM
Francesco Agrimonti, Marco Bressan, Tommaso d'Orsi
2025 J jnl
On Finding Randomly Planted Cliques in Arbitrary Graphs.
CoRR
Francesco Agrimonti, Marco Bressan, Tommaso d'Orsi
2025 J jnl
The Complexity of Counting Small Sub-Hypergraphs.
CoRR
Marco Bressan, Julian Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz
2024 A* conf
A Theory of Interpretable Approximations.
COLT
Marco Bressan, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen
2024 J jnl
A Theory of Interpretable Approximations.
CoRR
Marco Bressan, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen
2024 J jnl
Counting Subgraphs in Somewhere Dense Graphs.
SIAM J. Comput.
Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2024 A* conf
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs.
COLT
Marco Bressan, Emmanuel Esposito, Maximilian Thiessen
2024 J jnl
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs.
CoRR
Marco Bressan, Emmanuel Esposito, Maximilian Thiessen
2024 A* conf
Efficient Streaming Algorithms for Graphlet Sampling.
NeurIPS
Yann Bourreau, Marco Bressan, T.-H. Hubert Chan, Qipeng Kuang, Mauro Sozio
2024 A* conf
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees.
ICML
Marco Bressan, Mauro Sozio
2024 J jnl
Margin-Based Active Learning of Classifiers.
J. Mach. Learn. Res.
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
2024 J jnl
Of Dice and Games: A Theory of Generalized Boosting.
CoRR
Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen
2023 A conf
Counting Subgraphs in Somewhere Dense Graphs.
ITCS
Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2023 J jnl
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs.
ACM Trans. Algorithms
Marco Bressan
2023 J jnl
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees.
CoRR
Marco Bressan, Mauro Sozio
2023 A* conf
Fully-Dynamic Decision Trees.
AAAI
Marco Bressan, Gabriel Damay, Mauro Sozio
2023 J jnl
Sublinear Algorithms for Local Graph-Centrality Estimation.
SIAM J. Comput.
Marco Bressan, Enoch Peserico, Luca Pretto
2023 A* conf
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree.
STOC
Marco Bressan, Matthias Lanzinger, Marc Roth
2022 A* conf
Active Learning of Classifiers with Label and Seed Queries.
NeurIPS
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice, Maximilian Thiessen
2022 J jnl
Active Learning of Classifiers with Label and Seed Queries.
CoRR
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice, Maximilian Thiessen
2022 J jnl
Counting Subgraphs in Somewhere Dense Graphs.
CoRR
Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2022 J jnl
Fully-Dynamic Decision Trees.
CoRR
Marco Bressan, Gabriel Damay, Mauro Sozio
2022 J jnl
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree.
CoRR
Marco Bressan, Matthias Lanzinger, Marc Roth
2021 J jnl
Counting homomorphisms, subgraphs, and induced subgraphs in degenerate graphs: new hardness results and complete complexity classifications.
CoRR
Marco Bressan, Marc Roth
2021 A* conf
Efficient and near-optimal algorithms for sampling connected subgraphs.
STOC
Marco Bressan
2021 A* conf
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries.
COLT
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
2021 J jnl
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries.
CoRR
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
2021 A* conf
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies.
FOCS
Marco Bressan, Marc Roth
2021 J jnl
Faster Motif Counting via Succinct Color Coding and Adaptive Sampling.
ACM Trans. Knowl. Discov. Data
Marco Bressan, Stefano Leucci, Alessandro Panconesi
2021 J jnl
Faster algorithms for counting subgraphs in sparse graphs.
Algorithmica
Marco Bressan
2021 A* conf
On Margin-Based Cluster Recovery with Oracle Queries.
NeurIPS
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
2021 J jnl
On Margin-Based Cluster Recovery with Oracle Queries.
CoRR
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
2020 A* conf
Exact Recovery of Mangled Clusters with Same-Cluster Queries.
NeurIPS
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
2020 J jnl
Exact Recovery of Mangled Clusters with Same-Cluster Queries.
CoRR
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice
2020 J jnl
Faster algorithms for sampling connected induced subgraphs.
CoRR
Marco Bressan
2020 J jnl
Faster motif counting via succinct color coding and adaptive sampling.
CoRR
Marco Bressan, Stefano Leucci, Alessandro Panconesi
2020 J jnl
On Approximating the Stationary Distribution of Time-Reversible Markov Chains.
Theory Comput. Syst.
Marco Bressan, Enoch Peserico, Luca Pretto
2019 A* conf
Correlation Clustering with Adaptive Similarity Queries.
NeurIPS
Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale
2019 J jnl
Correlation Clustering with Adaptive Similarity Queries.
CoRR
Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale
2019 B conf
Faster Subgraph Counting in Sparse Graphs.
IPEC
Marco Bressan
2019 J jnl
Mixing time bounds for graphlet random walks.
Inf. Process. Lett.
Matteo Agostini, Marco Bressan, Shahrzad Haddadan
2019 J jnl
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling.
Proc. VLDB Endow.
Marco Bressan, Stefano Leucci, Alessandro Panconesi
2019 J jnl
Motivo: fast motif counting via succinct color coding and adaptive sampling.
CoRR
Marco Bressan, Stefano Leucci, Alessandro Panconesi
2018 B conf
Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity.
SPAA
Marco Bressan, Enoch Peserico, Luca Pretto
2018 J jnl
Motif Counting Beyond Five Nodes.
ACM Trans. Knowl. Discov. Data
Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi
2018 A conf
On Approximating the Stationary Distribution of Time-reversible Markov Chains.
STACS
Marco Bressan, Enoch Peserico, Luca Pretto
2018 J jnl
On approximating the stationary distribution of time-reversible Markov chains.
CoRR
Marco Bressan, Enoch Peserico, Luca Pretto
2018 J jnl
On degeneracy and the parameterized complexity of subgraph counting.
CoRR
Marco Bressan
2018 A* conf
Sublinear Algorithms for Local Graph Centrality Estimation.
FOCS
Marco Bressan, Enoch Peserico, Luca Pretto
2017 A conf
Counting Graphlets: Space vs Time.
WSDM
Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi
2016 A* conf
The Limits of Popularity-Based Recommendations, and the Role of Social Ties.
KDD
Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli
2016 J jnl
The Limits of Popularity-Based Recommendations, and the Role of Social Ties.
CoRR
Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli
2016 J jnl
The Power of Local Information in PageRank.
CoRR
Marco Bressan, Enoch Peserico, Luca Pretto
2015 J jnl
Simple set cardinality estimation through random sampling.
CoRR
Marco Bressan, Enoch Peserico, Luca Pretto
2014 J jnl
Approximating PageRank locally with sublinear query complexity.
CoRR
Marco Bressan, Enoch Peserico, Luca Pretto
2013 — conf
Simple, Fast, Accurate Melanocytic Lesion Segmentation in 1D Colour Space.
VISAPP (1)
Francesco Peruch, Federica Bogo, Michele Bonazza, Marco Bressan, Vincenzo-Maria Cappelleri, Enoch Peserico
2013 — conf
The power of local information in PageRank.
WWW (Companion Volume)
Marco Bressan, Enoch Peserico, Luca Pretto
2011 C conf
Datamation: A Quarter of a Century and Four Orders of Magnitude Later.
CLUSTER
Paolo Bertasi, Michele Bonazza, Marco Bressan, Enoch Peserico
2011 A conf
Local computation of PageRank: the ranking side.
CIKM
Marco Bressan, Luca Pretto
2011 — —
Ranking robustly.
Marco Bressan
2010 J jnl
Choose the damping, choose the ranking?
J. Discrete Algorithms
Marco Bressan, Enoch Peserico
2010 Misc conf
Urban Hitchhiking.
FUN
Marco Bressan, Enoch Peserico
2009 C conf
Choose the Damping, Choose the Ranking?.
WAW
Marco Bressan, Enoch Peserico
2009 B conf
psort, Yet Another Fast Stable Sorting Software.
SEA
Paolo Bertasi, Marco Bressan, Enoch Peserico