1 | -- | 12 | Christian Glaßer, Steffen Reith, Heribert Vollmer. The complexity of base station positioning in cellular networks |
13 | -- | 25 | Jirí Fiala, Riste Skrekovski. Generalized list T-colorings of cycles |
27 | -- | 48 | Therese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood. Balanced vertex-orderings of graphs |
49 | -- | 61 | Hark-Chin Hwang, Kangbok Lee, Soo Y. Chang. The effect of machine availability on the worst-case performance of LPT |
63 | -- | 87 | Anis Gharbi, Mohamed Haouari. Optimal parallel machines scheduling with availability constraints |
89 | -- | 105 | Keith Edwards, Graham Farr. On monochromatic component size for improper colourings |
107 | -- | 125 | Thomas Erlebach, Klaus Jansen. Conversion of coloring algorithms into maximum weight independent set algorithms |
127 | -- | 134 | Shuguang Li, Guojun Li, Shaoqiang Zhang. Minimizing makespan with release times on identical parallel batching machines |