Leandro Tortosa

Orcid: 0000-0002-2562-8123

According to our database1, Leandro Tortosa authored at least 52 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Increasing the Accuracy of a Deep Learning Model for Traffic Accident Severity Prediction by Adding a Temporal Category.
Proceedings of the Second International Conference on Advances in Computing Research, 2024

2023
Explainability techniques applied to road traffic forecasting using Graph Neural Network models.
Inf. Sci., October, 2023

A novel measure to identify influential nodes: Return Random Walk Gravity Centrality.
Inf. Sci., May, 2023

2022
A centrality model for directed graphs based on the Two-Way-Random Path and associated indices for characterizing the nodes.
J. Comput. Sci., 2022

Anew centrality measure in dense networks based on two-way random walk betweenness.
Appl. Math. Comput., 2022

2021
Understanding mobility in Rome by means of a multiplex network with data.
J. Comput. Sci., 2021

A New Methodology to Study Street Accessibility: A Case Study of Avila (Spain).
ISPRS Int. J. Geo Inf., 2021

An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept.
Appl. Math. Comput., 2021

Identifying mobility patterns by means of centrality algorithms in multiplex networks.
Appl. Math. Comput., 2021

2020
Analysis and comparison of centrality measures applied to urban networks with data.
J. Comput. Sci., 2020

2019
An Eigenvector Centrality for Multiplex Networks with Data.
Symmetry, 2019

Extracting Information from an Urban Network by Combining a Visibility Index and a City Data Set.
Symmetry, 2019

Extending the Adapted PageRank Algorithm Centrality to Multiplex Networks with Data Using the PageRank Two-Layer Approach.
Symmetry, 2019

A variant of the current flow betweenness centrality and its application in urban networks.
Appl. Math. Comput., 2019

2018
Combining the Two-Layers PageRank Approach with the APA Centrality in Networks with Data.
ISPRS Int. J. Geo Inf., 2018

An algorithm to compute data diversity index in spatial networks.
Appl. Math. Comput., 2018

2017
Analysis of the Patrimonial Conservation of a Quito Suburb without Altering Its Commercial Structure by Means of a Centrality Measure for Urban Networks.
ISPRS Int. J. Geo Inf., 2017

Measuring urban activities using Foursquare data and network analysis: a case study of Murcia (Spain).
Int. J. Geogr. Inf. Sci., 2017

Quantification and Visualization of a Heritage Conservation in a Quito Neighbourhood (Ecuador).
Proceedings of the Hybrid Artificial Intelligent Systems - 12th International Conference, 2017

2016
Analysing successful public spaces in an urban street network using data from the social networks Foursquare and Twitter.
Appl. Netw. Sci., 2016

New highlights and a new centrality measure based on the Adapted PageRank Algorithm for urban networks.
Appl. Math. Comput., 2016

Studying Successful Public Plazas in the City of Murcia (Spain) Using a Ranking Nodes Algorithm and Foursquare Data.
Proceedings of the Advances in Network Science, 2016

2015
Different Models to Visualise Geolocated City Data from Social Networks.
Proceedings of the 3rd International Conference on Future Internet of Things and Cloud, 2015

2014
Analyzing the commercial activities of a street network by ranking their nodes: a case study in Murcia, Spain.
Int. J. Geogr. Inf. Sci., 2014

A new betweenness centrality measure based on an algorithm for ranking the nodes of a network.
Appl. Math. Comput., 2014

An extension of the noncommutative Bergman's ring with a large number of noninvertible elements.
Appl. Algebra Eng. Commun. Comput., 2014

A Method to Triangulate a Set of Points in the Plane.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

Analyzing Urban Extensions and Its Effects over the Commercial Activity of an Urban Network.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

2013
A Model to Visualize Information in a Complex Streets' Network.
Proceedings of the Distributed Computing and Artificial Intelligence, 2013

2012
Key exchange protocols over noncommutative rings. The case of.
Int. J. Comput. Math., 2012

An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector.
Appl. Math. Comput., 2012

2011
An application of a self-organizing model to the design of urban transport networks.
J. Intell. Fuzzy Syst., 2011

A neural network model to develop actions in urban complex systems represented by 2D meshes.
Int. J. Comput. Math., 2011

On the arithmetic of the endomorphisms ring End(\mathbb<i>Z</i><sub><i>p</i></sub> ×\mathbb<i>Z</i><sub><i>p</i><sup>2</sup></sub>).
Appl. Algebra Eng. Commun. Comput., 2011

2010
A model to simplify 2D triangle meshes with irregular shapes.
Appl. Math. Comput., 2010

A Neural Network Model to Develop Urban Acupuncture.
Proceedings of the Knowledge-Based and Intelligent Information and Engineering Systems, 2010

2009
Analysis and design of a secure key exchange scheme.
Inf. Sci., 2009

Optimizing matrix operations in Z<sub>2</sub> by word packing.
Appl. Math. Lett., 2009

Comparing GNG3D and Quadric Error Metrics Methods to Simplify 3D Meshes.
Proceedings of the GRAPP 2009, 2009

Reducing Urban Concentration Using a Neural Network Model.
Proceedings of the Engineering Applications of Neural Networks, 2009

A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications.
Proceedings of the Applied Algebra, 2009

2008
Analysis and efficiency of the GNG3D algorithm for mesh simplification.
Appl. Math. Comput., 2008

2007
A mesh optimization algorithm based on neural networks.
Inf. Sci., 2007

2006
GNG3D - A Software Tool for Mesh Optimization Based on Neural Networks.
Proceedings of the International Joint Conference on Neural Networks, 2006

2005
An overlapped two-way method for solving tridiagonal linear systems in a BSP computer.
Appl. Math. Comput., 2005

An efficient binary sequence generator with cryptographic applications.
Appl. Math. Comput., 2005

2004
Sequential and parallel synchronous alternating iterative methods.
Math. Comput., 2004

Convergence theorems for parallel alternating iterative methods.
Appl. Math. Comput., 2004

A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system.
Appl. Math. Comput., 2004

2003
A note on the recursive decoupling method for solving tridiagonal linear systems.
Appl. Math. Comput., 2003

A Pseudorandom Bit Generator Based on Block Upper Triangular Matrices.
Proceedings of the Web Engineering, International Conference, 2003

1999
A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix.
J. Parallel Distributed Comput., 1999


  Loading...