Felipe Lillo

According to our database, Felipe Lillo authored at least 5 papers between 2011 and 2018.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2018

On the Tractability of Shortest Path Problems in Weighted Edge-Coloured Graphs.

Andrew Ensor, Felipe Lillo

J. Syst. Sci. Complex., 2018

2017

Dynamics of global remittances: A graph-based analysis.

Felipe Lillo, Leidy García, Valentín Santander

Math. Soc. Sci., 2017

2016

Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems.

Andrew Ensor, Felipe Lillo

Asia Pac. J. Oper. Res., 2016

2011

Partial order approach to compute shortest paths in multimodal networks

Andrew Ensor, Felipe Lillo

CoRR, 2011

Counting the Number of Minimal Paths in Weighted Coloured-Edge Graphs

Andrew Ensor, Felipe Lillo

CoRR, 2011