José Luis Palacios

According to our database1, José Luis Palacios authored at least 19 papers between 1994 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the Moments of the Number of Hires in the Assistant Hiring Algorithm.
Algorithms, February, 2023

2021
Kemeny's constant and Kirchhoffian indices for conjoined highly symmetric graphs.
Discret. Appl. Math., 2021

Kemeny's constant and the Kirchhoff index for the cluster of highly symmetric graphs.
Appl. Math. Comput., 2021

2020
On the equivalence of cylinder tilings and planar electric networks.
Discret. Appl. Math., 2020

2019
Kirchhoffian indices for weighted digraphs.
Discret. Appl. Math., 2019

Lower bounds for the geometric-arithmetic index of graphs with pendant and fully connected vertices.
Discret. Appl. Math., 2019

Correction to "Bounds for the augmented Zagreb and the atom-bond connectivity indices".
Appl. Math. Comput., 2019

2018
Lower bounds for the Laplacian energy of bipartite graphs.
Discret. Appl. Math., 2018

2017
Bounds for the augmented Zagreb and the atom-bond connectivity indices.
Appl. Math. Comput., 2017

2015
Genetic learning of the membership functions for mining fuzzy association rules from low quality data.
Inf. Sci., 2015

On the Kirchhoff index of graphs with diameter 2.
Discret. Appl. Math., 2015

New bounds of degree-based topological indices for some classes of c-cyclic graphs.
Discret. Appl. Math., 2015

2012
Eliciting a human understandable model of ice adhesion strength for rotor blade leading edge materials from uncertain experimental data.
Expert Syst. Appl., 2012

2004
Random Walks and Chemical Graph Theory.
J. Chem. Inf. Model., 2004

2003
Going around Randomly in Circles: 10881.
Am. Math. Mon., 2003

2002
On mixing times for stratified walks on the d-cube.
Random Struct. Algorithms, 2002

2001
Problem 10881.
Am. Math. Mon., 2001

1997
A Markov Chain Approach to Baseball.
Oper. Res., 1997

1994
Expected Hitting and Cover Times of Random Walks on Some Special Graphs.
Random Struct. Algorithms, 1994


  Loading...