1. Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes

   • Balabhaskar Balasundaram
   • Shyam Sundar Chandramouli
   • Svyatoslav Trukhanov

   Original Paper 30 September 2009 Pages: 311 - 320

2. A PTAS for minimum d-hop connected dominating set in growth-bounded graphs

   • Xiaofeng Gao
   • Wei Wang
   • Weili Wu

   Original Paper 09 October 2009 Pages: 321 - 333

3. A framework of distributed indexing and data dissemination in large scale wireless sensor networks

   • Yiwei Wu
   • Xiaofeng Gao
   • Yingshu Li

   Original Paper 09 October 2009 Pages: 335 - 345

4. Wireless networking, dominating and packing

   • Weili Wu
   • Xiaofeng Gao
   • Ding-Zhu Du

   Original Paper 23 October 2009 Pages: 347 - 358

5. Adaptive energy efficient sensor scheduling for wireless sensor networks

   • Yinying Yang
   • Mihaela Cardei

   Original Paper 10 November 2009 Pages: 359 - 369

6. Hybrid approximation for minimum-cost target coverage in wireless sensor networks

   • Zheng Fang
   • Jie Wang

   Original Paper 20 December 2009 Pages: 371 - 381

7. Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks

   • Donghyun Kim
   • Wei Wang
   • Weili Wu

   Original Paper 25 December 2009 Pages: 383 - 392

8. On approximation of dominating tree in wireless sensor networks

   • Incheol Shin
   • Yilin Shen
   • My T. Thai

   Original Paper 05 February 2010 Pages: 393 - 403

9. Approximations for node-weighted Steiner tree in unit disk graphs

   • X. Xu
   • Y. Wang
   • W. Wu

   Original Paper 05 May 2010 Pages: 405 - 416

10. A note on absolute value equations

    • Sheng-Long Hu
    • Zheng-Hai Huang

    Original Paper 05 January 2010 Pages: 417 - 424

11. Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization

    • Q. L. Wang
    • S. J. Li
    • K. L. Teo

    Original Paper 13 January 2010 Pages: 425 - 437

12. Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming

    • Qinghong Zhang

    Original Paper 06 January 2010 Pages: 439 - 447

13. A partial complement method for approximating solutions of a primal dual fixed-point problem

    • Abdellatif Moudafi

    Original Paper 07 January 2010 Pages: 449 - 456

14. Monotonicity properties of the volume of the unit ball in \({\mathbb{R}^{n}}\)

    • Cristinel Mortici

    Original Paper 07 January 2010 Pages: 457 - 464

15. A note on Burer’s copositive representation of mixed-binary QPs

    • Immanuel M. Bomze
    • Florian Jarre

    Short Communication 23 January 2010 Pages: 465 - 472