Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
Ioannis Caragiannis, Aleksei V. Fishkin, Christos ...
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...