1. A generalization of Macula’s disjunct matrices

   • Ping Zhao
   • Kefeng Diao
   • Kaishun Wang

   OriginalPaper 12 February 2010 Pages: 495 - 498

2. Resource-sharing systems and hypergraph colorings

   • Wu-Hsiung Lin
   • Gerard J. Chang

   OriginalPaper 12 February 2010 Pages: 499 - 508

3. Optimal on-line algorithms for one batch machine with grouped processing times

   • Yang Fang
   • Peihai Liu
   • Xiwen Lu

   OriginalPaper 12 February 2010 Pages: 509 - 516

4. The Maximum Box Problem for moving points in the plane

   • S. Bereg
   • J. M. Díaz-Báñez
   • I. Ventura

   OriginalPaper 23 February 2010 Pages: 517 - 530

5. Selfish bin coloring

   • Leah Epstein
   • Sven O. Krumke
   • Heike Sperber

   OriginalPaper 18 February 2010 Pages: 531 - 548

6. Super cyclically edge connected transitive graphs

   • Zhao Zhang
   • Bing Wang

   OriginalPaper 02 March 2010 Pages: 549 - 562

7. On the vertex characterization of single-shape partition polytopes

   • Yu-Chi Liu
   • Jun-Jie Pan

   OriginalPaper 03 March 2010 Pages: 563 - 571

8. Revised GRASP with path-relinking for the linear ordering problem

   • W. Art Chaovalitwongse
   • Carlos A. S. Oliveira
   • Mauricio G. C. Resende

   OriginalPaper 02 March 2010 Pages: 572 - 593

9. Optimality conditions for a bilevel matroid problem

   • Diana Fanghänel

   OriginalPaper 04 March 2010 Pages: 594 - 608

10. A closest vector problem arising in radiation therapy planning

    • Céline Engelbeen
    • Samuel Fiorini
    • Antje Kiesel

    OriginalPaper 25 March 2010 Pages: 609 - 629

11. Optimal tree structure with loyal users and batch updates

    • Yu-Ki Chan
    • Minming Li
    • Weiwei Wu

    OriginalPaper 09 April 2010 Pages: 630 - 639

12. Co-2-plex polynomials

    • Benjamin McClosky
    • Anthony Simms
    • Illya V. Hicks

    OriginalPaper 08 April 2010 Pages: 640 - 650

13. On domination number of Cartesian product of directed paths

    • Juan Liu
    • Xindong Zhang
    • Jixiang Meng

    OriginalPaper 27 April 2010 Pages: 651 - 662

14. PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs

    • Lidan Fan
    • Zhao Zhang
    • Wei Wang

    OriginalPaper 08 April 2010 Pages: 663 - 673

15. Optimal semi-online algorithm for scheduling with rejection on two uniform machines

    • Xiao Min
    • Jing Liu
    • Yuqing Wang

    OriginalPaper 15 April 2010 Pages: 674 - 683

16. Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs

    • Chunmei Liu
    • Yinglei Song

    OriginalPaper 15 April 2010 Pages: 684 - 698

17. Geometric rounding: a dependent randomized rounding scheme

    • Dongdong Ge
    • Simai He
    • Jiawei Zhang

    OriginalPaper 15 April 2010 Pages: 699 - 725

18. Improved floor-planning of graphs via adjacency-preserving transformations

    • Huaming Zhang
    • Sadish Sadasivam

    OriginalPaper 24 April 2010 Pages: 726 - 746

19. A rearrangement of adjacency matrix based approach for solving the crossing minimization problem

    • Neng Fan
    • Panos M. Pardalos

    OriginalPaper 27 April 2010 Pages: 747 - 762

20. Fast searching games on graphs

    • Donald Stanley
    • Boting Yang

    OriginalPaper 27 April 2010 Pages: 763 - 777

21. The multiple sequence sets: problem and heuristic algorithms

    • Kang Ning
    • Hon Wai Leong

    OriginalPaper 08 May 2010 Pages: 778 - 796

22. Minimizing makespan in an ordered flow shop with machine-dependent processing times

    • Byung-Cheon Choi
    • Joseph Y.-T. Leung
    • Michael L. Pinedo

    OriginalPaper 27 July 2010 Pages: 797 - 818

23. SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling

    • Karine Deschinkel
    • Sid-Ahmed-Ali Touati
    • Sébastien Briais

    OriginalPaper 22 May 2010 Pages: 819 - 844

24. Polynomially solvable special cases of the quadratic bottleneck assignment problem

    • Rainer E. Burkard
    • Roswitha Rissner

    OriginalPaper 08 June 2010 Pages: 845 - 856

25. Minimum d-blockers and d-transversals in graphs

    • Marie-Christine Costa
    • Dominique de Werra
    • Christophe Picouleau

    OriginalPaper 05 June 2010 Pages: 857 - 872

26. A modified power spectral density test applied to weighing matrices with small weight

    • Ilias S. Kotsireas
    • Christos Koukouvinos
    • Panos M. Pardalos

    OriginalPaper 17 June 2010 Pages: 873 - 881

27. Improving an upper bound on the size of k-regular induced subgraphs

    • Carlos J. Luz

    OriginalPaper 07 August 2010 Pages: 882 - 894