Παρακολούθηση
Cristiane M. Sato
Cristiane M. Sato
Federal University of de ABC Region, Brazil
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα ufabc.edu.br
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Sparse sums of positive semidefinite matrices
MKDC Silva, NJA Harvey, CM Sato
ACM Transactions on Algorithms (TALG) 12 (1), 1-17, 2015
48*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
272013
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
21*2014
On the Maximum Density of Fixed Strongly Connected Subtournaments
CMS Leonardo N. Coregliano, Roberto F. Parente
The Eletronic Journal of Combinatorics 26 (1), 2019
19*2019
Flag algebras: A first glance
MK Silva, CM Sato
arXiv preprint arXiv:1607.04741, 2016
112016
On the robustness of random k-cores
CM Sato
European Journal of Combinatorics 41, 163-182, 2014
72014
Asymptotic enumeration of sparse connected 3-uniform hypergraphs
CM Sato, N Wormald
arXiv preprint arXiv:1401.7381, 2014
52014
A transition of limiting distributions of large matchings in random graphs
P Gao, CM Sato
Journal of Combinatorial Theory, Series B, 2016
42016
Packing arborescences in random digraphs
C Hoppen, RF Parente, CM Sato
SIAM Journal on Discrete Mathematics 33 (1), 438-453, 2019
22019
Flag algebras: a first glance
MK de Carli Silva, FM de Oliveira Filho, CM Sato
arXiv preprint arXiv:1607.04741, 2016
22016
Asymptotic enumeration of sparse 2‐connected graphs
G Kemkes, CM Sato, N Wormald
Random Structures & Algorithms 43 (3), 354-376, 2013
22013
Core structures in random graphs and hypergraphs
CM Sato
University of Waterloo, 2013
22013
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
12019
Homomorfismos de grafos
CM Sato
Universidade de São Paulo, 2008
12008
Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm
NB Proença, MK Silva, CM Sato, L Tunçel
arXiv preprint arXiv:2406.18670, 2024
2024
Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm
N Benedetto Proença, MK de Carli Silva, CM Sato, L Tunçel
arXiv e-prints, arXiv: 2406.18670, 2024
2024
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
A randomized approximation algorithm for the weighted fractional cut-covering problem
NB Proença, MKC Silva, CM Sato, L Tunçel
Abstracts, 2023
2023
Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges
C Hoppen, GO Mota, RF Parente, CM Sato
Electronic Notes in Theoretical Computer Science 346, 535-544, 2019
2019
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20