Marco Bressan

Researcher, ARC team, Dept. of Computer Science, Sapienza Università di Roma

mylastname at di dot uniroma1 dot it

Graph algorithms, randomized algorithms




Viale Regina Elena, 295

Building G, 2nd floor, room G28

Recent publications

M. Bressan, N. Cesa-Bianchi, A. Paudice, F. Vitale. Correlation Clustering with Adaptive Similarity Queries. 2019. ArXiv preprint.

M. Agostini, M. Bressan, S. Haddadan. Mixing time bounds for graphlet random walks. IPL (to appear).

M. Bressan. Counting subgraphs via DAG tree decompositions. IPEC 2019 (to appear). ArXiv preprint.

M. Bressan, S. Leucci, A. Panconesi. Motivo: fast motif counting via succinct color coding and adaptive sampling. VLDB 2019 (to appear). ArXiv preprint.

M. Bressan, E. Peserico, L. Pretto. On approximating the stationary distribution of time-reversible Markov chains. Theory Comput. Syst. (invited). April 2019 (preprint)

M. Bressan, E. Peserico, L. Pretto. Sublinear algorithms for local graph centrality estimation. IEEE FOCS 2018 (ArXiv full version).

M. Bressan, E. Peserico, L. Pretto. Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity. ACM SPAA 2018 (PDF).

M. Bressan, F. Chierichetti, R. Kumar, S. Leucci, A. Panconesi. Motif Counting Beyond Five Nodes. ACM TKDD, 12 (4), July 2018. (PDF)

M. Bressan, E. Peserico, L. Pretto. On Approximating the Stationary Distribution of Time-reversible Markov Chains. STACS 2018. (PDF)

M. Bressan, F. Chierichetti, R. Kumar, S. Leucci, A. Panconesi. Counting Graphlets: Space vs Time. ACM WSDM 2017. (PDF)

M. Bressan, S. Leucci, A. Panconesi, P. Raghavan, E. Terolli. The Limits of Popularity-Based Recommendations, and the Role of Social Ties. ACM KDD 2016 (PDF).


(See my DBLP entry for more)

Teaching

Algorithms, 2018/2019, Bachelor's Degree in Bioinformatics

Fundamentals of Data Science and Laboratory (home page), 2018/2019, Master's Degree in Data Science