Table of Contents

• Stable Matching ProblemsKazuo Iwama. 1 [doi]
• Delaunay Meshing of SurfacesTamal K. Dey. 2 [doi]
• Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner s ContractionErik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi. 3-15 [doi]
• Branching and Treewidth Based Exact AlgorithmsFedor V. Fomin, Serge Gaspers, Saket Saurabh. 16-25 [doi]
• Deterministic Splitter Finding in a Stream with Constant Storage and GuaranteesTobias Lenz. 26-35 [doi]
• Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement RulesYefim Dinitz, Shay Solomon. 36-47 [doi]
• Flexible Word Design and Graph LabelingMing-Yang Kao, Manan Sanghi, Robert T. Schweller. 48-60 [doi]
• Frequency Allocation Problems for Linear Cellular NetworksJoseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu. 61-70 [doi]
• Finite-State Online Algorithms and Their Automated Competitive AnalysisTakashi Horiyama, Kazuo Iwama, Jun Kawahara. 71-80 [doi]
• Offline Sorting Buffers on LineRohit Khandekar, Vinayaka Pandit. 81-89 [doi]
• Approximating Tree Edit Distance Through String Edit DistanceTatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu. 90-99 [doi]
• A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan TreesKiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang. 100-110 [doi]
• Improved Approximation for Single-Sink Buy-at-BulkFabrizio Grandoni, Giuseppe F. Italiano. 111-120 [doi]
• Approximability of Partitioning Graphs with Supply and DemandTakehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki. 121-130 [doi]
• Convex Grid Drawings of Plane Graphs with Rectangular ContoursAkira Kamada, Kazuyuki Miura, Takao Nishizeki. 131-140 [doi]
• Algorithms on Graphs with Small Dominating TargetsDivesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta. 141-152 [doi]
• Efficient Algorithms for Weighted Rank-Maximal Matchings and Related ProblemsTelikepalli Kavitha, Chintan D. Shah. 153-162 [doi]
• On Estimating Path Aggregates over Streaming GraphsSumit Ganguly, Barna Saha. 163-172 [doi]
• Diamond Triangulations Contain Spanners of Bounded DegreeProsenjit Bose, Michiel H. M. Smid, Daming Xu. 173-182 [doi]
• Optimal Construction of the City Voronoi DiagramSang Won Bae, Jae-Hoon Kim, Kyung-Yong Chwa. 183-192 [doi]
• Relations Between Two Common Types of Rectangular TilingsYusu Wang. 193-202 [doi]
• Quality Tetrahedral Mesh Generation for MacromoleculesHo-Lun Cheng, Xinwei Shi. 203-212 [doi]
• On Approximating the TSP with Intersecting NeighborhoodsKhaled M. Elbassioni, Aleksei V. Fishkin, René Sitters. 213-222 [doi]
• Negation-Limited Complexity of Parity and InvertersKazuo Iwama, Hiroki Morizumi, Jun Tarui. 223-232 [doi]
• The Complexity of Quasigroup Isomorphism and the Minimum Generating Set ProblemVikraman Arvind, Jacobo Torán. 233-242 [doi]
• Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-CompleteMichael Krüger, Harald Hempel. 243-252 [doi]
• Parameterized Problems on Coincidence GraphsSylvain Guillemot. 253-266 [doi]
• On 2-Query Codeword Testing with Near-Perfect CompletenessVenkatesan Guruswami. 267-276 [doi]
• Poketree: A Dynamically Competitive Data Structure with Good Worst-Case PerformanceJussi Kujala, Tapio Elomaa. 277-288 [doi]
• Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with ApplicationsXiaodong Wu. 289-299 [doi]
• On Locating Disjoint Segments with Maximum Sum of DensitiesHsiao-Fei Liu, Kun-Mao Chao. 300-307 [doi]
• Two-Tier Relaxed HeapsAmr Elmasry, Claus Jensen, Jyrki Katajainen. 308-317 [doi]
• The Interval Liar GameBenjamin Doerr, Johannes Lengler, David Steurer. 318-327 [doi]
• How Much Independent Should Individual Contacts Be to Form a Small-World?Gennaro Cordasco, Luisa Gargano. 328-338 [doi]
• Faster Centralized Communication in Radio NetworksFerdinando Cicalese, Fredrik Manne, Qin Xin. 339-348 [doi]
• On the Runtime and Robustness of Randomized BroadcastingRobert Elsässer, Thomas Sauerwald. 349-358 [doi]
• Local Search in Evolutionary Algorithms: The Impact of the Local Search FrequencyDirk Sudholt. 359-368 [doi]
• Non-cooperative Facility Location and Covering GamesMartin Hoefer. 369-378 [doi]
• Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in TreesBinay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir. 379-388 [doi]
• Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with ApplicationsGeorge Tsaggouris, Christos D. Zaroliagis. 389-398 [doi]
• Algorithms for Computing Variants of the Longest Common Subsequence ProblemM. Sohel Rahman, Costas S. Iliopoulos. 399-408 [doi]
• Constructing Labeling Schemes Through Universal MatricesAmos Korman, David Peleg, Yoav Rodeh. 409-418 [doi]
• Making Arbitrary Graphs Transitively Orientable: Minimal Comparability CompletionsPinar Heggernes, Federico Mancini, Charis Papadopoulos. 419-428 [doi]
• Analyzing Disturbed Diffusion on NetworksHenning Meyerhenke, Thomas Sauerwald. 429-438 [doi]
• Exact Algorithms for Finding the Minimum Independent Dominating Set in GraphsChunmei Liu, Yinglei Song. 439-448 [doi]
• On Isomorphism and Canonization of Tournaments and HypertournamentsVikraman Arvind, Bireswar Das, Partha Mukhopadhyay. 449-459 [doi]
• Efficient Algorithms for the Sum Selection Problem and K Maximum Sums ProblemTien-Ching Lin, D. T. Lee. 460-473 [doi]
• Deterministic Random Walks on the Two-Dimensional GridBenjamin Doerr, Tobias Friedrich. 474-483 [doi]
• Improving Time and Space Complexity for Compressed Pattern MatchingShirou Maruyama, Hiromitsu Miyagawa, Hiroshi Sakamoto. 484-493 [doi]
• Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack ProblemsYunhong Zhou. 494-506 [doi]
• A Simple Message Passing Algorithm for Graph Partitioning ProblemsMikael Onsjö, Osamu Watanabe. 507-516 [doi]
• Minimal Interval Completion Through Graph ExplorationKarol Suchan, Ioan Todinca. 517-526 [doi]
• Balanced Cut Approximation in Random Geometric GraphsJosep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela. 527-536 [doi]
• Improved Algorithms for the Minmax-Regret 1-Center ProblemTzu-Chin Lin, Hung-I Yu, Biing-Feng Wang. 537-546 [doi]
• On Approximating the Maximum Simple Sharing ProblemDanny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu. 547-556 [doi]
• Approximation Scheme for Lowest Outdegree Orientation and Graph Density MeasuresLukasz Kowalik. 557-566 [doi]
• Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering ProblemsMingen Lin, Yang Yang, Jinhui Xu. 567-577 [doi]
• Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph RadiiGuido Proietti, Peter Widmayer. 578-587 [doi]
• Efficient Prüfer-Like Coding and Counting Labelled HypertreesSaswata Shannigrahi, Sudebkumar Prasant Pal. 588-597 [doi]
• Intuitive Algorithms and t-Vertex CoverJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith. 598-607 [doi]
• Politician s FirefightingAllan E. Scott, Ulrike Stege, Norbert Zeh. 608-617 [doi]
• Runtime Analysis of a Simple Ant Colony Optimization AlgorithmFrank Neumann, Carsten Witt. 618-627 [doi]
• Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance ProblemsAndris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis. 628-637 [doi]
• Resources Required for Preparing Graph StatesPeter Høyer, Mehdi Mhalla, Simon Perdrix. 638-649 [doi]
• Online Multi-path Routing in a MazeStefan Rührup, Christian Schindelhauer. 650-659 [doi]
• On the On-Line ::::k::::-Truck Problem with Benefit MaximizationWeimin Ma, Ke Wang. 660-669 [doi]
• Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission ChannelsPatrick Briest, Christian Gunia. 670-679 [doi]
• Online Packet Admission and Oblivious Routing in Sensor NetworksMohamed Aly, John Augustine. 680-689 [doi]
• Field Splitting Problems in Intensity-Modulated Radiation TherapyDanny Z. Chen, Chao Wang. 690-700 [doi]
• Shape Rectangularization Problems in Intensity-Modulated Radiation TherapyDanny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Ewa Misiolek, Chao Wang. 701-711 [doi]
• A New Approximation Algorithm for Multidimensional Rectangle TilingKatarzyna E. Paluch. 712-721 [doi]
• Tessellation of Quadratic ElementsScott E. Dillard, Vijay Natarajan, Gunther H. Weber, Valerio Pascucci, Bernd Hamann. 722-731 [doi]
• Effective Elections for Anonymous Mobile AgentsShantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro. 732-743 [doi]
• Gathering Asynchronous Oblivious Mobile Robots in a RingRalf Klasing, Euripides Markou, Andrzej Pelc. 744-753 [doi]
• Provably Secure Steganography and the Complexity of SamplingChristian Hundt, Maciej Liskiewicz, Ulrich Wölfel. 754-763 [doi]