Table of Contents

• Bubblesort and Juggling SequencesRonald L. Graham. 1 [doi]
• A Proof of the Molecular ConjectureNaoki Katoh. 2-3 [doi]
• Exact Algorithms for Dominating Clique ProblemsNicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos. 4-13 [doi]
• Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic ProgrammingTomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu. 14-23 [doi]
• Exact Algorithms for the Bottleneck Steiner Tree ProblemSang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa. 24-33 [doi]
• Exact Algorithms for Set Multicover and Multiset Multicover ProblemsQiang-Sheng Hua, Dongxiao Yu, Francis C. M. Lau, Yuexuan Wang. 34-44 [doi]
• Practical Discrete Unit Disk Cover Using an Exact Line-Separable AlgorithmFrancisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Alejandro Salinger. 45-54 [doi]
• Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular SystemsKazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi. 55-64 [doi]
• On Protein Structure Alignment under Distance ConstraintShuai Cheng Li, Yen Kaow Ng. 65-76 [doi]
• A Structural Lemma in 2-Dimensional Packing, and Its Implications on ApproximabilityNikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko. 77-86 [doi]
• Max-Coloring Paths: Tight Bounds and ExtensionsTelikepalli Kavitha, Julián Mestre. 87-96 [doi]
• Fréchet Distance Problems in Weighted RegionsYam Ki Cheung, Ovidiu Daescu. 97-111 [doi]
• The Complexity of Solving Stochastic Games on GraphsDaniel Andersson, Peter Bro Miltersen. 112-121 [doi]
• Computational Complexity of Cast PuzzlesChuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita. 122-131 [doi]
• New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex BodyAdrian Dumitrescu, Csaba D. Tóth. 132-141 [doi]
• Reconstructing Numbers from Pairwise Function ValuesShiteng Chen, Zhiyi Huang, Sampath Kannan. 142-152 [doi]
• Hilbert s Thirteenth Problem and Circuit ComplexityKristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen. 153-162 [doi]
• Interval Stabbing Problems in Small Integer RangesJens M. Schmidt. 163-172 [doi]
• Online Sorted Range ReportingGerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz. 173-182 [doi]
• Data Structures for Approximate Orthogonal Range CountingYakov Nekrich. 183-192 [doi]
• Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic TimeGerth Stølting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas. 193-202 [doi]
• Untangled Monotonic Chains and Adaptive Range SearchDiego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala. 203-212 [doi]
• Geodesic Spanners on Polyhedral SurfacesSanjiv Kapoor, Xiang-Yang Li. 213-223 [doi]
• Approximating Points by a Piecewise Linear Function: IDanny Z. Chen, Haitao Wang. 224-233 [doi]
• Approximating Points by a Piecewise Linear Function: II. Dealing with OutliersDanny Z. Chen, Haitao Wang. 234-243 [doi]
• Computing the Map of Geometric Minimal CutsJinhui Xu, Lei Xu, Evanthia Papadopoulou. 244-254 [doi]
• On the Camera Placement ProblemRudolf Fleischer, Yihui Wang. 255-264 [doi]
• Graph Orientations with Set Connectivity RequirementsTakuro Fukunaga. 265-274 [doi]
• A Linear Vertex Kernel for Maximum Internal Spanning TreeFedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé. 275-282 [doi]
• Geometric Minimum Diameter Minimum Cost Spanning Tree ProblemDae Young Seo, D. T. Lee, Tien-Ching Lin. 283-292 [doi]
• On Shortest Disjoint Paths in Planar GraphsYusuke Kobayashi, Christian Sommer 0002. 293-302 [doi]
• An Optimal Labeling for Node ConnectivityTai-Hsin Hsu, Hsueh-I Lu. 303-310 [doi]
• SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless NetworksPing Xu, Xiang-Yang Li. 311-320 [doi]
• 1-Bounded Space Algorithms for 2-Dimensional Bin PackingFrancis Y. L. Chin, Hing-Fung Ting, Yong Zhang. 321-330 [doi]
• On the Advice Complexity of Online ProblemsHans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke. 331-340 [doi]
• Online Knapsack Problems with Limited CutsXin Han, Kazuhisa Makino. 341-351 [doi]
• Online paging for flash memory devicesAnnamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu. 352-361 [doi]
• Shifting Strategy for Geometric Graphs without GeometryImran A. Pirwani. 362-371 [doi]
• Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online HeuristicsMinming Li. 372-382 [doi]
• Approximation Algorithms for Min-Max Path Cover Problems with Service Handling TimeZhou Xu, Liang Xu. 383-392 [doi]
• Minimum Covering with Travel CostSándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt. 393-402 [doi]
• Route-Enabling Graph Orientation ProblemsTakehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara. 403-412 [doi]
• Complexity of Approximating the Vertex Centroid of a PolyhedronKhaled M. Elbassioni, Hans Raj Tiwary. 413-422 [doi]
• Popular Matchings with Variable Job CapacitiesTelikepalli Kavitha, Meghana Nasre. 423-433 [doi]
• On the Tightness of the Buhrman-Cleve-Wigderson SimulationShengyu Zhang. 434-440 [doi]
• Bounds on Contention Management AlgorithmsJohannes Schneider, Roger Wattenhofer. 441-451 [doi]
• Algorithmic Folding ComplexityJean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara. 452-461 [doi]
• Min-Energy Scheduling for Aligned Jobs in Accelerate ModelWeiwei Wu, Minming Li, Enhong Chen. 462-472 [doi]
• Posi-modular Systems with Modulotone Requirements under Permutation ConstraintsToshimasa Ishii, Kazuhisa Makino. 473-482 [doi]
• Generalized Reduction to Compute Toric IdealsDeepanjan Kesh, Shashank K. Mehta. 483-492 [doi]
• Linear and Sublinear Time Algorithms for Basis of Abelian GroupsLi Chen, Bin Fu. 493-502 [doi]
• Good Programming in Transactional MemoryRaphael Eidenbenz, Roger Wattenhofer. 503-513 [doi]
• Induced Packing of Odd Cycles in a Planar GraphPetr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos. 514-523 [doi]
• On the Infinitesimal Rigidity of Bar-and-Slider FrameworksNaoki Katoh, Shin-ichi Tanigawa. 524-533 [doi]
• Exploration of Periodically Varying GraphsPaola Flocchini, Bernard Mans, Nicola Santoro. 534-543 [doi]
• Parameterized Complexity of Arc-Weighted Directed Steiner ProblemsJiong Guo, Rolf Niedermeier, Ondrej Suchý. 544-553 [doi]
• Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and DeliveriesYoshitaka Nakao, Hiroshi Nagamochi. 554-563 [doi]
• Minimum Cycle Bases of Weighted Outerplanar GraphsTsung-Hao Liu, Hsueh-I. Lu. 564-572 [doi]
• Bandwidth on AT-Free GraphsPetr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh. 573-582 [doi]
• Editing Graphs into Disjoint Unions of Dense ClustersJiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann. 583-593 [doi]
• A Certifying Algorithm for 3-Colorability of ::::P::::::5::-Free GraphsDaniel Bruce, Chính T. Hoàng, Joe Sawada. 594-604 [doi]
• Parameterizing Cut Sets in a Graph by the Number of Their ComponentsTakehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos. 605-615 [doi]
• Inapproximability of Maximal Strip RecoveryMinghui Jiang. 616-625 [doi]
• The Complexity of Perfect Matching Problems on Dense HypergraphsMarek Karpinski, Andrzej Rucinski, Edyta Szymanska. 626-636 [doi]
• On Lower Bounds for Constant Width Arithmetic CircuitsVikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan. 637-646 [doi]
• Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu EquilibriaXi Chen, Shang-Hua Teng. 647-656 [doi]
• The Identity Correspondence Problem and Its ApplicationsPaul Bell, Igor Potapov. 657-667 [doi]
• Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity GraphsAndrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska. 668-678 [doi]
• An Improved Approximation Algorithm for the Traveling Tournament ProblemDaisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui. 679-688 [doi]
• The Fault-Tolerant Facility Allocation ProblemShihong Xu, Hong Shen. 689-698 [doi]
• Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc NetworksMinming Li, Peng-Jun Wan, F. Frances Yao. 699-709 [doi]
• Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsLaurent Bulteau, Guillaume Fertin, Irena Rusu. 710-719 [doi]
• The Directed Hausdorff Distance between Imprecise Point SetsChristian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle. 720-729 [doi]
• Computing Multidimensional PersistenceGunnar Carlsson, Gurjeet Singh, Afra Zomorodian. 730-739 [doi]
• Locating an Obnoxious Line among Planar ObjectsDanny Z. Chen, Haitao Wang. 740-749 [doi]
• Finding Fullerene Patches in Polynomial TimePaul S. Bonsma, Felix Breuer. 750-759 [doi]
• Convex Drawings of Internally Triconnected Plane Graphs on ::::O::::(::::n:::::::2:::) GridsXiao Zhou, Takao Nishizeki. 760-770 [doi]
• A Self-stabilizing and Local Delaunay Graph ConstructionRiko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid. 771-780 [doi]
• Succinct Greedy Geometric Routing in the Euclidean PlaneMichael T. Goodrich, Darren Strash. 781-791 [doi]
• Electric Routing and Concurrent Flow CuttingJonathan A. Kelner, Petar Maymounkov. 792-801 [doi]
• A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-LengthsNaoyuki Kamiyama, Naoki Katoh. 802-811 [doi]
• Strong Robustness of Randomized Rumor Spreading ProtocolsBenjamin Doerr, Anna Huber, Ariel Levavi. 812-821 [doi]
• Data Structures for Range Median QueriesGerth Stølting Brodal, Allan Grønlund Jørgensen. 822-831 [doi]
• Deletion without Rebalancing in Multiway Search TreesSiddhartha Sen, Robert Endre Tarjan. 832-841 [doi]
• Counting in the Presence of Memory FaultsGerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave. 842-851 [doi]
• A Simple, Fast, and Compact Static DictionaryScott Schneider, Michael Spertus. 852-861 [doi]
• Reconstructing Polygons from Scanner DataTherese C. Biedl, Stephane Durocher, Jack Snoeyink. 862-871 [doi]
• Computing Large Matchings in Planar Graphs with Fixed Minimum DegreeRobert Franke, Ignaz Rutter, Dorothea Wagner. 872-881 [doi]
• Crossing-Free Acyclic Hamiltonian Path Completion for Planar ::::st::::-DigraphsTamara Mchedlidze, Antonios Symvonis. 882-891 [doi]
• Covering a Graph with a Constrained Forest (Extended Abstract)Cristina Bazgan, Basile Couëtoux, Zsolt Tuza. 892-901 [doi]
• Tri-Edge-Connectivity Augmentation for Planar Straight Line GraphsMarwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth. 902-912 [doi]
• Upward Star-Shaped Polyhedral GraphsSeok-Hee Hong, Hiroshi Nagamochi. 913-922 [doi]
• Conditional Hardness of Approximating Satisfiable Max 3CSP-::::q::::Linqing Tang. 923-932 [doi]
• The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)Tomoyuki Yamakami. 933-942 [doi]
• Of Choices, Failures and Asynchrony: The Many Faces of Set AgreementDan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers. 943-953 [doi]
• Step-Assembly with a Constant Number of Tile TypesJán Manuch, Ladislav Stacho, Christine Stoll. 954-963 [doi]
• Lower Bounds on Fast SearchingDonald Stanley, Boting Yang. 964-973 [doi]
• Approximation Algorithms for the Firefighter Problem: Cuts over Time and SubmodularityElliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy. 974-983 [doi]
• Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in ::::O::::(::::n:::::::1 + ::::epsilon:::::::) TimeQian-Ping Gu, Hisao Tamaki. 984-993 [doi]
• PTAS for ::::k::::-Tour Cover Problem on the Plane for Moderately Large Values of ::::k::::Anna Adamaszek, Artur Czumaj, Andrzej Lingas. 994-1003 [doi]
• Optimal Randomized Algorithm for the Density Selection ProblemTien-Ching Lin, D. T. Lee. 1004-1013 [doi]
• New Results on Simple Stochastic GamesDecheng Dai, Rong Ge. 1014-1023 [doi]
• Worst-Case and Smoothed Analysis of ::::k::::-Means Clustering with Bregman DivergencesBodo Manthey, Heiko Röglin. 1024-1033 [doi]
• Succinct Index for Dynamic Dictionary MatchingWing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter. 1034-1043 [doi]
• Range Non-overlapping IndexingHagai Cohen, Ely Porat. 1044-1053 [doi]
• Querying Two Boundary Points for Shortest Paths in a Polygonal DomainSang Won Bae, Yoshio Okamoto. 1054-1063 [doi]
• Pattern Matching for 321-Avoiding PermutationsSylvain Guillemot, Stéphane Vialette. 1064-1073 [doi]
• Folding a Better CheckerboardErik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang. 1074-1083 [doi]
• Finding All Approximate Gapped PalindromesPing-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao. 1084-1093 [doi]
• General Pseudo-random Generators from Weaker Models of ComputationGeorge Karakostas. 1094-1103 [doi]
• Random Generation and Enumeration of Bipartite Permutation GraphsToshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara. 1104-1113 [doi]
• A Combinatorial Algorithm for Horn ProgramsR. Chandrasekaran, K. Subramani. 1114-1123 [doi]
• Online Maximum Directed CutAmotz Bar-Noy, Michael Lampis. 1124-1133 [doi]
• Maintaining Nets and Net Trees under Incremental MotionMinkyoung Cho, David M. Mount, Eunhui Park. 1134-1143 [doi]
• Distributed Scheduling of Parallel Hybrid ComputationsShivali Agarwal, Ankur Narang, R. K. Shyamasundar. 1144-1154 [doi]
• I/O-Efficient Contour Tree SimplificationLars Arge, Morten Revsbæk. 1155-1165 [doi]
• Algorithms for Computing the Maximum Weight Region Decomposable into Elementary ShapesJinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama. 1166-1174 [doi]
• I/O and Space-Efficient Path Traversal in Planar GraphsCraig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh. 1175-1184 [doi]
• Improved Algorithms for Finding Consistent Superstrings Based on a New Graph ModelJin Wook Kim, Siwon Choi, Joong Chae Na, Jeong Seop Sim. 1185-1194 [doi]
• Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Chen, Ming-Yang Kao, Wei Kuan Shih, Tsan-sheng Hsu. 1195-1204 [doi]
• Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted TripletsSylvain Guillemot, Jesper Jansson, Wing-Kin Sung. 1205-1214 [doi]
• On Partitioning a Graph into Two Connected SubgraphsDaniël Paulusma, Johan M. M. van Rooij. 1215-1224 [doi]