Roberto Cruz

Orcid: 0000-0002-1645-0386

According to our database1, Roberto Cruz authored at least 26 papers between 1999 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Local vertex energy of brooms and double-star trees.
Comput. Appl. Math., July, 2026

Generalistic or Specific Embeddings, Which is Better? An Empirical Study on Search for Clinical Coding in Non-English Languages.
CoRR, May, 2026

MDIA: A Multi-Agent Diagnostic Intelligence Pipeline on HealthBench Professional.
CoRR, May, 2026

Isomeric hexagonal systems with minimum number of bay regions.
Appl. Math. Comput., 2026

2025
Vertex-degree function index on oriented graphs.
Comput. Appl. Math., February, 2025

Extreme hollow hexagons with respect to the Mostar index.
Art Discret. Appl. Math., 2025

2024
Two-Matchings with Respect to the General Sum-Connectivity Index of Trees.
Axioms, 2024

2022
Hosoya index of VDB-weighted graphs.
Discret. Appl. Math., 2022

Anacondensed hexagonal systems.
Appl. Math. Comput., 2022

Vertex-degree-based topological indices of oriented trees.
Appl. Math. Comput., 2022

2021
The balanced double star has maximum exponential second Zagreb index.
J. Comb. Optim., 2021

Sombor index of trees with at most three branch vertices.
Appl. Math. Comput., 2021

Sombor index of chemical graphs.
Appl. Math. Comput., 2021

2020
Trees with maximum exponential Randić index.
Discret. Appl. Math., 2020

Extremal values of vertex-degree-based topological indices of chemical trees.
Appl. Math. Comput., 2020

2019
Maximal Augmented Zagreb Index of Trees With at Most Three Branching Vertices.
IEEE Access, 2019

2016
On Well-Covered, Vertex Decomposable and Cohen-Macaulay Graphs.
Electron. J. Comb., 2016

2015
Vertex-degree-based topological indices over starlike trees.
Discret. Appl. Math., 2015

2014
Wiener index of Eulerian graphs.
Discret. Appl. Math., 2014

Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units.
Proceedings of the IEEE International Conference on Electro/Information Technology, 2014

2013
Parallelizing an algorithm to decide if a bipartite graph is shellable.
Proceedings of the IEEE International Conference on Electro-Information Technology , 2013

Parallelizing a heuristic for the Maximum Clique Problem on GPUs and clusters of workstations.
Proceedings of the IEEE International Conference on Electro-Information Technology , 2013

2005
Upper bound on the non-colorability threshold of the 2+p-COL problem.
Electron. Notes Discret. Math., 2005

2001
A parallelization of a heuristic for the maximum Clique problem.
J. Comput. Sci. Coll., 2001

1999
Variable Selection by Recurrent Neural Networks. Application in Structure Activity Relationship Study of Cephalosporins.
Proceedings of the Engineering Applications of Bio-Inspired Artificial Neural Networks, 1999

Search of hidden properties in sensor data using recurrent neural networks.
Proceedings of the Data Mining and Knowledge Discovery: Theory, 1999


  Loading...