Table of Contents

• Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?Tetsuo Asano. 1 [doi]
• Some Constrained Notions of PlanarityPeter Eades. 2 [doi]
• Reachability Problems on Directed GraphsRobert Endre Tarjan. 3 [doi]
• Greedy Construction of 2-Approximation Minimum Manhattan NetworkZeyu Guo, He Sun, Hong Zhu. 4-15 [doi]
• The Complexity of Minimum Convex ColoringFrank Kammer, Torsten Tholey. 16-27 [doi]
• On the Complexity of Reconfiguration ProblemsTakehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno. 28-39 [doi]
• Multiobjective Disk Cover Admits a PTASChristian Glaßer, Christian Reitwießner, Heinz Schmitz. 40-51 [doi]
• Data Stream Algorithms via Expander GraphsSumit Ganguly. 52-63 [doi]
• Improving the Competitive Ratio of the Online OVSF Code Assignment ProblemShuichi Miyazaki, Kazuya Okamoto. 64-76 [doi]
• Optimal Key Tree Structure for Deleting Two or More LeavesWeiwei Wu, Minming Li, Enhong Chen. 77-88 [doi]
• Comparing First-Fit and Next-Fit for Online Edge ColoringMartin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai. 89-99 [doi]
• Selecting Sums in ArraysGerth Stølting Brodal, Allan Grønlund Jørgensen. 100-111 [doi]
• Succinct and I/O Efficient Data Structures for Traversal in TreesCraig Dillabaugh, Meng He, Anil Maheshwari. 112-123 [doi]
• Space-Time Tradeoffs for Longest-Common-Prefix Array ComputationSimon J. Puglisi, Andrew Turpin. 124-135 [doi]
• Power Domination in O:::*:::(1.7548:::n:::) Using Reference Search TreesDaniel Raible, Henning Fernau. 136-147 [doi]
• The Isolation Game: A Game of DistancesYingchao Zhao, Wei Chen, Shang-Hua Teng. 148-158 [doi]
• On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical NetworksEvangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika. 159-170 [doi]
• The Complexity of Rationalizing MatchingsShankar Kalyanaraman, Christopher Umans. 171-182 [doi]
• A Game Theoretic Approach for Efficient Graph ColoringPanagiota N. Panagopoulou, Paul G. Spirakis. 183-195 [doi]
• Partitioning a Weighted Tree to Subtrees of Almost Uniform SizeTakehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki. 196-207 [doi]
• An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way CutsMingyu Xiao. 208-219 [doi]
• On the Algorithmic Effectiveness of Digraph Decompositions and Complexity MeasuresMichael Lampis, Georgia Kaouri, Valia Mitsou. 220-231 [doi]
• An Efficient Scaling Algorithm for the Minimum Weight Bibranching ProblemMaxim A. Babenko. 232-245 [doi]
• The Balanced Edge Cover ProblemYuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. 246-257 [doi]
• Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential AlgorithmLeizhen Cai, Elad Verbin, Lin Yang. 258-269 [doi]
• A New Algorithm for Finding Trees with Many LeavesJoachim Kneis, Alexander Langer, Peter Rossmanith. 270-281 [doi]
• Faster Parameterized Algorithms for Minimum Fill-InHans Leo Bodlaender, Pinar Heggernes, Yngve Villanger. 282-293 [doi]
• Graph Layout Problems Parameterized by Vertex CoverMichael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh. 294-305 [doi]
• A Linear Kernel for the k-Disjoint Cycle Problem on Planar GraphsHans Leo Bodlaender, Eelko Penninkx, Richard B. Tan. 306-317 [doi]
• How to Guard a Graph?Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer. 318-329 [doi]
• Tree Decontamination with Temporary ImmunityPaola Flocchini, Bernard Mans, Nicola Santoro. 330-341 [doi]
• Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel MovesGreg Aloupis, Sébastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristán Adinolfi, Stefanie Wuhrer. 342-353 [doi]
• Squaring the Circle with Weak Mobile RobotsYoann Dieudonné, Franck Petit. 354-365 [doi]
• Evaluation of General Set ExpressionsEhsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh. 366-377 [doi]
• Computing with Priced Information: When the Value Makes the PriceFerdinando Cicalese, Martin Milanic. 378-389 [doi]
• Deductive Inference for the Interiors and Exteriors of Horn TheoriesKazuhisa Makino, Hirotaka Ono. 390-401 [doi]
• Leaf Powers and Their Properties: Using the TreesMichael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle. 402-413 [doi]
• Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVDAli Civril, Malik Magdon-Ismail. 414-423 [doi]
• Minimizing Total Flow-Time: The Unrelated CaseNaveen Garg, Amit Kumar, V. N. Muralidhara. 424-435 [doi]
• Approximating the Volume of Unions and Intersections of High-Dimensional Geometric ObjectsKarl Bringmann, Tobias Friedrich. 436-447 [doi]
• Space-Efficient Informational RedundancyChristian Glaßer. 448-459 [doi]
• Minkowski Sum Selection and FindingCheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao. 460-471 [doi]
• Constructing the Simplest Possible Phylogenetic Network from TripletsLeo van Iersel, Steven Kelk. 472-483 [doi]
• New Results on Optimizing Rooted Triplets ConsistencyJaroslaw Byrka, Sylvain Guillemot, Jesper Jansson. 484-495 [doi]
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern MatchingM. Oguzhan Külekci. 496-506 [doi]
• Inducing Polygons of Line ArrangementsLudmila Scharf, Marc Scherfenberg. 507-519 [doi]
• Free-Form Surface Partition in 3-DDanny Z. Chen, Ewa Misiolek. 520-531 [doi]
• Approximate Nearest Neighbor Search under Translation Invariant Hausdorff DistanceChristian Knauer, Marc Scherfenberg. 532-543 [doi]
• Preprocessing Imprecise Points and Splitting TriangulationsMarc J. van Kreveld, Maarten Löffler, Joseph S. B. Mitchell. 544-555 [doi]
• Efficient Output-Sensitive Construction of Reeb GraphsHarish Doraiswamy, Vijay Natarajan. 556-567 [doi]
• Signature Theory in Holographic AlgorithmsJin-yi Cai, Pinyan Lu. 568-579 [doi]
• The Complexity of SPP Formula MinimizationDavid Buchfuhrer. 580-591 [doi]
• Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication ProtocolEric Goles Ch., Cedric Little, Ivan Rapaport. 592-604 [doi]
• Negation-Limited Inverters of Linear SizeHiroki Morizumi, Genki Suzuki. 605-614 [doi]
• 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-KnowledgeGiovanni Di Crescenzo, Helger Lipmaa. 615-627 [doi]
• A Complete Approximation Algorithm for Shortest Bounded-Curvature PathsJonathan Backer, David G. Kirkpatrick. 628-643 [doi]
• Detecting Commuting Patterns by Clustering SubtrajectoriesKevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo. 644-655 [doi]
• On the Stretch Factor of Convex Delaunay GraphsProsenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid. 656-667 [doi]
• Covering a Simple Polygon by Monotone DirectionsHee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin. 668-679 [doi]
• On the Stability of Web Crawling and Web SearchReid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng. 680-691 [doi]
• Average Update Times for Fully-Dynamic All-Pairs Shortest PathsTobias Friedrich, Nils Hebbinghaus. 692-703 [doi]
• Computing Frequency Dominators and Related ProblemsLoukas Georgiadis. 704-715 [doi]
• Computing Best Swaps in Optimal Tree SpannersShantanu Das, Beat Gfeller, Peter Widmayer. 716-727 [doi]
• Covering a Point Set by Two Disjoint RectanglesHee-Kap Ahn, Sang Won Bae. 728-739 [doi]
• Computing the Maximum Detour of a Plane Graph in Subquadratic TimeChristian Wulff-Nilsen. 740-751 [doi]
• Finding Long Paths, Cycles and CircuitsHarold N. Gabow, Shuxin Nie. 752-763 [doi]
• Computing Best and Worst Shortcuts of Graphs Embedded in Metric SpacesJun Luo, Christian Wulff-Nilsen. 764-775 [doi]
• On Labeled Traveling Salesman ProblemsBasile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis. 776-787 [doi]
• Navigating in a Graph by Aid of Its Spanning TreeFeodor F. Dragan, Martín Matamala. 788-799 [doi]
• Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling TimesBinay K. Bhattacharya, Paz Carmi, Yuzhuang Hu, Qiaosheng Shi. 800-811 [doi]
• Bidirectional Core-Based Routing in Dynamic Time-Dependent Road NetworksDaniel Delling, Giacomo Nannicini. 812-823 [doi]
• Bandwidth of Bipartite Permutation GraphsRyuhei Uehara. 824-835 [doi]
• König Deletion Sets and Vertex Covers above the Matching SizeSounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar. 836-847 [doi]
• Independent Sets of Maximum Weight in Apple-Free GraphsAndreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca. 848-858 [doi]
• Enumeration of Perfect Sequences of Chordal GraphYasuko Matsui, Ryuhei Uehara, Takeaki Uno. 859-870 [doi]
• From Tree-Width to Clique-Width: Excluding a Unit Interval GraphVadim V. Lozin. 871-882 [doi]
• New Results on the Most Significant Bit of Integer MultiplicationBeate Bollig, Jochen Klump. 883-894 [doi]
• Sorting with Complete Networks of StacksFelix G. König, Marco E. Lübbecke. 895-906 [doi]
• Quantum Query Complexity of Boolean Functions with Small On-SetsAndris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita. 907-918 [doi]
• Unbounded-Error Quantum Query ComplexityAshley Montanaro, Harumichi Nishimura, Rudy Raymond. 919-930 [doi]
• Super-Exponential Size Advantage of Quantum Finite Automata with Mixed StatesRusins Freivalds. 931-942 [doi]