Table of Contents

• Some Open Questions Related to Cuckoo HashingMichael Mitzenmacher. 1-10 [doi]
• Efficient Computation of the Characteristic Polynomial of a Tree and Related TasksMartin Fürer. 11-22 [doi]
• Improved Approximation Algorithms for Label Cover ProblemsMoses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff. 23-34 [doi]
• A Linear Time Algorithm for ::::L::::(2, 1)-Labeling of TreesToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno. 35-46 [doi]
• On Inducing Polygons and Related ProblemsEyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg. 47-58 [doi]
• Computing 3D Periodic TriangulationsManuel Caroli, Monique Teillaud. 59-70 [doi]
• Cauchy s Theorem for Orthogonal Polyhedra of Genus 0Therese C. Biedl, Burkay Genc. 71-82 [doi]
• Approximability of Sparse Integer ProgramsDavid Pritchard. 83-94 [doi]
• Iterative Rounding for Multi-Objective Optimization ProblemsFabrizio Grandoni, R. Ravi, Mohit Singh. 95-106 [doi]
• A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexityClaudia D Ambrosio, Jon Lee, Andreas Wächter. 107-118 [doi]
• Constructing Delaunay Triangulations along Space-Filling CurvesKevin Buchin. 119-130 [doi]
• Piercing Translates and Homothets of a Convex BodyAdrian Dumitrescu, Minghui Jiang. 131-142 [doi]
• Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric HypergraphsKhaled M. Elbassioni, Kazuhisa Makino, Imran Rauf. 143-154 [doi]
• On Revenue Maximization in Second-Price Ad AuctionsYossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen. 155-166 [doi]
• Clustering-Based Bidding Languages for Sponsored SearchMohammad Mahdian, Grant Wang. 167-178 [doi]
• Altruism in Atomic Congestion GamesMartin Hoefer, Alexander Skopalik. 179-189 [doi]
• Geometric Spanners for Weighted Point SetsMohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid. 190-202 [doi]
• ::::k::::-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning TreesYuval Emek. 203-214 [doi]
• Narrow-Shallow-Low-Light Trees with and without Steiner PointsMichael Elkin, Shay Solomon. 215-226 [doi]
• Bounded Budget Betweenness Centrality Game for Strategic Network FormationsXiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu. 227-238 [doi]
• Exact and Approximate Equilibria for Optimal Group Network FormationElliot Anshelevich, Bugra Caskurlu. 239-250 [doi]
• On the Performance of Approximate Equilibria in Congestion GamesGeorge Christodoulou, Elias Koutsoupias, Paul G. Spirakis. 251-262 [doi]
• Optimality and Competitiveness of Exploring Polygons by Mobile RobotsJurek Czyzowicz, Arnaud Labourel, Andrzej Pelc. 263-274 [doi]
• Tractable Cases of Facility Location on a Network with a Linear Reliability Order of LinksRefael Hassin, R. Ravi, F. Sibel Salman. 275-276 [doi]
• Dynamic vs. Oblivious Routing in Network DesignNavin Goyal, Neil Olver, F. Bruce Shepherd. 277-288 [doi]
• Algorithms Meet Art, Puzzles, and MagicErik D. Demaine. 289 [doi]
• Polynomial-Time Algorithm for the Leafage of Chordal GraphsMichel Habib, Juraj Stacho. 290-300 [doi]
• Breaking the O(m:::2:::n) Barrier for Minimum Cycle BasesEdoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi. 301-312 [doi]
• Shape Fitting on Point Sets with Probability DistributionsMaarten Löffler, Jeff M. Phillips. 313-324 [doi]
• An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract)Jing Xiao, Tiancheng Lou, Tao Jiang. 325-336 [doi]
• Complete Parsimony Haplotype Inference Problem and AlgorithmsGerold Jäger, Sharlee Climer, Weixiong Zhang. 337-348 [doi]
• Linear-Time Recognition of Probe Interval GraphsRoss M. McConnell, Yahav Nussbaum. 349-360 [doi]
• Wireless Scheduling with Power ControlMagnús M. Halldórsson. 361-372 [doi]
• On the Power of Uniform Power: Capacity of Wireless Networks with Bounded ResourcesChen Avin, Zvi Lotker, Yvonne Anne Pignolet. 373-384 [doi]
• Approximability of OFDMA SchedulingMarcel Ochel, Berthold Vöcking. 385-396 [doi]
• Maximum Flow in Directed Planar Graphs with Vertex CapacitiesHaim Kaplan, Yahav Nussbaum. 397-407 [doi]
• A Fast Output-Sensitive Algorithm for Boolean Matrix MultiplicationAndrzej Lingas. 408-419 [doi]
• On Optimally Partitioning a Text to Improve Its CompressionPaolo Ferragina, Igor Nitto, Rossano Venturini. 420-431 [doi]
• An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time SchedulingAndreas Karrenbauer, Thomas Rothvoß. 432-443 [doi]
• Minimizing Maximum Response Time and Delay Factor in Broadcast SchedulingChandra Chekuri, Sungjin Im, Benjamin Moseley. 444-455 [doi]
• Preemptive Online Scheduling with ReorderingGyörgy Dósa, Leah Epstein. 456-467 [doi]
• ::::d::::-Dimensional Knapsack in the Streaming ModelSumit Ganguly, Christian Sohler. 468-479 [doi]
• Sparse Cut Projections in Graph StreamsAtish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy. 480-491 [doi]
• Bipartite Graph Matchings in the Semi-streaming ModelSebastian Eggert, Lasse Kliemann, Anand Srivastav. 492-503 [doi]
• The Oil Searching ProblemAndrew McGregor, Krzysztof Onak, Rina Panigrahy. 504-515 [doi]
• Hyperbolic DovetailingDavid G. Kirkpatrick. 516-527 [doi]
• On the Expansion and Diameter of Bluetooth-Like TopologiesAlberto Pettarin, Andrea Pietracaprina, Geppino Pucci. 528-539 [doi]
• Minimum Makespan Multi-vehicle Dial-a-RideInge Li Gørtz, Viswanath Nagarajan, R. Ravi. 540-552 [doi]
• Google s Auction for TV AdsNoam Nisan. 553 [doi]
• Inclusion/Exclusion Meets Measure and ConquerJohan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk. 554-565 [doi]
• Dynamic Programming on Tree Decompositions Using Generalised Fast Subset ConvolutionJohan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith. 566-577 [doi]
• Counting Paths and Packings in HalvesAndreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto. 578-586 [doi]
• Accelerating Multi-modal Route Planning by Access-NodesDaniel Delling, Thomas Pajor, Dorothea Wagner. 587-598 [doi]
• Parallel Algorithms for Mean-Payoff Games: An Experimental EvaluationJakub Chaloupka. 599-610 [doi]
• Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set ProblemRudolf Fleischer, Xi Wu, Liwei Yuan. 611-622 [doi]
• Fast Evaluation of Interlace Polynomials on Graphs of Bounded TreewidthMarkus Bläser, Christian Hoffmann. 623-634 [doi]
• Kernel Bounds for Disjoint Cycles and Disjoint PathsHans L. Bodlaender, Stéphan Thomassé, Anders Yeo. 635-646 [doi]
• Constant Ratio Fixed-Parameter Approximation of the Edge Multicut ProblemDániel Marx, Igor Razgon. 647-658 [doi]
• Rank-Pairing HeapsBernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan. 659-670 [doi]
• 3.5-Way Cuckoo Hashing for the Price of 2-and-a-BitEric Lehman, Rina Panigrahy. 671-681 [doi]
• Hash, Displace, and CompressDjamal Belazzougui, Fabiano C. Botelho, Martin Dietzfelbinger. 682-693 [doi]
• Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial KernelsGeevarghese Philip, Venkatesh Raman, Somnath Sikdar. 694-705 [doi]
• Contraction Bidimensionality: The Accurate PictureFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. 706-717 [doi]
• Minimizing Movement: Fixed-Parameter TractabilityErik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx. 718-729 [doi]
• Storing a Compressed Function with Constant Time AccessJóhannes B. Hreinsson, Morten Krøyer, Rasmus Pagh. 730-741 [doi]
• Experimental Variations of a Theoretically Good Retrieval Data StructureMartin Aumüller, Martin Dietzfelbinger, Michael Rink. 742-751 [doi]
• Short Labels for Lowest Common Ancestors in TreesJohannes Fischer. 752-763 [doi]
• Disproof of the Neighborhood Conjecture with Implications to SATHeidi Gebauer. 764-775 [doi]
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hardChristoph Dürr, Flavio Guiñez, Martín Matamala. 776-787 [doi]