Cristiane M. Sato

21 papers A* 1C 1Journal 19
YearRankTypeTitle / Venue / Authors
2026 J jnl
A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem.
Math. Program.
Nathan Benedetto Proença, Marcel K. de Carli Silva, Cristiane M. Sato, Levent Tunçel
2024 J jnl
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs.
CoRR
Fábio Botler, Yan S. Couto, Cristina G. Fernandes, Eder F. de Figueiredo, Renzo Gómez, Vinícius Fernandes dos Santos, Cristiane M. Sato
2024 J jnl
Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans-Williamson Algorithm.
CoRR
Nathan Benedetto Proença, Marcel K. de Carli Silva, Cristiane M. Sato, Levent Tunçel
2023 J jnl
A Primal-Dual Extension of the Goemans-Williamson Algorithm for the Weighted Fractional Cut-Covering Problem.
CoRR
Nathan Benedetto Proença, Marcel Kenji de Carli Silva, Cristiane M. Sato, Levent Tunçel
2019 J jnl
Commute Time as a Method to Explore Brain Functional Connectomes.
Brain Connect.
João Ricardo Sato, Cristiane M. Sato, Marcel Kenji de Carli Silva, Claudinei Eduardo Biazoli Jr.
2019 C conf
Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges.
LAGOS
Carlos Hoppen, Guilherme Oliveira Mota, Roberto F. Parente, Cristiane M. Sato
2019 J jnl
On the Maximum Density of Fixed Strongly Connected Subtournaments.
Electron. J. Comb.
Leonardo Nagami Coregliano, Roberto F. Parente, Cristiane M. Sato
2019 J jnl
Packing Arborescences in Random Digraphs.
SIAM J. Discret. Math.
Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato
2018 J jnl
Arboricity and spanning-tree packing in random graphs.
Random Struct. Algorithms
Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato
2017 J jnl
Packing arborescences in random digraphs.
Electron. Notes Discret. Math.
Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato
2016 J jnl
A transition of limiting distributions of large matchings in random graphs.
J. Comb. Theory B
Pu Gao, Cristiane M. Sato
2016 J jnl
Packing arborescences in random digraphs.
CoRR
Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato
2016 J jnl
Sparse Sums of Positive Semidefinite Matrices.
ACM Trans. Algorithms
Marcel Kenji de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato
2015 J jnl
On the maximum density of fixed strongly connected subtournaments.
CoRR
Roberto F. Parente, Cristiane M. Sato
2014 A* conf
Arboricity and spanning-tree packing in random graphs with an application to load balancing.
SODA
Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato
2014 J jnl
On longest paths and diameter in random apollonian network.
Random Struct. Algorithms
Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung
2014 J jnl
On the robustness of random k-cores.
Eur. J. Comb.
Cristiane M. Sato
2013 J jnl
Asymptotic enumeration of sparse 2-connected graphs.
Random Struct. Algorithms
Graeme Kemkes, Cristiane M. Sato, Nicholas C. Wormald
2013 J jnl
On the Longest Paths and the Diameter in Random Apollonian Networks.
Electron. Notes Discret. Math.
Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung
2012 J jnl
On the robustness of random k-cores
CoRR
Cristiane M. Sato
2011 J jnl
Sparse Sums of Positive Semidefinite Matrices
CoRR
Marcel Kenji de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato