8 citations · 18 across the 5 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021
Two-Class (r,k)-Coloring: Coloring with Service Guarantees
Pál András Papp, Roland Schmid, Valentin Stoppiello +1
This paper introduces the Two-Class (,)-Coloring problem: Given a fixed number of colors, such that only of these colors allow conflicts, what is the minimal numb…
cs.CC2020★ 6 cited
On the Hardness of Red-Blue Pebble Games
Pál András Papp, Roger Wattenhofer
Red-blue pebble games model the computation cost of a two-level memory hierarchy. We present various hardness results in different red-blue pebbling variants, with a focus on the o…