| Sparse sums of positive semidefinite matrices MKDC Silva, NJA Harvey, CM Sato ACM Transactions on Algorithms (TALG) 12 (1), 1-17, 2015 | 46* | 2015 |
| On the longest paths and the diameter in random Apollonian networks E Ebrahimzadeh, L Farczadi, P Gao, A Mehrabian, CM Sato, N Wormald, ... Electronic Notes in Discrete Mathematics 43, 355-365, 2013 | 23 | 2013 |
| On the maximum density of fixed strongly connected subtournaments LN Coregliano, RF Parente, CM Sato arXiv preprint arXiv:1505.05200, 2015 | 18 | 2015 |
| Arboricity and spanning-tree packing in random graphs with an application to load balancing P Gao, X Pérez-Giménez, CM Sato Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 18 | 2014 |
| Flag algebras: A first glance MK Silva, CM Sato arXiv preprint arXiv:1607.04741, 2016 | 10 | 2016 |
| On the robustness of random k-cores CM Sato European Journal of Combinatorics 41, 163-182, 2014 | 7 | 2014 |
| Asymptotic enumeration of sparse connected 3-uniform hypergraphs CM Sato, N Wormald arXiv preprint arXiv:1401.7381, 2014 | 5 | 2014 |
| Arboricity and spanning‐tree packing in random graphs P Gao, X Pérez‐Giménez, CM Sato Random Structures & Algorithms 52 (3), 495-535, 2018 | 4 | 2018 |
| A transition of limiting distributions of large matchings in random graphs P Gao, CM Sato Journal of Combinatorial Theory, Series B 116, 57-86, 2016 | 4 | 2016 |
| Change of limiting distributions of large matchings in random graphs P Gao, CM Sato arXiv preprint arXiv:1305.5009, 2013 | 4* | 2013 |
| Graphs with few crossings and the crossing number of Kp, q in topological surfaces AC Silva Universidade Estadual de Campinas (UNICAMP). Instituto de Computação, 2018 | 2 | 2018 |
| Flag algebras: a first glance MK de Carli Silva, FM de Oliveira Filho, CM Sato arXiv preprint arXiv:1607.04741, 2016 | 2 | 2016 |
| Asymptotic enumeration of sparse 2‐connected graphs G Kemkes, CM Sato, N Wormald Random Structures & Algorithms 43 (3), 354-376, 2013 | 2 | 2013 |
| Core structures in random graphs and hypergraphs CM Sato University of Waterloo, 2013 | 2 | 2013 |
| Commute time as a method to explore brain functional connectomes JR Sato, CM Sato, MKC Silva, CE Biazoli Jr Brain Connectivity 9 (2), 155-161, 2019 | 1 | 2019 |
| Packing arborescences in random digraphs C Hoppen, RF Parente, CM Sato SIAM Journal on Discrete Mathematics 33 (1), 438-453, 2019 | 1 | 2019 |
| Packing arborescences in random digraphs C Hoppen, RF Parente, CM Sato arXiv preprint arXiv:1605.05764, 2016 | 1 | 2016 |
| Homomorfismos de grafos CM Sato Universidade de São Paulo, 2008 | 1 | 2008 |
| A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem NB Proença, MK Silva, CM Sato, L Tunçel arXiv preprint arXiv:2311.15346, 2023 | | 2023 |
| A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem N Benedetto Proença, MK de Carli Silva, CM Sato, L Tunçel arXiv e-prints, arXiv: 2311.15346, 2023 | | 2023 |
Marcel K. de Carli SilvaAssistant Professor, Institute of Mathematics and Statistics, University of São PauloVerified email at ime.usp.br
