default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos A. Alfaro
Person information
- affiliation: Banco de México, Mexico City, Mexico
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j13]Aida Abiad
, Carlos A. Alfaro, Ralihe R. Villagrán:
Distinguishing graphs by their spectra, Smith normal forms and complements. Appl. Math. Comput. 490: 129198 (2025)- 2024
- [j12]Carlos A. Alfaro, Octavio Zapata:
The degree-distance and transmission-adjacency matrices. Comput. Appl. Math. 43(6): 351 (2024) - 2022
- [j11]Carlos A. Alfaro, Sergio L. Perez, Carlos E. Valencia, Marcos Cesar Vargas Magana:
The assignment problem revisited. Optim. Lett. 16(5): 1531-1548 (2022) - 2021
- [j10]Carlos A. Alfaro, Ralihe R. Villagrán:
The structure of sandpile groups of outerplanar graphs. Appl. Math. Comput. 395: 125861 (2021) - [j9]Carlos A. Alfaro, Ralihe R. Villagrán:
Corrigendum to "The structure of sandpile groups of outerplanar graphs" [Applied Mathematics and Computation 395 (2021) 125861]. Appl. Math. Comput. 398: 126022 (2021) - [j8]Aida Abiad, Carlos A. Alfaro:
Enumeration of cospectral and coinvariant graphs. Appl. Math. Comput. 408: 126348 (2021) - 2020
- [j7]Carlos A. Alfaro, Gabriela Araujo-Pardo, Christian Rubio-Montiel, Adrián Vázquez-Ávila:
On transversal and 2-packing numbers in uniform linear systems. AKCE Int. J. Graphs Comb. 17(1): 335-341 (2020)
2010 – 2019
- 2019
- [j6]Carlos A. Alfaro, Jephian C.-H. Lin:
Critical ideals, minimum rank and zero forcing number. Appl. Math. Comput. 358: 305-313 (2019) - 2018
- [j5]Carlos A. Alfaro, Alan Arroyo, Marek Dernár, Bojan Mohar:
The Crossing Number of the Cone of a Graph. SIAM J. Discret. Math. 32(3): 2080-2093 (2018) - [c2]Carlos E. Valencia, Carlos A. Alfaro, Francisco Javier Zaragoza Martínez, Marcos Cesar Vargas Magana, Sergio Luis Pérez-Pérez:
Outperforming Several Heuristics for the Multidimensional Assignment Problem. CCE 2018: 1-6 - [i1]Carlos A. Alfaro, Sergio L. Perez, Carlos E. Valencia, Marcos C. Vargas:
The equivalence between two classic algorithms for the assignment problem. CoRR abs/1810.03562 (2018) - 2017
- [j4]Carlos A. Alfaro, Hugo Corrales, Carlos E. Valencia:
Critical ideals of signed graphs with twin vertices. Adv. Appl. Math. 86: 99-131 (2017) - 2016
- [c1]Carlos A. Alfaro, Alan Arroyo, Marek Dernár, Bojan Mohar:
The Crossing Number of the Cone of a Graph. GD 2016: 427-438 - 2015
- [j3]Carlos A. Alfaro, Carlos E. Valencia:
Graphs with few trivial critical ideals. Electron. Notes Discret. Math. 50: 391-396 (2015) - 2014
- [j2]Carlos A. Alfaro, Burcu Aydin, Carlos E. Valencia, Elizabeth Bullitt, Alim Ladha:
Dimension reduction in principal component analysis for trees. Comput. Stat. Data Anal. 74: 157-179 (2014) - [j1]Carlos A. Alfaro, Carlos E. Valencia:
Graphs with two trivial critical ideals. Discret. Appl. Math. 167: 33-44 (2014)
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-12-02 22:35 CET 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:
