A
Alejandro López-Ortiz
Researcher at University of Waterloo
Publications - 198
Citations - 3856
Alejandro López-Ortiz is an academic researcher from University of Waterloo. The author has contributed to research in topics: Competitive analysis & List update problem. The author has an hindex of 33, co-authored 193 publications receiving 3719 citations. Previous affiliations of Alejandro López-Ortiz include Open Text Corporation & University of New Brunswick.
Papers
More filters
Proceedings Article
Recognition of Triangulation Duals of Simple Polygons With and Without Holes.
TL;DR: The problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon is investigated and a sharp boundary is given between the various tractable and intractable versions of the problem.
Proceedings ArticleDOI
Efficient demand assignment in multi-connected microgrids
TL;DR: Given a set of resource demands in a collection of geographically co-located microgrids that are connected to the central grid and also potentially to each other, each such demand characterized by a power level and a duration is studied.
Book ChapterDOI
List Colouring and Partial List Colouring of Graphs On-line
TL;DR: It is shown that the conjecture for partial list colouring on-line holds for several graph classes, namely claw-free graphs, maximal planar graphs, series-parallel graphs, and chordal graphs.
Book ChapterDOI
Lower bounds for graph exploration using local policies
Aditya Kumar Akash,Sándor P. Fekete,Seoung Kyou Lee,Alejandro López-Ortiz,Daniela Maftuleac,James McLurkin +5 more
TL;DR: Surprisingly, these alternate strategies give worst-case superpolynomial/exponential time for exploration, whereas the least-frequently-visited strategy for edges has a polynomially bounded exploration time, as shown by Cooper et al. (2011).
Posted Content
Orthogonal Query Expansion
TL;DR: Over the last fteen years, web searching has seen tremendous improvements, but one of the main remaining challenges is to satisfy the users’ needs when they provide a poorly formulated query.