RANDOM 2007 accepted papers: On the Randomness Complexity of Property Testing Oded Goldreich and Or Sheffet The cover time of random digraphs Colin Cooper and Alan Frieze Properly 2-Colouring Linear Hypergraphs Arkadev Chattopadhyay and Bruce Reed. On Estimating Frequency Moments of Data Streams Graham Cormode and Sumit Ganguly On the Benefits of Adaptivity in Property Testing of Dense Graphs Mira Gonen and Dana Ron On approximating the average distance between points Kfir Barhum, Oded Goldreich and Adi Shraibman Implementing Huge Sparse Random Graphs Moni Naor and Asaf Nussboim Lower bounds for testing forbidden induced subgraphs in bipartite-graph-like combinatorial objects Eyal Rozenberg and Eldar Fischer Local Limit Theorems for the Giant Component of Random Hypergraphs Michael Behrisch, Mihyun Kang and Amin Coja-Oghlan Distribution-Free Testing Lower Bounds for Basic Boolean Functions Dana Glasner and Rocco Servedio High Entropy Random Selection Protocols Harry Buhrman, Matthias Christandl, Michal Koucky, Zvi Lotker, Boaz Patt-Shamir and Nikolai Vereshchagin. Eigenvectors of random graphs: Nodal domains Yael Dekel, James Lee and Nati Linial Worst-case to average-case reductions revisited Dan Gutfreund and Amnon Ta-Shma Lower Bounds for Swapping Arthur and Merlin Scott Diehl Derandomization of Euclidean Random Walks Ilia Binder and Mark Braverman Random Subsets of the Interval and P2P protocols Jacek Cichon, Marek Klonowski, Lukasz Krzywiecki, Pawel Zielinski, Przemyslaw Kobylanski and Bartlomiej Rozanski Better binary list-decodable codes via multilevel concatenation Venkatesan Guruswami and Atri Rudra Testing $st$-Connectivity Arie Matsliah, Eldar Fischer, Sourav Chakraborty, ilan newman and Oded Lachish On finding frequent elements in a data stream rina panigrahy and Ravi Kumar Sublinear Algorithms for Approximating String Compressibility Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld and Adam Smith Slow mixing of Markov chains using fault lines and fat contours Sam Greenberg and Dana Randall On Locally Decodable Codes, Self-Correctable Codes, and $t$-private PIR Omer Barkol, Yuval Ishai and Enav Weinreb A Sequential Algorithm for Generating Random Graphs Mohsen Bayati, Jeong Han Kim and Amin Saberi APPROX 2007 accepted papers: Maximum gradient embeddings and monotone clustering Manor Mendel and Assaf Naor On the approximation resistance of a random predicate Johan Hastad Almost exact matchings Raphael Yuster Parity and contraction in planar graph embeddings Amit Chakrabarti, James Lee and Justin Vincent Coarse differentiation and multi-flows in planar graphs James Lee and Prasad Raghavendra An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem Jaroslaw Byrka Packing and covering delta-hyperbolic spaces by balls Victor Chepoi and Bertrand Estellon Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows Greg Frederickson and Barry Wittman Approximation algorithms and hardness for domination with propagation Ashkan Aazami and Michael Stilp Stochastic Steiner Tree with Non-Uniform Inflation Anupam Gupta, MohammadTaghi Hajiaghayi and Amit Kumar Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems Viswanath Nagarajan and R Ravi Soft Edge Coloring Chadi Kari, Yoo-Ah Kim, Seungjoon Lee, Alexander Russell and Min-ho Shin Increasing the Span of Stars Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra and Gyanit Singh Improved approximation ratios for traveling salesperson tours and paths in directed graphs Uriel Feige and Mohit Singh Two Randomized Mechanisms for Combinatorial Auctions Shahar Dobzinski Hardness of Embedding Metric Spaces of Equal Size Subhash Khot and Rishi Saket Optimal Resource Augmentations for Online Knapsack Kazuo Iwama and Guochuan Zhang Approximation Algorithms for the Max-Min Allocation problem Ashok Kumar Ponnuswami and Subhash Khot Integrality gaps of semidefinite programs for Vertex Cover and relations to $\ell_1$ embeddability of negative type metrics Hamed Hatami, Avner Magen and Evangelos Markakis Encouraging Cooperation in Sharing Supermodular Costs Andreas S. Schulz and Nelson Uhan Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems Ilias Diakonikolas and Mihalis Yannakakis A Knapsack Secretary Problem with Applications Moshe Babaioff, Nicole Immorlica, David Kempe and Robert Kleinberg