1. Introduction, Overview and Definitions Part I: Computational Geometry and Graph Applications
2. Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs
3. Dilation and Detours in Geometric Networks
4. TheWell-Separated Pair Decomposition and Its Applications
5. Covering with Unit Balls
6. Minimum Edge Length Rectangular Partitions
7. Automatic Placement of Labels in Maps and Drawings
8. Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems
9. Approximate Clustering
10. Maximum Planar Subgraph
11. Disjoint Paths and Unsplittable Flow
12. The k-Connected subgraph Problem
13. Node-Connectivity Survivable Network Problems
14. Optimum Communication Spanning Trees
15. Activation Network Design Problems
16. Stochastic Local Search Algorithms for the Graph Colouring Problem
17. On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization 18. Efficient Approximation Algorithms in Random Intersection Graphs
19. Approximation Algorithms for Facility Dispersion Part II: Large-Scale and Emerging Applications 20. Cost-Efficient Multicast Routing in Ad Hoc and Sensor Networks
21. Approximation Algorithm for Clustering in Ad-hoc Networks
22. Topology Control Problems for Wireless Ad hoc Networks
23. QoS Multimedia Multicast Routing
24. Overlay Networks for Peer-to-Peer Networks
25. Scheduling Data Broadcasts on Wireless Channels: Exact Solutions and Time-Optimal Solutions for Uniform Data and Heuristics for Non-Uniform Data
26. Strategies for Aggregating Time-discounted Information in Sensor Networks 27. Approximation and exact algorithms for optimally placing a limited numberof storage nodes in a wireless sensor network
28. Approximation Algorithms for the Primer Selection, PlantedMotif Search, and Related Problems
29. Dynamic and Fractional Programming based Approximation Algorithms for Sequence Alignment with Constraints
30. Approximation Algorithms for the Selection of Robust Tag SNPs
31. Large-Scale Global Placement
32. Histograms,Wavelets, Streams and Approximation
33. A GSO based Swarm Algorithm for Odor Source Localization in Turbulent Environments
34. Color Quantization
35. Digital Reputation for Virtual Communities
36. Approximation for Influence Maximization
37. Approximation and Heuristics for Community Detection