default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCristiane M. Sato
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Nathan Benedetto Proença, Marcel K. de Carli Silva, Cristiane M. Sato, Levent Tunçel:
Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans-Williamson Algorithm. CoRR abs/2406.18670 (2024)- 2023
- [i5]Nathan Benedetto Proença, Marcel Kenji de Carli Silva, Cristiane M. Sato, Levent Tunçel
:
A Primal-Dual Extension of the Goemans-Williamson Algorithm for the Weighted Fractional Cut-Covering Problem. CoRR abs/2311.15346 (2023)
2010 – 2019
- 2019
- [j11]João Ricardo Sato, Cristiane M. Sato, Marcel Kenji de Carli Silva, Claudinei Eduardo Biazoli Jr.:
Commute Time as a Method to Explore Brain Functional Connectomes. Brain Connect. 9(2): 155-161 (2019) - [j10]Leonardo Nagami Coregliano, Roberto F. Parente, Cristiane M. Sato:
On the Maximum Density of Fixed Strongly Connected Subtournaments. Electron. J. Comb. 26(1): 1 (2019) - [j9]Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato:
Packing Arborescences in Random Digraphs. SIAM J. Discret. Math. 33(1): 438-453 (2019) - [c2]Carlos Hoppen, Guilherme Oliveira Mota, Roberto F. Parente, Cristiane M. Sato:
Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges. LAGOS 2019: 535-544 - 2018
- [j8]Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato:
Arboricity and spanning-tree packing in random graphs. Random Struct. Algorithms 52(3): 495-535 (2018) - 2017
- [j7]Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato:
Packing arborescences in random digraphs. Electron. Notes Discret. Math. 61: 615-621 (2017) - 2016
- [j6]Pu Gao, Cristiane M. Sato:
A transition of limiting distributions of large matchings in random graphs. J. Comb. Theory B 116: 57-86 (2016) - [j5]Marcel Kenji de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato:
Sparse Sums of Positive Semidefinite Matrices. ACM Trans. Algorithms 12(1): 9:1-9:17 (2016) - [i4]Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato:
Packing arborescences in random digraphs. CoRR abs/1605.05764 (2016) - 2015
- [i3]Roberto F. Parente, Cristiane M. Sato:
On the maximum density of fixed strongly connected subtournaments. CoRR abs/1505.05200 (2015) - 2014
- [j4]Cristiane M. Sato:
On the robustness of random k-cores. Eur. J. Comb. 41: 163-182 (2014) - [j3]Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung:
On longest paths and diameter in random apollonian network. Random Struct. Algorithms 45(4): 703-725 (2014) - [c1]Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato:
Arboricity and spanning-tree packing in random graphs with an application to load balancing. SODA 2014: 317-326 - 2013
- [j2]Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung:
On the Longest Paths and the Diameter in Random Apollonian Networks. Electron. Notes Discret. Math. 43: 355-365 (2013) - [j1]Graeme Kemkes, Cristiane M. Sato, Nicholas C. Wormald:
Asymptotic enumeration of sparse 2-connected graphs. Random Struct. Algorithms 43(3): 354-376 (2013) - 2012
- [i2]Cristiane M. Sato:
On the robustness of random k-cores. CoRR abs/1203.2209 (2012) - 2011
- [i1]Marcel Kenji de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato:
Sparse Sums of Positive Semidefinite Matrices. CoRR abs/1107.0088 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-23 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
