4 citations · 11 across the 4 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cs.DS2006
Power-aware scheduling for makespan and flow
David P. Bunde
We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, w…
math.CO2006★ 4 cited
Parity Edge-Coloring of Graphs
David P. Bunde, Kevin Milans, Douglas B. West +1
In a graph whose edges are colored, a parity walk is a walk that uses each color an even number of times. The parity edge chromatic number p(G) of a graph G is the least k so that…