Journal: Algorithmica

Volume 49, Issue 4

259 -- 263Stefano Basagni, Cynthia A. Phillips. Editors Foreword to the Special Issue on Principles of Mobile Communications and Computing
264 -- 285Peng-Jun Wan, Xiang-Yang Li, Ophir Frieder. OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks
286 -- 317Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad. A Class of Algorithms for Collision Resolution with Multiplicity Estimation
318 -- 336Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes. Improved Approximation Results for the Minimum Energy Broadcasting Problem
337 -- 356András Faragó. On the Fundamental Limits of Topology Control in Ad Hoc Networks
357 -- 385Vasundhara Puttagunta, Konstantinos Kalpakis. Accuracy vs. Lifetime: Linear Sketches for Aggregate Queries in Sensor Networks
386 -- 411Daniela Tulone. On the Feasibility of Time Estimation under Isolation Conditions in Wireless Sensor Networks
412 -- 446Devdatt P. Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti. Localized Techniques for Broadcasting in Wireless Sensor Networks

Volume 49, Issue 3

171 -- 191Luciano Gualà, Guido Proietti. Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem
192 -- 211Shang-Hua Teng, Frances F. Yao. ::::k::::-Nearest-Neighbor Clustering and Percolation Theory
212 -- 231Eitan Bachmat. Average Case Analysis of Disk Scheduling, Increasing Subsequences and Spacetime Geometry
232 -- 244Bernhard Fuchs, Walter Kern, Xinhui Wang. The Number of Tree Stars Is ::::O:::: :::*:::(1.357::: ::::k:::: :::)
245 -- 257Hervé Fournier, Antoine Vigneron. A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope

Volume 49, Issue 2

81 -- 93Andrej Taranenko, Aleksander Vesel. Fast Recognition of Fibonacci Cubes
94 -- 108Yakov Nekrich. Space Efficient Dynamic Orthogonal Range Reporting
109 -- 126Gopal Pandurangan, GaHyun Park. Analysis of Randomized Protocols for Conflict-Free Distributed Access
127 -- 146Frédéric Magniez, Michel de Rougemont. Property Testing of Regular Tree Languages
147 -- 169Valerie King, Scott Lewis, Jared Saia, Maxwell Young. Choosing a Random Peer in Chord

Volume 49, Issue 1

1 -- 11Alexander Grigoriev, Hans Leo Bodlaender. Algorithms for Graphs Embeddable with Few Crossings per Edge
13 -- 36Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp. The Complexity of the Single Individual SNP Haplotyping Problem
37 -- 50Nir Halman. Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems
51 -- 68Leah Epstein, Asaf Levin. SONET ADMs Minimization with Divisible Paths
69 -- 77Daniil Ryabko. Sample Complexity for Computational Classification Problems