| 311 | -- | 320 | Balabhaskar Balasundaram, Shyam Sundar Chandramouli, Svyatoslav Trukhanov. Approximation algorithms for finding and partitioning unit-disk graphs into co-::::k::::-plexes |
| 321 | -- | 333 | Xiaofeng Gao, Wei Wang, Zhao Zhang, Shiwei Zhu, Weili Wu. A PTAS for minimum ::::d::::-hop connected dominating set in growth-bounded graphs |
| 335 | -- | 345 | Yiwei Wu, Xiaofeng Gao, Yingshu Li. A framework of distributed indexing and data dissemination in large scale wireless sensor networks |
| 347 | -- | 358 | Weili Wu, Xiaofeng Gao, Panos M. Pardalos, Ding-Zhu Du. Wireless networking, dominating and packing |
| 359 | -- | 369 | Yinying Yang, Mihaela Cardei. Adaptive energy efficient sensor scheduling for wireless sensor networks |
| 371 | -- | 381 | Zheng Fang, Jie Wang. Hybrid approximation for minimum-cost target coverage in wireless sensor networks |
| 383 | -- | 392 | Donghyun Kim, Wei Wang, Ling Ding, Jihwan Lim, Heekuck Oh, Weili Wu. Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks |
| 393 | -- | 403 | Incheol Shin, Yilin Shen, My T. Thai. On approximation of dominating tree in wireless sensor networks |
| 405 | -- | 416 | X. Xu, Y. Wang, H. Du, P.-J. Wan, F. Zou, X. Li, W. Wu. Approximations for node-weighted Steiner tree in unit disk graphs |
| 417 | -- | 424 | Sheng-Long Hu, Zheng-Hai Huang. A note on absolute value equations |
| 425 | -- | 437 | Q. L. Wang, S. J. Li, K. L. Teo. Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization |
| 439 | -- | 447 | Qinghong Zhang. Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming |
| 449 | -- | 456 | Abdellatif Moudafi. A partial complement method for approximating solutions of a primal dual fixed-point problem |
| 457 | -- | 464 | Cristinel Mortici. n{\mathbb{R}^{n}} |
| 465 | -- | 472 | Immanuel M. Bomze, Florian Jarre. A note on Burer s copositive representation of mixed-binary QPs |