Marco Bressan

Cited by

	All	Since 2020
Citations	600	447
h-index	14	12
i10-index	20	15

140

105

20102011201220132014201520162017201820192020202120222023202420254 5 5 8 14 11 5 20 45 33 52 86 78 96 123 12

Public access

View all

19 articles

1 article

available

not available

Based on funding mandates

Co-authors

Alessandro PanconesiComputer Science - Sapienza, University of RomeVerified email at di.uniroma1.it
Stefano LeucciDepartment of Information Engineering, Computer Science, and Mathematics - University of L'AquilaVerified email at univaq.it
Nicolò Cesa-BianchiProfessor of Computer Science, Università degli Studi di Milano and Politecnico di MilanoVerified email at unimi.it
Luca PrettoUniversità di PadovaVerified email at dei.unipd.it
Andrea PaudiceAssistant Professor (Tenure Track) at Aarhus UniversityVerified email at cs.au.dk
Silvio LattanziResearch Scientist at GoogleVerified email at google.com
Flavio ChierichettiProfessor at Sapienza University of RomeVerified email at chierichetti.name
Ravi KumarGoogleVerified email at google.com
Marc RothSchool of Electronic Engineering and Computer Science, Queen Mary University of LondonVerified email at qmul.ac.uk
Maximilian ThiessenPhD student, TU WienVerified email at tuwien.ac.at
Erisa TerolliStevens Institute of TechnologyVerified email at stevens.edu
Mauro SozioProfessor of Computer Science at Institut Polytechnique de Paris, Telecom ParisVerified email at telecom-paristech.fr
Emmanuel EspositoPostdoctoral Researcher, Università degli Studi di MilanoVerified email at unimi.it
Matthias LanzingerAssistant Professor, TU WienVerified email at tuwien.ac.at
Shay Moran(Math, CS, & DDS, Technion) & (Google Research)Verified email at google.com
Yishay MansourTel Aviv UniversityVerified email at tauex.tau.ac.il

Marco Bressan

Assistant Professor of Computer Science, University of Milan

Verified email at unimi.it - Homepage

Graphs Learning Algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Counting graphlets: Space vs time M Bressan, F Chierichetti, R Kumar, S Leucci, A Panconesi Proceedings of the tenth ACM international conference on web search and data …, 2017	108	2017
Motif counting beyond five nodes M Bressan, F Chierichetti, R Kumar, S Leucci, A Panconesi ACM Transactions on Knowledge Discovery from Data (TKDD) 12 (4), 1-25, 2018	74	2018
Motivo: fast motif counting via succinct color coding and adaptive sampling M Bressan, S Leucci, A Panconesi arXiv preprint arXiv:1906.01599, 2019	58	2019
Choose the damping, choose the ranking? M Bressan, E Peserico Journal of Discrete Algorithms 8 (2), 199-213, 2010	53	2010
The limits of popularity-based recommendations, and the role of social ties M Bressan, S Leucci, A Panconesi, P Raghavan, E Terolli Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge …, 2016	30	2016
Correlation clustering with adaptive similarity queries M Bressan, N Cesa-Bianchi, A Paudice, F Vitale Advances in Neural Information Processing Systems 32, 2019	24	2019
Local computation of PageRank: the ranking side M Bressan, L Pretto Proceedings of the 20th ACM international conference on Information and …, 2011	24	2011
Faster algorithms for counting subgraphs in sparse graphs M Bressan Algorithmica 83, 2578-2605, 2021	21	2021
Faster subgraph counting in sparse graphs M Bressan 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019	19	2019
Exact recovery of clusters in finite metric spaces using oracle queries M Bressan, N Cesa-Bianchi, S Lattanzi, A Paudice Conference on Learning Theory, 775-803, 2021	18	2021
The power of local information in pagerank M Bressan, E Peserico, L Pretto Proceedings of the 22nd International Conference on World Wide Web, 179-180, 2013	17	2013
Sublinear algorithms for local graph-centrality estimation M Bressan, E Peserico, L Pretto SIAM Journal on Computing 52 (4), 968-1008, 2023	15	2023
Exact recovery of mangled clusters with same-cluster queries M Bressan, N Cesa-Bianchi, S Lattanzi, A Paudice Advances in Neural Information Processing Systems 33, 9324-9334, 2020	15	2020
Exact and approximate pattern counting in degenerate graphs: New algorithms, hardness results, and complexity dichotomies M Bressan, M Roth 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022	14	2022
Simple set cardinality estimation through random sampling M Bressan, E Peserico, L Pretto arXiv preprint arXiv:1512.07901, 2015	13	2015
Faster motif counting via succinct color coding and adaptive sampling M Bressan, S Leucci, A Panconesi ACM Transactions on Knowledge Discovery from Data (TKDD) 15 (6), 1-27, 2021	12	2021
On approximating the stationary distribution of time-reversible Markov chains M Bressan, E Peserico, L Pretto Theory of Computing Systems 64 (3), 444-466, 2020	11	2020
Mixing time bounds for graphlet random walks M Agostini, M Bressan, S Haddadan Information Processing Letters 152, 105851, 2019	11	2019
Approximating pagerank locally with sublinear query complexity M Bressan, E Peserico, L Pretto arXiv preprint arXiv:1404.1864, 2014	11	2014
Efficient and near-optimal algorithms for sampling connected subgraphs M Bressan Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021	10*	2021

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors