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)

Asymptotic enumeration of sparse 2-connected graphs. - Graeme Kemkes; Cristiane M. Sato; Nicholas C. Wormald (Random Struct. Algorithms, 2013)

Arboricity and spanning-tree packing in random graphs with an application to load balancing. - Pu Gao; Xavier Pérez-Giménez; Cristiane M. Sato (SODA, 2014)

On the robustness of random k-cores. - Cristiane M. Sato (Eur. J. Comb., 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 maximum density of fixed strongly connected subtournaments. - Roberto F. Parente; Cristiane M. Sato (CoRR, 2015)

A transition of limiting distributions of large matchings in random graphs. - Pu Gao; Cristiane M. Sato (J. Comb. Theory B, 2016)

Sparse Sums of Positive Semidefinite Matrices. - Marcel Kenji de Carli Silva; Nicholas J. A. Harvey; Cristiane M. Sato (ACM Trans. Algorithms, 2016)

Packing arborescences in random digraphs. - Carlos Hoppen; Roberto F. Parente; Cristiane M. Sato (Electron. Notes Discret. Math., 2017)

Arboricity and spanning-tree packing in random graphs. - Pu Gao; Xavier Pérez-Giménez; Cristiane M. Sato (Random Struct. Algorithms, 2018)

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)

On the Maximum Density of Fixed Strongly Connected Subtournaments. - Leonardo Nagami Coregliano; Roberto F. Parente; Cristiane M. Sato (Electron. J. Comb., 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 (LAGOS, 2019)

A Primal-Dual Extension of the Goemans-Williamson Algorithm for the Weighted Fractional Cut-Covering Problem. - Nathan Benedetto Proença; Marcel Kenji de Carli Silva; Cristiane M. Sato; Levent Tunçel (CoRR, 2023)

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)