1 citations · 1 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
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…
cs.DS2015★ 1 cited
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…