default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoberto Cruz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Roberto Cruz
, Mateo Lopez, Juan Rada:
Two-Matchings with Respect to the General Sum-Connectivity Index of Trees. Axioms 13(10): 658 (2024)- 2022
- [j13]Roberto Cruz, Frank Duque, Juan Rada:
Anacondensed hexagonal systems. Appl. Math. Comput. 418: 126798 (2022) - [j12]Sergio Bermudo, Roberto Cruz, Juan Rada:
Vertex-degree-based topological indices of oriented trees. Appl. Math. Comput. 433: 127395 (2022) - [j11]Roberto Cruz, Ivan Gutman, Juan Rada:
Hosoya index of VDB-weighted graphs. Discret. Appl. Math. 317: 18-25 (2022) - 2021
- [j10]Roberto Cruz, Ivan Gutman, Juan Rada:
Sombor index of chemical graphs. Appl. Math. Comput. 399: 126018 (2021) - [j9]Roberto Cruz, Juan Rada, José María Sigarreta:
Sombor index of trees with at most three branch vertices. Appl. Math. Comput. 409: 126414 (2021) - [j8]Roberto Cruz, Juan Daniel Monsalve, Juan Rada:
The balanced double star has maximum exponential second Zagreb index. J. Comb. Optim. 41(2): 544-552 (2021) - 2020
- [j7]Roberto Cruz, Juan Monsalve, Juan Rada:
Extremal values of vertex-degree-based topological indices of chemical trees. Appl. Math. Comput. 380: 125281 (2020) - [j6]Roberto Cruz, Juan Monsalve, Juan Rada:
Trees with maximum exponential Randić index. Discret. Appl. Math. 283: 634-643 (2020)
2010 – 2019
- 2019
- [j5]Roberto Cruz, Juan Daniel Monsalve, Juan Rada:
Maximal Augmented Zagreb Index of Trees With at Most Three Branching Vertices. IEEE Access 7: 146652-146661 (2019) - 2016
- [j4]Iván D. Castrillón, Roberto Cruz, Enrique Reyes:
On Well-Covered, Vertex Decomposable and Cohen-Macaulay Graphs. Electron. J. Comb. 23(2): 2 (2016) - 2015
- [j3]Clara Betancur, Roberto Cruz, Juan Rada:
Vertex-degree-based topological indices over starlike trees. Discret. Appl. Math. 185: 18-25 (2015) - 2014
- [j2]Ivan Gutman, Roberto Cruz, Juan Rada:
Wiener index of Eulerian graphs. Discret. Appl. Math. 162: 247-250 (2014) - [c5]Christian Trefftz, Andrés Santamaría-Galvis, Roberto Cruz:
Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units. EIT 2014: 100-102 - 2013
- [c4]Roberto Cruz, Nancy Lopez, Christian Trefftz:
Parallelizing a heuristic for the Maximum Clique Problem on GPUs and clusters of workstations. EIT 2013: 1-6 - [c3]Andrés Santamaría-Galvis, Roberto Cruz, John Willian Branch, Christian Trefftz:
Parallelizing an algorithm to decide if a bipartite graph is shellable. EIT 2013: 1-3
2000 – 2009
- 2005
- [j1]Roberto Cruz:
Upper bound on the non-colorability threshold of the 2+p-COL problem. Electron. Notes Discret. Math. 19: 17-23 (2005)
1990 – 1999
- 1999
- [c2]Lissette Lemus del Cueto, Nancy Lopez, Luis J. Barrios, Roberto Cruz:
Search of hidden properties in sensor data using recurrent neural networks. Data Mining and Knowledge Discovery: Theory, Tools, and Technology 1999: 92-101 - [c1]Nancy Lopez, Roberto Cruz, Belsis Llorente:
Variable Selection by Recurrent Neural Networks. Application in Structure Activity Relationship Study of Cephalosporins. IWANN (2) 1999: 497-505
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-11-07 20:29 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:
