◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Felipe Lillo

2 papers hereh-index 431 citations12 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author2

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.OH1
  • math.CO1

identity via Semantic Scholar / OpenAlex

most citedPartial order approach to compute shortest paths in multimodal networks

7 citations · 7 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2011

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

Andrew Ensor, Felipe Lillo

A weighted coloured-edge graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer network…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.