Table of Contents

• Modeling and Analyzing Massive Terrain Data SetsPankaj K. Agarwal. 1 [doi]
• Coloring Triangle-Free Graphs on SurfacesZdenek Dvorak, Daniel Král, Robin Thomas. 2-4 [doi]
• Integer Representation and Counting in the Bit Probe ModelM. Ziaur Rahman, J. Ian Munro. 5-16 [doi]
• Minimum Degree OrderingsHiroshi Nagamochi. 17-28 [doi]
• Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected GraphsToshimasa Ishii. 29-40 [doi]
• Dynamic Distance Hereditary Graphs Using Split DecompositionEmeric Gioan, Christophe Paul. 41-51 [doi]
• Unifying Two Graph Decompositions with Modular DecompositionBinh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier. 52-64 [doi]
• Escaping Off-Line Searchers and a Discrete Isoperimetric TheoremPeter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin. 65-74 [doi]
• Geometric Spanner of SegmentsYang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh. 75-87 [doi]
• Dilation-Optimal Edge Deletion in Polygonal CyclesHee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang. 88-99 [doi]
• Unbounded-Error Classical and Quantum Communication ComplexityKazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita. 100-111 [doi]
• A Spectral Method for MAX2SAT in the Planted Solution ModelMasaki Yamamoto. 112-123 [doi]
• On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth MatricesUffe Flarup, Pascal Koiran, Laurent Lyaudet. 124-136 [doi]
• The 1-Versus-2 Queries Problem RevisitedRahul Tripathi. 137-147 [doi]
• Approximating the Crossing Number of Toroidal GraphsPetr Hlinený, Gelasio Salazar. 148-159 [doi]
• Width-Optimal Visibility Representations of Plane GraphsJia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen. 160-171 [doi]
• Computing Upward Topological Book Embeddings of Upward Planar DigraphsFrancesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis. 172-183 [doi]
• Algorithms for the Hypergraph and the Minor Crossing Number ProblemsMarkus Chimani, Carsten Gutwenger. 184-195 [doi]
• On Mixing and Edge Expansion Properties in Randomized BroadcastingThomas Sauerwald. 196-207 [doi]
• Linear Reconfiguration of Cube-Style Modular RobotsGreg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O Rourke, Suneeta Ramaswami, Vera Sacristán Adinolfi, Stefanie Wuhrer. 208-219 [doi]
• Fast Message Dissemination in Random Geometric Ad-Hoc Radio NetworksArtur Czumaj, Xin Wang. 220-231 [doi]
• Sensor Network Gossiping or How to Break the Broadcast Lower BoundMartin Farach-Colton, Miguel A. Mosteiro. 232-243 [doi]
• On the Complexity of the Most General Undirected Firing Squad Synchronization ProblemDarin Goldstein, Kojiro Kobayashi. 244-255 [doi]
• Capacitated Domination ProblemMong-Jen Kao, Chung-Shou Liao. 256-267 [doi]
• The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover NumberSounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian. 268-279 [doi]
• New Bounds for the Nearly Equitable Edge Coloring ProblemXuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick. 280-291 [doi]
• Approximation to the Minimum Cost Edge Installation ProblemEhab Morsy, Hiroshi Nagamochi. 292-303 [doi]
• Approximability of Packing Disjoint CyclesZachary Friggstad, Mohammad R. Salavatipour. 304-315 [doi]
• Succinct Representation of Labeled GraphsJérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro. 316-328 [doi]
• More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free CodingMordecai J. Golin, Jian Li. 329-340 [doi]
• Kinetic Maintenance of Mobile k-Centres on TreesStephane Durocher, Christophe Paul. 341-352 [doi]
• Checking Value-Sensitive Data Structures in Sublinear SpaceMichael T. Goodrich, Jonathan Z. Sun. 353-364 [doi]
• Manipulation in GamesRaphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer. 365-376 [doi]
• Using Nash Implementation to Achieve Better Frugality RatiosChien-Chung Huang, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang. 377-389 [doi]
• The Price of Nash Equilibria in Multicast Transmissions GamesVittorio Bilò. 390-401 [doi]
• An Efficient Algorithm for Enumerating Pseudo CliquesTakeaki Uno. 402-414 [doi]
• Fast Adaptive Diagnosis with a Minimum Number of TestsSamuel Guilbault, Andrzej Pelc. 415-426 [doi]
• Dynamic Structures for Top- ::::k:::: Queries on Uncertain DataJiang Chen, Ke Yi. 427-438 [doi]
• Separating Populations with Wide Data: A Spectral AnalysisAvrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou. 439-451 [doi]
• A Constant-Competitive Algorithm for Online OVSF Code AssignmentFrancis Y. L. Chin, Hing-Fung Ting, Yong Zhang. 452-463 [doi]
• Average-Case Analysis of Online Topological OrderingDeepak Ajwani, Tobias Friedrich. 464-475 [doi]
• Energy Efficient Deadline Scheduling in Two Processor SystemsTak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong. 476-487 [doi]
• On the Relative Dominance of Paging AlgorithmsReza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro. 488-499 [doi]
• I/O-Efficient Map Overlay and Point Location in Low-Density SubdivisionsMark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma. 500-511 [doi]
• Geometric Streaming Algorithms with a Sorting PrimitiveEric Y. Chen. 512-524 [doi]
• External Memory Range Reporting on a GridYakov Nekrich. 525-535 [doi]
• Approximate Range Searching in External MemoryMicha Streppel, Ke Yi. 536-548 [doi]
• Faster Treasure Hunt and Better Strongly Universal Exploration SequencesQin Xin. 549-560 [doi]
• Hardness and Approximation of Traffic GroomingOmid Amini, Stéphane Pérennes, Ignasi Sau. 561-573 [doi]
• Depth of Field and Cautious-Greedy Routing in Social NetworksDavid Barbella, George Kachergis, David Liben-Nowell, Anna Sallstrom, Ben Sowell. 574-586 [doi]
• Locating Facilities on a Network to Minimize Their Average Service RadiusDavide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer. 587-598 [doi]
• Faster Combinatorial Algorithms for Determinant and PfaffianAnna Urbanska. 599-608 [doi]
• A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria OptimizationYoshio Okamoto, Takeaki Uno. 609-620 [doi]
• The Parameterized Complexity of the Unique Coverage ProblemHannes Moser, Venkatesh Raman, Somnath Sikdar. 621-631 [doi]
• Bounded Tree-Width and CSP-Related ProblemsTommy Färnqvist, Peter Jonsson. 632-643 [doi]
• Covering Points by Unit Disks of Fixed LocationPaz Carmi, Matthew J. Katz, Nissan Lev-Tov. 644-655 [doi]
• Geodesic Disks and Clustering in a Simple PolygonMagdalene G. Borgelt, Marc J. van Kreveld, Jun Luo. 656-667 [doi]
• An ::::O:::: ( ::::n:::: :::2:::log ::::n:::: ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the PlaneAnil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi. 668-680 [doi]
• Optimal Triangulation with Steiner PointsBoris Aronov, Tetsuo Asano, Stefan Funke. 681-691 [doi]
• New Algorithm for Field Splitting in Radiation TherapyXiaodong Wu, Xin Dou, John E. Bayouth, John M. Buatti. 692-703 [doi]
• In-Place Algorithm for Image RotationTetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui. 704-715 [doi]
• Higher Order Voronoi Diagrams of Segments for VLSI Critical Area ExtractionEvanthia Papadopoulou. 716-727 [doi]
• Distributed Relationship Schemes for TreesCyril Gavoille, Arnaud Labourel. 728-738 [doi]
• Fast Evaluation of Union-Intersection ExpressionsPhilip Bille, Anna Pagh, Rasmus Pagh. 739-750 [doi]
• A Sub-cubic Time Algorithm for the ::::k:::: -Maximum Subarray ProblemSung Eun Bae, Tadao Takaoka. 751-762 [doi]
• Compressing Spatio-temporal TrajectoriesJoachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle. 763-775 [doi]
• Finding Popular PlacesMarc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle. 776-787 [doi]
• Maintaining Extremal Points and Its Applications to Deciding Optimal OrientationsSang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa. 788-799 [doi]
• The Monomial Ideal Membership Problem and Polynomial Identity TestingVikraman Arvind, Partha Mukhopadhyay. 800-811 [doi]
• On the Fault Testing for Reversible CircuitsSatoshi Tayu, Shigeru Ito, Shuichi Ueno. 812-821 [doi]
• The Space Complexity of ::::k:::: -Tree IsomorphismVikraman Arvind, Bireswar Das, Johannes Köbler. 822-833 [doi]
• Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data AnalysisHsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao. 834-845 [doi]
• Space Efficient Indexes for String Matching with Don t CaresTak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Siu-Ming Yiu. 846-857 [doi]
• 2-Stage Fault Tolerant Interval Group TestingFerdinando Cicalese, José Augusto Amgarten Quitzau. 858-868 [doi]
• Approximate String Matching with Swap and MismatchOhad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur. 869-880 [doi]
• Minimum Fill-In and Treewidth of Split+ ::::ke:::: and Split+ ::::kv:::: GraphsFederico Mancini. 881-892 [doi]
• Weighted Treewidth Algorithmic Techniques and ResultsEmgad H. Bachoore, Hans Leo Bodlaender. 893-903 [doi]
• Spanning Trees with Many Leaves in Regular Bipartite GraphsEmanuele G. Fusco, Angelo Monti. 904-914 [doi]
• Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related GraphsJiong Guo. 915-926 [doi]