1. The three-dimensional matching problem in Kalmanson matrices

   • Sergey Polyakovskiy
   • Frits C. R. Spieksma
   • Gerhard J. Woeginger

   OriginalPaper Open access 16 November 2011 Pages: 1 - 9

2. On the outer-connected domination in graphs

   • M. H. Akhbari
   • R. Hasni
   • S. M. Sheikholeslami

   OriginalPaper 17 November 2011 Pages: 10 - 18

3. Parameterized complexity of k-anonymity: hardness and tractability

   • Paola Bonizzoni
   • Gianluca Della Vedova
   • Yuri Pirola

   OriginalPaper 16 November 2011 Pages: 19 - 43

4. Optimal key tree structure for two-user replacement and deletion problems

   • Weiwei Wu
   • Minming Li
   • Enhong Chen

   OriginalPaper 30 November 2011 Pages: 44 - 70

5. Maximum latency scheduling problem on two-person cooperative games

   • Yanhong Gu
   • Jing Fan
   • Jiaofei Zhong

   OriginalPaper 16 November 2011 Pages: 71 - 81

6. On the union of intermediate nodes of shortest paths

   • Xiang Li
   • Xiaodong Hu
   • Wonjun Lee

   OriginalPaper 03 December 2011 Pages: 82 - 85

7. An adaptive multistart tabu search approach to solve the maximum clique problem

   • Qinghua Wu
   • Jin-Kao Hao

   OriginalPaper 09 December 2011 Pages: 86 - 108

   

8. The maximum flow problem with disjunctive constraints

   • Ulrich Pferschy
   • Joachim Schauer

   OriginalPaper 03 December 2011 Pages: 109 - 119

   

9. Independent dominating sets in regular graphs

   • Julie Haviland

   OriginalPaper 03 December 2011 Pages: 120 - 126

10. Approximate min-max relations on plane graphs

    • Jie Ma
    • Xingxing Yu
    • Wenan Zang

    OriginalPaper Open access 17 December 2011 Pages: 127 - 134

11. Embeddings of circulant networks

    • Indra Rajasingh
    • Paul Manuel
    • Bharati Rajan

    OriginalPaper 14 December 2011 Pages: 135 - 151

    

12. Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ

    • Hervé Hocquard
    • Mickaël Montassier

    OriginalPaper 01 March 2012 Pages: 152 - 160

13. Practical unicast and convergecast scheduling schemes for cognitive radio networks

    • Shouling Ji
    • Arif Selcuk Uluagac
    • Zhipeng Cai

    OriginalPaper 10 January 2012 Pages: 161 - 177

    

14. Critical edges/nodes for the minimum spanning tree problem: complexity and approximation

    • Cristina Bazgan
    • Sonia Toubaline
    • Daniel Vanderpooten

    OriginalPaper 11 January 2012 Pages: 178 - 189

    

15. Metric dimension of some distance-regular graphs

    • Jun Guo
    • Kaishun Wang
    • Fenggao Li

    OriginalPaper 11 February 2012 Pages: 190 - 197

16. On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines

    • Shlomo Karhi
    • Dvir Shabtay

    OriginalPaper 25 February 2012 Pages: 198 - 222