1. Minimum statuses of connected graphs with fixed maximum degree and order

   • Chiang Lin
   • Wei-Han Tsai
   • Yuan-Jen Zhang

   OriginalPaper 05 October 2011 Pages: 147 - 161

2. The total {k}-domatic number of wheels and complete graphs

   • Jing Chen
   • Xinmin Hou
   • Ning Li

   OriginalPaper 21 December 2010 Pages: 162 - 175

3. Vertices in all minimum paired-dominating sets of block graphs

   • Lei Chen
   • Changhong Lu
   • Zhenbing Zeng

   OriginalPaper 12 January 2011 Pages: 176 - 191

4. The second largest number of maximal independent sets in connected graphs with at most one cycle

   • Min-Jen Jou

   OriginalPaper 21 January 2011 Pages: 192 - 201

5. Min-cost multiflows in node-capacitated undirected networks

   • Maxim A. Babenko
   • Alexander V. Karzanov

   OriginalPaper 29 January 2011 Pages: 202 - 228

6. Approximation schemes for two-machine flow shop scheduling with two agents

   • Wenchang Luo
   • Lin Chen
   • Guochuan Zhang

   OriginalPaper 19 January 2011 Pages: 229 - 239

7. Long cycles in hypercubes with optimal number of faulty vertices

   • Jiří Fink
   • Petr Gregor

   OriginalPaper 27 January 2011 Pages: 240 - 265

8. On L(2,1)-labeling of generalized Petersen graphs

   • Yuan-Zhen Huang
   • Chun-Ying Chiang
   • Hong-Gwa Yeh

   OriginalPaper 21 January 2011 Pages: 266 - 279

9. Random restricted matching and lower bounds for combinatorial optimization

   • Stefan Steinerberger

   OriginalPaper 27 January 2011 Pages: 280 - 298

10. Some results on the injective chromatic number of graphs

    • Min Chen
    • Geňa Hahn
    • Weifan Wang

    OriginalPaper 26 January 2011 Pages: 299 - 318

11. A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring

    • Jianping Li
    • Weidong Li
    • Lusheng Wang

    OriginalPaper 25 January 2011 Pages: 319 - 328

12. A Nordhaus-Gaddum-type result for the induced path number

    • Johannes H. Hattingh
    • Osama A. Saleh
    • Terry J. Walters

    OriginalPaper 27 January 2011 Pages: 329 - 338

13. k-tuple total domination in cross products of graphs

    • Michael A. Henning
    • Adel P. Kazemi

    OriginalPaper 02 February 2011 Pages: 339 - 346

14. Exact combinatorial algorithms and experiments for finding maximum k-plexes

    • Hannes Moser
    • Rolf Niedermeier
    • Manuel Sorge

    OriginalPaper 09 March 2011 Pages: 347 - 373

15. The complexity of influence maximization problem in the deterministic linear threshold model

    • Zaixin Lu
    • Wei Zhang
    • Bin Fu

    OriginalPaper 01 April 2011 Pages: 374 - 378

16. On cyclic vertex-connectivity of Cartesian product digraphs

    • Da Huang
    • Zhao Zhang

    OriginalPaper 22 April 2011 Pages: 379 - 388

17. Note on the hardness of generalized connectivity

    • Shasha Li
    • Xueliang Li

    OriginalPaper 14 May 2011 Pages: 389 - 396