Table of Contents

• Puzzles, Art, and Magic with AlgorithmsErik D. Demaine. 1 [doi]
• The ABCs of AVDs: Geometric Retrieval Made SimpleDavid M. Mount. 2 [doi]
• Pareto Optimality in House Allocation ProblemsDavid J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn. 3-15 [doi]
• Property-Preserving Data ReconstructionNir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu. 16-27 [doi]
• On the Monotone Circuit Complexity of Quadratic Boolean FunctionsKazuyuki Amano, Akira Maruoka. 28-40 [doi]
• Generalized Function MatchingAmihood Amir, Igor Nor. 41-52 [doi]
• Approximate Distance Oracles for Graphs with Dense ClustersMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos. 53-64 [doi]
• Multicriteria Global Minimum CutsAmitai Armon, Uri Zwick. 65-76 [doi]
• Polyline Fitting of Planar Points Under Min-sum CriteriaBoris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama. 77-88 [doi]
• A Generalization of Magic Squares with Applications to Digital HalftoningBoris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno. 89-100 [doi]
• Voronoi Diagrams with a Transportation Network on the Euclidean PlaneSang Won Bae, Kyung-Yong Chwa. 101-112 [doi]
• Structural Alignment of Two RNA Sequences with Lagrangian RelaxationMarkus Bauer, Gunnar W. Klau. 113-123 [doi]
• Poly-APX- and PTAS-Completeness in Standard and Differential ApproximationCristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos. 124-136 [doi]
• Efficient Algorithms for k Maximum SumsFredrik Bengtsson, Jingsen Chen. 137-148 [doi]
• Equipartitions of Measures by 2-FansSergey Bereg. 149-158 [doi]
• Augmenting the Edge-Connectivity of a Spider TreeDavide Bilò, Guido Proietti. 159-171 [doi]
• On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless NetworksVittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli. 172-183 [doi]
• Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)Ulrik Brandes, Jürgen Lerner. 184-195 [doi]
• Flexibility of Steiner Trees in Uniform Orientation MetricsMarcus Brazil, Pawel Winter, Martin Zachariasen. 196-208 [doi]
• Random Access to Advice Strings and Collapsing ResultsJin-yi Cai, Osamu Watanabe. 209-220 [doi]
• Bounding the Payment of Approximate Truthful MechanismsGruia Calinescu. 221-233 [doi]
• The Polymatroid Steiner ProblemsGruia Calinescu, Alexander Zelikovsky. 234-245 [doi]
• Geometric Optimization Problems Over Sliding WindowsTimothy M. Chan, Bashir S. Sadjad. 246-258 [doi]
• On-Line Windows Scheduling of Temporary ItemsWun-Tat Chan, Prudence W. H. Wong. 259-270 [doi]
• Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation TherapyDanny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu. 271-281 [doi]
• An Efficient Exact Algorithm for the Minimum Ultrametric Tree ProblemHsin-Fu Chen, Maw-Shang Chang. 282-293 [doi]
• On the Range Maximum-Sum Segment Query ProblemKuan-Yu Chen, Kun-Mao Chao. 294-305 [doi]
• An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow GraphsXujin Chen, Wenan Zang. 306-317 [doi]
• Efficient Job Scheduling Algorithms with Multi-type ContentionsZhenming Chen, Vikas Singh, Jinhui Xu. 318-329 [doi]
• Superimposing Voronoi Complexes for Shape DeformationChao Chen, Ho-Lun Cheng. 330-341 [doi]
• On Partial Lifting and the Elliptic Curve Discrete Logarithm ProblemQi Cheng, Ming-Deh A. Huang. 342-351 [doi]
• Guarding Art Galleries by Guarding WitnessesKyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin. 352-363 [doi]
• On p-Norm Based Locality Measures of Space-Filling CurvesHo-Kwok Dai, Hung-Chi Su. 364-376 [doi]
• Composability of Infinite-State Activity AutomataZhe Dang, Oscar H. Ibarra, Jianwen Su. 377-388 [doi]
• Error Compensation in Leaf Root ProblemsMichael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier. 389-401 [doi]
• On Compact and Efficient Routing in Certain Graph ClassesFeodor F. Dragan, Irina Lomonosov. 402-414 [doi]
• Randomized Insertion and Deletion in Point Quad TreesAmalia Duch. 415-426 [doi]
• Diagnosis in the Presence of Intermittent FaultsBin Fu, Richard Beigel. 427-441 [doi]
• Three-Round Adaptive Diagnosis in Binary n-CubesSatoshi Fujita, Toru Araki. 442-451 [doi]
• Fast Algorithms for Comparison of Similar Unordered TreesDaiji Fukagawa, Tatsuya Akutsu. 452-463 [doi]
• GCD of Random Linear FormsJoachim von zur Gathen, Igor Shparlinski. 464-469 [doi]
• On the Hardness and Easiness of Random 4-SAT FormulasAndreas Goerdt, André Lanka. 470-483 [doi]
• Minimum Common String Partition Problem: Hardness and ApproximationsAvraham Goldstein, Petr Kolman, Jie Zheng. 484-495 [doi]
• On the Complexity of Network SynchronizationDarin Goldstein, Kojiro Kobayashi. 496-507 [doi]
• Counting Spanning Trees and Other Structures in Non-constant-jump Circulant GraphsMordecai J. Golin, Yiu-Cho Leung, Yajun Wang. 508-521 [doi]
• Adaptive Spatial Partitioning for Multidimensional Data StreamsJohn Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth. 522-533 [doi]
• Paired Pointset TraversalPeter Hui, Marcus Schaefer. 534-544 [doi]
• Approximated Two Choices in Randomized Load BalancingKazuo Iwama, Akinori Kawachi. 545-557 [doi]
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and CountingJoseph JáJá, Christian Worm Mortensen, Qingmin Shi. 558-568 [doi]
• Local Gapped Subforest Alignment and Its Application in Finding RNA Structural MotifsJesper Jansson, Ngo Trung Hieu, Wing-Kin Sung. 569-580 [doi]
• The Maximum Agreement of Two Nested Phylogenetic NetworksJesper Jansson, Wing-Kin Sung. 581-593 [doi]
• Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise ComputationsJerzy W. Jaromczyk, Zbigniew Lonc. 594-605 [doi]
• New Bounds on Map Labeling with Circular LabelsMinghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu. 606-617 [doi]
• Optimal Buffer Management via Resource AugmentationJae-Hoon Kim. 618-628 [doi]
• Oriented Paths in Mixed GraphsEgon Wanke, Rolf Kötter. 629-643 [doi]
• Polynomial Deterministic Rendezvous in Arbitrary GraphsDariusz R. Kowalski, Andrzej Pelc. 644-656 [doi]
• Distributions of Points and Large QuadranglesHanno Lefmann. 657-668 [doi]
• Cutting Out Polygons with Lines and RaysOvidiu Daescu, Jun Luo. 669-680 [doi]
• Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix ArraysVeli Mäkinen, Gonzalo Navarro, Kunihiko Sadakane. 681-692 [doi]
• Inner Rectangular Drawings of Plane GraphsKazuyuki Miura, Hiroki Haga, Takao Nishizeki. 693-704 [doi]
• Approximating the Minmax Subtree Cover Problem in a CactusHiroshi Nagamochi, Taizo Kawada. 705-716 [doi]
• Boundary-Optimal Triangulation FloodingRichard J. Nowakowski, Norbert Zeh. 717-728 [doi]
• Exact Computation of Polynomial Zeros Expressible by Square RootsTimo von Oertzen. 729-741 [doi]
• Many-to-many Disjoint Path Covers in a Graph with Faulty ElementsJung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim. 742-753 [doi]
• An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary TreesZeshan Peng, Hing-Fung Ting. 754-765 [doi]
• Planning the Transportation of Multiple Commodities in Bidirectional Pipeline NetworksArtur Alves Pessoa. 766-777 [doi]
• Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case SearchArtur Alves Pessoa, Eduardo Sany Laber, Críston de Souza. 778-792 [doi]
• Dynamic Tree Cross ProductsMarcus Raitner. 793-804 [doi]
• Spanners, Weak Spanners, and Power Spanners for Wireless NetworksChristian Schindelhauer, Klaus Volbert, Martin Ziegler. 805-821 [doi]
• Techniques for Indexing and Querying Temporal Observations for a Collection of ObjectsQingmin Shi, Joseph JáJá. 822-834 [doi]
• Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse MatricesJinsong Tan, Louxin Zhang. 835-846 [doi]
• The Two-Guard Problem Revisited and Its GeneralizationXuehou Tan. 847-858 [doi]
• Canonical Data Structure for Interval Probe GraphsRyuhei Uehara. 859-870 [doi]
• Efficient Algorithms for the Longest Path ProblemRyuhei Uehara, Yushi Uno. 871-883 [doi]
• Randomized Algorithms for Motif DetectionLusheng Wang, Liang Dong, Hui Fan. 884-895 [doi]
• Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved ApproximationJérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier. 896-907 [doi]
• Sweeping Graphs with Large Clique NumberBoting Yang, Danny Dyer, Brian Alspach. 908-920 [doi]
• A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge LengthsUri Zwick. 921-932 [doi]