Volume 25, Issue 1, January 2013

ISSN: 1382-6905 (Print) 1573-2886 (Online)

In this issue (9 articles)

  1. No Access

    OriginalPaper

    An extension of Stein-Lovász theorem and some of its applications

    Guang-Siang Lee Pages 1-18
    Look Inside Get Access

  2. No Access

    OriginalPaper

    The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs

    Jean Cardinal, Erik D. Demaine, Samuel Fiorini… Pages 19-46
    Look Inside Get Access

  3. No Access

    OriginalPaper

    Edge lifting and total domination in graphs

    Wyatt J. Desormeaux, Teresa W. Haynes… Pages 47-59
    Look Inside Get Access

  4. No Access

    OriginalPaper

    A 6/5-approximation algorithm for the maximum 3-cover problem

    Ioannis Caragiannis, Gianpiero Monaco Pages 60-77
    Look Inside Get Access

  5. No Access

    OriginalPaper

    Edge-colouring of joins of regular graphs II

    Caterina De Simone, Anna Galluccio Pages 78-90
    Look Inside Get Access

  6. No Access

    OriginalPaper

    The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle

    H. Karami, R. Khoeilar, S. M. Sheikholeslami Pages 91-98
    Look Inside Get Access

  7. No Access

    OriginalPaper

    Computational risk management techniques for fixed charge network flow problems with uncertain arc failures

    Alexey Sorokin, Vladimir Boginski… Pages 99-122
    Look Inside Get Access

  8. No Access

    OriginalPaper

    Two-stage proportionate flexible flow shop to minimize the makespan

    Byung-Cheon Choi, Kangbok Lee Pages 123-134
    Look Inside Get Access

  9. No Access

    OriginalPaper

    A new two-party bargaining mechanism

    Y. H. Gu, M. Goh, Q. L. Chen, R. D. Souza… Pages 135-163
    Look Inside Get Access