Cristiane M. Sato

Orcid: 0000-0002-1948-2957

According to our database1, Cristiane M. Sato authored at least 14 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Primal-Dual Extension of the Goemans-Williamson Algorithm for the Weighted Fractional Cut-Covering Problem.
CoRR, 2023

2019
Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the Maximum Density of Fixed Strongly Connected Subtournaments.
Electron. J. Comb., 2019

Commute Time as a Method to Explore Brain Functional Connectomes.
Brain Connect., 2019

2018
Arboricity and spanning-tree packing in random graphs.
Random Struct. Algorithms, 2018

2017
Packing arborescences in random digraphs.
Electron. Notes Discret. Math., 2017

2016
Sparse Sums of Positive Semidefinite Matrices.
ACM Trans. Algorithms, 2016

A transition of limiting distributions of large matchings in random graphs.
J. Comb. Theory, Ser. B, 2016

2015
On the maximum density of fixed strongly connected subtournaments.
CoRR, 2015

2014
On longest paths and diameter in random apollonian network.
Random Struct. Algorithms, 2014

On the robustness of random k-cores.
Eur. J. Comb., 2014

Arboricity and spanning-tree packing in random graphs with an application to load balancing.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Asymptotic enumeration of sparse 2-connected graphs.
Random Struct. Algorithms, 2013

On the Longest Paths and the Diameter in Random Apollonian Networks.
Electron. Notes Discret. Math., 2013


  Loading...