Accepted Papers

  1. Hamiltonian decomposition of some interconnection networks
    Hai-zhong Shi and Pan-feng Niu

  2. On open rectangle-of-influence drawings of planar graphs
    Huaming Zhang and Milind Vaidya

  3. Optimal algorithms for the online time series search problem
    Yinfeng Xu, Wenming Zhang, and Feifeng Zheng

  4. Scheduling jobs on a single machine with inventory operations
    Bao-Qiang Fan and Guo-Chun Tang

  5. An effective hybrid algorithm for the circles packing problem
    Liu Jingfa

  6. Size-constrained tree partitioning: a story on approximation algorithm design for the multicast k-tree routing problem
    Zhipeng Cai, Randy Goebel, and Guohui Lin

  7. Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks
    Deying Li, Qinghua Zhu, and Huiqiang Yang

  8. Polynomial approximation schemes for the max-min allocation problem under a grade of service provision
    Jianping Li and Weidong Li

  9. Generalized russian cards problem
    Chen Yang and Zhenhua Duan

  10. A cost-sharing method for the soft-capacitated economic lot-sizing game
    Ruichun Yang, Zhen Wangy, and Dachuan Xuz

  11. A branch-and-cut algorithm for the minimum energy symmetric connectivity problem in wireless networks
    Xiangyong Li and Y.P. Aneja

  12. Approximation algorithms for minimizing the weighted number of tardy jobs on a batch machine
    Jianfeng Ren, Yuzhong Zhang, Xianzhao Zhang, and Sunguo

  13. Scheduling with rejection to minimize the makespan
    Yuzhong Zhang , Jianfeng Ren, and Chengfei Wang

  14. On disjoint shortest paths routing on the hypercube
    E. Cheng, S. Gao, K. Qiu, and Z. Shen

  15. Infinite family from each vertex k-critical graph without any critical edge
    Jixing Wang

  16. DNA library screening, pooling design and unitary
    Suogang Gao, Zengti Li, Jiangchen Yu, Xiaofeng Gao, Weili Wu

  17. Scheduling problems in cross docking
    Chen Rongjun and Guo-Chun Tang

  18. A risk-reward competitive analysis for the newsboy problem with range information
    Guiqing Zhang, Yinfeng Xu, and Yucheng Dong

  19. Matching techniques ride to rescue OLED displays
    Andreas Karrenbauer

  20. Makespan minimization with machine availability constraints
    Bin Fu, Yumei Huo, and Hairong Zhao

  21. Linear-time algorithm for computing the most reliable source on a tree with faulty vertices
    Wei Ding and Guoliang Xue

  22. Variable-size rectangle covering
    Francis Y.L. Chin, Hing-Fung Ting, and Yong Zhang

  23. A kind of N vehicles exploration problem: modeling and optimal computation
    Xiaoya Li and Jinchuan Cui

  24. A mathematical programming approach for online hierarchical scheduling
    Zhiyi Tan and An Zhang

  25. A note on edge choosability and degeneracy of planar graphs
    Baoyindureng Wu and Xinhui An

  26. Recoverable robust timetables on trees
    Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, and Cristina M. Pinotti

  27. Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
    K. Subramani and Kamesh Madduri

  28. Roulette wheel graph colouring for solving examination timetabling problems
    Nasser R. Sabar, Masri Ayob, Graham Kendall, and Rong Qu

  29. A 5/3-approximation algorithm for joint replenishment with deadlines
    Tim Nonner and Alexander Souza

  30. Integrated production and delivery scheduling with disjoint windows
    Yumei Huo, Joseph Y-T. Leung, and Xin Wang

  31. A sufficient and necessary condition for the forcing number of a bipartite graph being equal to the minimum number of trailing vertices
    Hongwei Wang

  32. Computing the transitive closure of a union of affine integer tuple relations
    Anna Beletska, Denis Barthou, Wlodzimierz Bielecki, and Albert Cohen

  33. On construction of almost-ramanujan graphs
    He Sun and Hong Zhu

  34. On-line multiple-strip packing
    Deshi Ye, Xin Han, and Guochuan Zhang

  35. On integrity of harary graphs
    Fengwei Li and Qingfang Ye

  36. Improved algorithms for the gene team problem
    Biing-Feng Wang, Shang-Ju Liu, and Chien-Hsin Lin

  37. A 2log2(n)-approximation algorithm for directed tour cover
    Viet Hung Nguyen

  38. A new combinatorial design approach for rearrangeable multicast switching networks
    Hongbing Fan and Yu-Liang Wu

  39. Approximation algorithms for max 3-section Using complex semidefinite programming relaxation
    Ai-fan Ling

  40. Minimum energy broadcast routing in ad hoc and sensor networks with directional antennas
    Zheng Li and Deying Li

  41. Deterministically estimating data stream frequencies
    Sumit Ganguly

  42. Approximating the multicast traffic grooming problem in unidirectional SONET/WDM rings and in general topology networks
    Jiguo Yu, Suxia Cui, and Guanghui Wang

  43. An algorithm with better approximation ratio for multicast traffic in unidirectional SONET/WDM rings
    Jiguo Yu, Suxia Cui, and Guanghui Wang

  44. Optimal semi-online algorithm for scheduling on a batch processing machine
    Ming Liu, Yinfeng Xu, Chengbin Chu, and Lu Wang

  45. A note on n-critical bipartite graphs and its application
    Yueping Li and Zhe Nie

  46. Positive influence dominating set in online social networks
    Feng Wang, Erika Camacho, and Kuai Xu

  47. Linear coherent bi-cluster discovery via line detection and sample majority voting
    Yi Shi, Zhipeng Cai, Guohui Lin, and Dale Schuurmans

  48. A PTAS for node-weighted Steiner Tree in unit disk graphs
    Xianyue Li, Feng Zou, Pengjun Wan, Yuexuan Wang, and Weili Wu

  49. Improved bounds for facility location games with fair cost allocation
    Thomas Dueholm Hansen and Orestis A. Telelis

  50. Enumerating colored and rooted outerplanar graphs by BCF-decomposition
    Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, and Tatsuya Akutsu

  51. A note on online scheduling for jobs with arbitrary release times
    Jihuan Ding and Guochuan Zhang