1 citations · 1 across the 1 of their papers we have counts for
3 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…
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…
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…