Cristiane M. Sato

According to our database, Cristiane M. Sato authored at least 17 papers between 2013 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach.

Nathan Benedetto Proença, Marcel K. de Carli Silva, Cristiane M. Sato, Levent Tunçel

CoRR, April, 2026

A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem.

Nathan Benedetto Proença, Marcel K. de Carli Silva, Cristiane M. Sato, Levent Tunçel

Math. Program., January, 2026

2024

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs.

Fábio Botler, Yan S. Couto, Cristina G. Fernandes, Eder F. de Figueiredo, Renzo Gómez, Vinícius Fernandes dos Santos, Cristiane M. Sato

CoRR, 2024

Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans-Williamson Algorithm.

Nathan Benedetto Proença, Marcel K. de Carli Silva, Cristiane M. Sato, Levent Tunçel

CoRR, 2024

2019

Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges.

Carlos Hoppen, Guilherme Oliveira Mota, Roberto F. Parente, Cristiane M. Sato

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the Maximum Density of Fixed Strongly Connected Subtournaments.

Leonardo Nagami Coregliano, Roberto F. Parente, Cristiane M. Sato

Electron. J. Comb., 2019

Commute Time as a Method to Explore Brain Functional Connectomes.

João Ricardo Sato, Cristiane M. Sato, Marcel Kenji de Carli Silva, Claudinei Eduardo Biazoli Jr.

Brain Connect., 2019

2018

Arboricity and spanning-tree packing in random graphs.

Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato

Random Struct. Algorithms, 2018

2017

Packing arborescences in random digraphs.

Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato

Electron. Notes Discret. Math., 2017

2016

Sparse Sums of Positive Semidefinite Matrices.

Marcel Kenji de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato

ACM Trans. Algorithms, 2016

A transition of limiting distributions of large matchings in random graphs.

Pu Gao, Cristiane M. Sato

J. Comb. Theory B, 2016

2015

On the maximum density of fixed strongly connected subtournaments.

Roberto F. Parente, Cristiane M. Sato

CoRR, 2015

2014

On longest paths and diameter in random apollonian network.

Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung

Random Struct. Algorithms, 2014

On the robustness of random k-cores.

Cristiane M. Sato

Eur. J. Comb., 2014

Arboricity and spanning-tree packing in random graphs with an application to load balancing.

Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Asymptotic enumeration of sparse 2-connected graphs.

Graeme Kemkes, Cristiane M. Sato, Nicholas C. Wormald

Random Struct. Algorithms, 2013

On the Longest Paths and the Diameter in Random Apollonian Networks.

Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung

Electron. Notes Discret. Math., 2013