default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCésar Hernández-Vélez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j9]Frank Duque
, Ruy Fabila Monroy, César Hernández-Vélez, Carlos Hidalgo-Toscano:
Counting the number of crossings in geometric graphs. Inf. Process. Lett. 165: 106028 (2021)
2010 – 2019
- 2019
- [j8]Cristina G. Fernandes, César Hernández-Vélez, José Coelho de Pina, Jorge Luis Ramírez Alfonsín:
Counting Hamiltonian Cycles in the Matroid Basis Graph. Graphs Comb. 35(2): 539-550 (2019) - [i2]Frank Duque, Ruy Fabila Monroy, César Hernández-Vélez, Carlos Hidalgo-Toscano:
Counting the Number of Crossings in Geometric Graphs. CoRR abs/1904.11037 (2019) - 2018
- [j7]Frank Duque, Hernán González-Aguilar, César Hernández-Vélez, Jesús Leaños, Carolina Medina:
The Complexity of Computing the Cylindrical and the t-Circle Crossing Number of a Graph. Electron. J. Comb. 25(2): 2 (2018) - 2017
- [j6]César Hernández-Vélez, Jesús Leaños, Gelasio Salazar:
On the Pseudolinear Crossing Number. J. Graph Theory 84(3): 297-310 (2017) - 2016
- [j5]Cristina G. Fernandes, César Hernández-Vélez, Orlando Lee, José Coelho de Pina:
Spanning trees with nonseparating paths. Discret. Math. 339(1): 365-374 (2016) - 2014
- [j4]César Hernández-Vélez, Carolina Medina, Gelasio Salazar:
The Optimal Drawings of $K_{5, n}$. Electron. J. Comb. 21(4): 4 (2014) - 2013
- [j3]Laurent Beaudou, César Hernández-Vélez, Gelasio Salazar:
Making a Graph Crossing-Critical by Multiplying its Edges. Electron. J. Comb. 20(1): 61 (2013) - 2012
- [j2]César Hernández-Vélez, Gelasio Salazar, Robin Thomas:
Nested cycles in large triangulations and crossing-critical graphs. J. Comb. Theory B 102(1): 86-92 (2012) - [i1]César Hernández-Vélez, Carolina Medina, Gelasio Salazar:
The optimal drawings of K_{5,n}. CoRR abs/1210.1988 (2012) - 2011
- [j1]Mario Cetina, César Hernández-Vélez, Jesús Leaños, C. Villalobos:
Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K30. Discret. Math. 311(16): 1646-1657 (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-06-10 21:23 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:
