21 citations · 120 across the 54 of their papers we have counts for
Showing 2013 · cs.DSShow all
3 papers · 2 filters
cs.DS2013
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter +1
We explore the machine-minimizing job scheduling problem, which has a rich history in the line of research, under an online setting. We consider systems with arbitrary job arrival…
cs.DS2013
Online Power-Managing Strategy with Hard Real-Time Guarantees
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee +2
We consider the problem of online dynamic power management that provides hard real-time guarantees. In this problem, each of the given jobs is associated with an arrival time, a de…
cs.DS2013
Testing Mutual Duality of Planar Graphs
Patrizio Angelini, Thomas Bläsius, Ignaz Rutter
We introduce and study the problem \mpd, which asks for two planar graphs and whether can be embedded such that its dual is isomorphic to . Our algorithmic m…