We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
We prove that the acyclic chromatic index a (G) 6 for all graphs with girth at least 9. We extend the same method to obtain a bound of 4.52 with the girth requirement g 220. We al...
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be p...
Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin...
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...