default search action
Leandro Tortosa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Luis Pérez-Sala
, Manuel Curado, Leandro Tortosa, Jose F. Vicent:
Increasing the Accuracy of a Deep Learning Model for Traffic Accident Severity Prediction by Adding a Temporal Category. ACR 2024: 113-124 - 2023
- [j39]Manuel Curado
A novel measure to identify influential nodes: Return Random Walk Gravity Centrality. Inf. Sci. 628: 177-195 (2023) - [j38]Javier García-Sigüenza
Explainability techniques applied to road traffic forecasting using Graph Neural Network models. Inf. Sci. 645: 119320 (2023) - 2022
- [j37]Manuel Curado
Anew centrality measure in dense networks based on two-way random walk betweenness. Appl. Math. Comput. 412: 126560 (2022) - [j36]Manuel Curado
A centrality model for directed graphs based on the Two-Way-Random Path and associated indices for characterizing the nodes. J. Comput. Sci. 63: 101819 (2022) - 2021
- [j35]Leandro Tortosa
An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept. Appl. Math. Comput. 392: 125676 (2021) - [j34]Manuel Curado
Identifying mobility patterns by means of centrality algorithms in multiplex networks. Appl. Math. Comput. 406: 126269 (2021) - [j33]Manuel Curado
A New Methodology to Study Street Accessibility: A Case Study of Avila (Spain). ISPRS Int. J. Geo Inf. 10(7): 491 (2021) - [j32]Manuel Curado
Understanding mobility in Rome by means of a multiplex network with data. J. Comput. Sci. 51: 101305 (2021) - 2020
- [j31]Manuel Curado
Analysis and comparison of centrality measures applied to urban networks with data. J. Comput. Sci. 43: 101127 (2020)
2010 – 2019
- 2019
- [j30]Taras Agryzkov, Leandro Tortosa, José-Francisco Vicent
A variant of the current flow betweenness centrality and its application in urban networks. Appl. Math. Comput. 347: 600-615 (2019) - [j29]Taras Agryzkov, Manuel Curado
Extending the Adapted PageRank Algorithm Centrality to Multiplex Networks with Data Using the PageRank Two-Layer Approach. Symmetry 11(2): 284 (2019) - [j28]Taras Agryzkov, José Luis Oliver, Leandro Tortosa
Extracting Information from an Urban Network by Combining a Visibility Index and a City Data Set. Symmetry 11(5): 704 (2019) - [j27]Francisco Pedroche
An Eigenvector Centrality for Multiplex Networks with Data. Symmetry 11(6): 763 (2019) - 2018
- [j26]Taras Agryzkov, Leandro Tortosa, José-Francisco Vicent
An algorithm to compute data diversity index in spatial networks. Appl. Math. Comput. 337: 63-75 (2018) - [j25]Taras Agryzkov, Francisco Pedroche
Combining the Two-Layers PageRank Approach with the APA Centrality in Networks with Data. ISPRS Int. J. Geo Inf. 7(12): 480 (2018) - 2017
- [j24]Taras Agryzkov, Pablo Martí
Measuring urban activities using Foursquare data and network analysis: a case study of Murcia (Spain). Int. J. Geogr. Inf. Sci. 31(1) (2017) - [j23]Taras Agryzkov, José Luis Oliver
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. 6(7): 215 (2017) - [c12]Taras Agryzkov, José Luis Oliver
Quantification and Visualization of a Heritage Conservation in a Quito Neighbourhood (Ecuador). HAIS 2017: 367-378 - 2016
- [j22]Taras Agryzkov, Leandro Tortosa
New highlights and a new centrality measure based on the Adapted PageRank Algorithm for urban networks. Appl. Math. Comput. 291: 14-29 (2016) - [j21]Taras Agryzkov, Pablo Martí, Almudena Nolasco-Cirugeda
Analysing successful public spaces in an urban street network using data from the social networks Foursquare and Twitter. Appl. Netw. Sci. 1: 12 (2016) - [c11]Taras Agryzkov, Pablo Martí
Studying Successful Public Plazas in the City of Murcia (Spain) Using a Ranking Nodes Algorithm and Foursquare Data. NetSci-X 2016: 161-168 - 2015
- [c10]Taras Agryzkov, Francisco Álvarez, Leticia Serrano-Estrada
Different Models to Visualise Geolocated City Data from Social Networks. FiCloud 2015: 687-692 - 2014
- [j20]Joan-Josep Climent
An extension of the noncommutative Bergman's ring with a large number of noninvertible elements. Appl. Algebra Eng. Commun. Comput. 25(5): 347-361 (2014) - [j19]Taras Agryzkov, José Luis Oliver
A new betweenness centrality measure based on an algorithm for ranking the nodes of a network. Appl. Math. Comput. 244: 467-478 (2014) - [j18]Taras Agryzkov, José Luis Oliver
Analyzing the commercial activities of a street network by ranking their nodes: a case study in Murcia, Spain. Int. J. Geogr. Inf. Sci. 28(3): 479-495 (2014) - [c9]Taras Agryzkov, José Luis Oliver
Analyzing Urban Extensions and Its Effects over the Commercial Activity of an Urban Network. ICCSA (4) 2014: 140-152 - [c8]Taras Agryzkov, José Luis Oliver
A Method to Triangulate a Set of Points in the Plane. ICCSA (2) 2014: 330-341 - 2013
- [c7]Taras Agryzkov, José Luis Oliver
A Model to Visualize Information in a Complex Streets' Network. DCAI 2013: 129-136 - 2012
- [j17]Taras Agryzkov, José Luis Oliver
An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector. Appl. Math. Comput. 219(4): 2186-2193 (2012) - [j16]Joan-Josep Climent
Key exchange protocols over noncommutative rings. The case of. Int. J. Comput. Math. 89(13-14): 1753-1763 (2012) - 2011
- [j15]Joan-Josep Climent
On the arithmetic of the endomorphisms ring End(\mathbbZp ×\mathbbZp2). Appl. Algebra Eng. Commun. Comput. 22(2): 91-108 (2011) - [j14]José Luis Oliver
A neural network model to develop actions in urban complex systems represented by 2D meshes. Int. J. Comput. Math. 88(16): 3361-3379 (2011) - [j13]José Luis Oliver
An application of a self-organizing model to the design of urban transport networks. J. Intell. Fuzzy Syst. 22(2-3): 141-154 (2011) - 2010
- [j12]Leandro Tortosa
A model to simplify 2D triangle meshes with irregular shapes. Appl. Math. Comput. 216(10): 2937-2946 (2010) - [c6]Leandro Tortosa, José-Francisco Vicent
A Neural Network Model to Develop Urban Acupuncture. KES (1) 2010: 31-40
2000 – 2009
- 2009
- [j11]Rafael Álvarez
Optimizing matrix operations in Z2 by word packing. Appl. Math. Lett. 22(2): 242-244 (2009) - [j10]Rafael Álvarez
Analysis and design of a secure key exchange scheme. Inf. Sci. 179(12): 2014-2021 (2009) - [c5]Rafael Álvarez
A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications. AAECC 2009: 117-126 - [c4]Leandro Tortosa, José-Francisco Vicent
Reducing Urban Concentration Using a Neural Network Model. EANN 2009: 143-152 - [c3]Rafael Álvarez, Leandro Tortosa, José-Francisco Vicent, Antonio Zamora:
Comparing GNG3D and Quadric Error Metrics Methods to Simplify 3D Meshes. GRAPP 2009: 99-102 - 2008
- [j9]José-Vicente Noguera, Leandro Tortosa
Analysis and efficiency of the GNG3D algorithm for mesh simplification. Appl. Math. Comput. 197(1): 29-40 (2008) - 2007
- [j8]Rafael Álvarez
A mesh optimization algorithm based on neural networks. Inf. Sci. 177(23): 5347-5364 (2007) - 2006
- [c2]Rafael Álvarez, Jose Noguera, Leandro Tortosa, Antonio Zamora:
GNG3D - A Software Tool for Mesh Optimization Based on Neural Networks. IJCNN 2006: 4005-4012 - 2005
- [j7]Joan-Josep Climent
An overlapped two-way method for solving tridiagonal linear systems in a BSP computer. Appl. Math. Comput. 161(2): 475-500 (2005) - [j6]Rafael Álvarez
An efficient binary sequence generator with cryptographic applications. Appl. Math. Comput. 167(1): 16-27 (2005) - 2004
- [j5]Joan-Josep Climent
Convergence theorems for parallel alternating iterative methods. Appl. Math. Comput. 148(2): 497-517 (2004) - [j4]Joan-Josep Climent
A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system. Appl. Math. Comput. 159(2): 459-484 (2004) - [j3]Joan-Josep Climent
Sequential and parallel synchronous alternating iterative methods. Math. Comput. 73(246): 691-717 (2004) - 2003
- [j2]Joan-Josep Climent
A note on the recursive decoupling method for solving tridiagonal linear systems. Appl. Math. Comput. 140(1): 159-164 (2003) - [c1]Rafael Álvarez, Joan-Josep Climent, Leandro Tortosa, Antonio Zamora:
A Pseudorandom Bit Generator Based on Block Upper Triangular Matrices. ICWE 2003: 299-300
1990 – 1999
- 1999
- [j1]Joan-Josep Climent
A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix. J. Parallel Distributed Comput. 59(3): 423-444 (1999)
Coauthor Index
aka: Jose F. Vicent
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-10-07 21:24 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: