Abstract is missing.
- Coverage with ::::k::::-Transmitters in the Presence of ObstaclesBrad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara. 1-15 [doi]
- On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree ProblemBeate Bollig. 16-30 [doi]
- Reducing the Maximum Latency of Selfish Ring Routing via Pairwise CooperationsXujin Chen, Xiaodong Hu, Weidong Ma. 31-45 [doi]
- Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor NetworksDeying Li, Zheng Li, Wenkai Ma, Hong Chen. 46-57 [doi]
- Time Optimal Algorithms for Black Hole Search in RingsBalasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro. 58-71 [doi]
- Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded AngleStefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales Ponce, Ladislav Stacho. 72-86 [doi]
- A Constant-Factor Approximation Algorithm for the Link Building ProblemMartin Olsen, Anastasios Viglas, Ilia Zvedeniouk. 87-96 [doi]
- XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation SchemeArtem Chebotko, Bin Fu. 97-106 [doi]
- Computational Study for Planar Connected Dominating Set ProblemMarjan Marzban, Qian-Ping Gu, Xiaohua Jia. 107-116 [doi]
- Bounds for Nonadaptive Group Tests to Estimate the Amount of DefectivesPeter Damaschke, Azam Sheikh Muhammad. 117-130 [doi]
- A Search-Based Approach to the Railway Rolling Stock Allocation ProblemTomoshi Otsuki, Hideyuki Aisu, Toshiaki Tanaka. 131-143 [doi]
- Approximation Algorithm for the Minimum Directed Tree CoverViet Hung Nguyen. 144-159 [doi]
- An Improved Approximation Algorithm for Spanning Star Forest in Dense GraphsJing He, Hongyu Liang. 160-169 [doi]
- A New Result on [::::k::::, ::::k:::: + 1]-Factors Containing Given Hamiltonian CyclesGuizhen Liu, Xuejun Pan, Jonathan Z. Sun. 170-180 [doi]
- Yao Graphs Span Theta GraphsMirela Damian, Kristin Raudonis. 181-194 [doi]
- A Simpler Algorithm for the All Pairs Shortest Path Problem with ::::O::::(::::n:::::::2:::log::::n::::) Expected TimeTadao Takaoka, Mashitoh Hashim. 195-206 [doi]
- New Min-Max Theorems for Weakly Chordal and Dually Chordal GraphsArthur H. Busch, Feodor F. Dragan, R. Sritharan. 207-218 [doi]
- A Simpler and More Efficient Algorithm for the Next-to-Shortest Path ProblemBang Ye Wu. 219-227 [doi]
- Fast Edge-Searching and Related ProblemsBoting Yang. 228-242 [doi]
- Diameter-Constrained Steiner TreeWei Ding, Guohui Lin, Guoliang Xue. 243-253 [doi]
- Minimizing the Maximum Duty for Connectivity in Multi-Interface NetworksGianlorenzo D Angelo, Gabriele Di Stefano, Alfredo Navarra. 254-267 [doi]
- A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded TreeWei Ding, Guoliang Xue. 268-280 [doi]
- Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor NetworksDeying Li, Zheng Li, Wenkai Ma, Wenping Chen. 281-291 [doi]
- Structured Overlay Network for File DistributionHongbing Fan, Yu-Liang Wu. 292-302 [doi]
- Optimal Balancing of Satellite Queues in Packet Transmission to Ground StationsEvangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny. 303-316 [doi]
- The Networked Common Goods GameJinsong Tan. 317-331 [doi]
- A Novel Branching Strategy for Parameterized Graph Modification ProblemsJames Nastos, Yong Gao. 332-346 [doi]
- Listing Triconnected Rooted Plane GraphsBingbing Zhuang, Hiroshi Nagamochi. 347-361 [doi]
- Bipartite Permutation Graphs Are ReconstructibleMasashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara. 362-373 [doi]
- A Transformation from PPTL to S1SCong Tian, Zhenhua Duan. 374-386 [doi]
- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree GraphsMingyu Xiao. 387-400 [doi]
- Approximate Ellipsoid in the Streaming ModelAsish Mukhopadhyay, Animesh Sarker, Tom Switzer. 401-413 [doi]