11 citations · 20 across the 14 of their papers we have counts for
17 papers
Interruptible Algorithms for Multiproblem Solving
Spyros Angelopoulos, Alejandro Lopez-Ortiz
In this paper we address the problem of designing an interruptible system in a setting in which problem instances, all equally important, must be solved concurrently. The syste…
Recognition of Triangulation Duals of Simple Polygons With and Without Holes
Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particu…
Lower Bounds for Graph Exploration Using Local Policies
Aditya Kumar Akash, Sandor P. Fekete, Seoung Kyou Lee +3
We give lower bounds for various natural node- and edge-based local strategies for exploring a graph. We consider this problem both in the setting of an arbitrary graph as well as…
Arbitrary Overlap Constraints in Graph Packing Problems
Alejandro López-Ortiz, Jazmín Romero
In earlier versions of the community discovering problem, the overlap between communities was restricted by a simple count upper-bound [17,5,11,8]. In this paper, we introduce the…
List Colouring Big Graphs On-Line
Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac
In this paper, we investigate the problem of graph list colouring in the on-line setting. We provide several results on paintability of graphs in the model introduced by Schauz [13…
Algorithms in the Ultra-Wide Word Model
Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson +1
The effective use of parallel computing resources to speed up algorithms in current multi-core parallel architectures remains a difficult challenge, with ease of programming playin…
Local Policies for Efficiently Patrolling a Triangulated Region by a Robot Swarm
Daniela Maftuleac, Seoung Kyou Lee, Sandor P. Fekete +3
We present and analyze methods for patrolling an environment with a distributed swarm of robots. Our approach uses a physical data structure - a distributed triangulation of the wo…
Optimal Distributed Searching in the Plane with and without Uncertainty
Alejandro Lopez-Ortiz, Daniela Maftuleac
We consider the problem of multiple agents or robots searching for a target in the plane. This is motivated by Search and Rescue operations (SAR) in the high seas which in the past…
Efficient Online Strategies for Renting Servers in the Cloud
Shahin Kamali, Alejandro López-Ortiz
In Cloud systems, we often deal with jobs that arrive and depart in an online manner. Upon its arrival, a job should be assigned to a server. Each job has a size which defines the…
An All-Around Near-Optimal Solution for the Classic Bin Packing Problem
Shahin Kamali, Alejandro López-Ortiz
In this paper we present the first algorithm with optimal average-case and close-to-best known worst-case performance for the classic on-line problem of bin packing. It has long be…
On the List Update Problem with Advice
Joan Boyar, Shahin Kamali, Kim S. Larsen +1
We study the online list update problem under the advice model of computation. Under this model, an online algorithm receives partial information about the unknown parts of the inp…
On Advice Complexity of the k-server Problem under Sparse Metrics
Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz
We consider the k-server problem under the advice model of computation when the underlying metric space is sparse. On one side, we show that an advice of size Ω(n) is required to o…
Online Bin Packing with Advice
Joan Boyar, Shahin Kamali, Kim S. Larsen +1
We consider the online bin packing problem under the advice complexity model where the 'online constraint' is relaxed and an algorithm receives partial information about the future…
FIFO Queueing Policies for Packets with Heterogeneous Processing
Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko +2
We consider the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can…
Balancing Work and Size with Bounded Buffers
Kirill Kogan, Alejandro Lopez-Ortiz, Sergey I. Nikolenko +2
We consider the fundamental problem of managing a bounded size queue buffer where traffic consists of packets of varying size, where each packet requires several rounds of processi…
Orthogonal Query Expansion
Margareta Ackerman, David Loker, Alejandro Lopez-Ortiz
Over the last fifteen years, web searching has seen tremendous improvements. Starting from a nearly random collection of matching pages in 1995, today, search engines tend to satis…
Some New Equiprojective Polyhedra
Masud Hasan, Mohammad Monoar Hossain, Alejandro López-Ortiz +3
A convex polyhedron is -equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of are -gon for some fixed value of …