Abstract is missing.
- Algorithms for Sensor Networks: What Is It Good for?Roger Wattenhofer. 1 [doi]
- Tight Local Approximation Results for Max-Min Linear ProgramsPatrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela. 2-17 [doi]
- Minimizing Average Flow Time in Sensor Data GatheringVincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie. 18-29 [doi]
- Target Counting under Minimal Sensing: Complexity and ApproximationsSorabh Gandhi, Rajesh Kumar, Subhash Suri. 30-42 [doi]
- Efficient Scheduling of Data-Harvesting TreesBastian Katz, Steffen Mecke, Dorothea Wagner. 43-56 [doi]
- Link Scheduling in Local Interference ModelsBastian Katz, Markus Völker, Dorothea Wagner. 57-71 [doi]
- Algorithms for Location Estimation Based on RSSI SamplingCharalampos Papamanthou, Franco P. Preparata, Roberto Tamassia. 72-86 [doi]
- Random Fault Attack against Shrinking GeneratorMarcin Gomulkiewicz, Miroslaw Kutylowski, Pawel Wlaz. 87-99 [doi]
- Probabilistic Protocols for Fair Communication in Wireless Sensor NetworksIoannis Chatzigiannakis, Lefteris M. Kirousis, Thodoris Stratiotis. 100-110 [doi]
- Simple Robots in Polygonal Environments: A HierarchyJan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. 111-124 [doi]
- Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal EnvironmentsEduardo Mesa Barrameda, Shantanu Das, Nicola Santoro. 125-140 [doi]
- Optimal Backlog in the PlaneValentin Polishchuk, Jukka Suomela. 141-150 [doi]