Table of Contents

• Efficient Compression of Web GraphsYasuhito Asano, Yuya Miyawaki, Takao Nishizeki. 1-11 [doi]
• Damaged BZip Files Are Difficult to RepairChristian Hundt, Ulf Ochsenfahrt. 12-21 [doi]
• Isoperimetric Problem and Meta-Fibonacci SequencesB. V. S. Bharadwaj, L. Sunil Chandran, Anita Das. 22-30 [doi]
• On the Complexity of Equilibria Problems in Angel-Daemon GamesJoaquim Gabarró, Alina García, Maria J. Serna. 31-40 [doi]
• Average-Case Competitive Analyses for One-Way TradingHiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi. 41-51 [doi]
• On the Monotonicity of Weak SearchingBoting Yang, Yi Cao. 52-61 [doi]
• VC Dimension Bounds for Analytic Algebraic ComputationsJosé Luis Montaña, Luis Miguel Pardo, Mar Callau. 62-71 [doi]
• Resource Bounded Frequency Computations with Three ErrorsUlrich Hertrampf, Christoph Minnameier. 72-81 [doi]
• A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box ModelBin Fu, Zhixiang Chen. 82-91 [doi]
• Smallest Formulas for Parity of 2kJun Tarui. 92-99 [doi]
• Counting Polycubes without the Dimensionality CurseGadi Aleksandrowicz, Gill Barequet. 100-109 [doi]
• Polychromatic Colorings of n-Dimensional Guillotine-PartitionsBalázs Keszegh. 110-118 [doi]
• The Computational Complexity of Link BuildingMartin Olsen. 119-129 [doi]
• Improved Parameterized Algorithms for Weighted 3-Set PackingJianxin Wang, Qilong Feng. 130-139 [doi]
• Structural Identifiability in Low-Rank Matrix FactorizationEpameinondas Fritzilas, Yasmin A. Rios-Solis, Sven Rahmann. 140-148 [doi]
• Complexity of Counting the Optimal SolutionsMiki Hermann, Reinhard Pichler. 149-159 [doi]
• The Orbit Problem Is in the GapL HierarchyVikraman Arvind, T. C. Vijayaraghavan. 160-169 [doi]
• Quantum Separation of Local Search and Fixed Point ComputationXi Chen, Xiaoming Sun, Shang-Hua Teng. 170-179 [doi]
• Multi-party Quantum Communication Complexity with Routed MessagesSeiichiro Tani, Masaki Nakanishi, Shigeru Yamashita. 180-190 [doi]
• Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying AssignmentsTakayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka. 191-203 [doi]
• Approximating Alternative SolutionsMichael Krüger, Harald Hempel. 204-214 [doi]
• Dimensions of Points in Self-similar FractalsJack H. Lutz, Elvira Mayordomo. 215-224 [doi]
• Visual Cryptography on GraphsSteve Lu, Daniel Manchala, Rafail Ostrovsky. 225-234 [doi]
• Algebraic Cryptanalysis of CTRU CryptosystemNitin Vats. 235-244 [doi]
• Detecting Community Structure by Network VectorizationWei Ren, Guiying Yan, Guohui Lin, Caifeng Du, Xiaofeng Han. 245-254 [doi]
• Quasi-bicliques: Complexity and Binding PairsXiaowen Liu, Jinyan Li, Lusheng Wang. 255-264 [doi]
• Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene SynthesisAnne Condon, Ján Manuch, Chris Thachuk. 265-275 [doi]
• Genome Halving under DCJ RevisitedJulia Mixtacki. 276-286 [doi]
• Haplotype Inferring Via Galled-Tree Networks Is NP-CompleteArvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao. 287-298 [doi]
• Adjacent Swaps on StringsBhadrachalam Chitturi, Ivan Hal Sudborough, Walter Voit, Xuerong Feng. 299-308 [doi]
• Efficient Algorithms for SNP Haplotype Block Selection ProblemsYaw-Ling Lin. 309-318 [doi]
• Sequence Alignment Algorithms for Run-Length-Encoded StringsGuan-Shieng Huang, Jia Jie Liu, Yue-Li Wang. 319-330 [doi]
• A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular PermutationsXiaowen Lou, Daming Zhu. 331-341 [doi]
• A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GIMinzhu Xie, Jianxin Wang, Jianer Chen. 342-351 [doi]
• Voronoi Diagram of Polygonal Chains under the Discrete Fréchet DistanceSergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu. 352-362 [doi]
• On Center Regions and Balls Containing Many PointsShakhar Smorodinsky, Marek Sulovský, Uli Wagner. 363-373 [doi]
• On Unfolding 3D Lattice Polygons and 2D Orthogonal TreesSheung-Hung Poon. 374-384 [doi]
• New Algorithms for Online Rectangle Filling with k-LookaheadHaitao Wang, Amitabh Chaudhary, Danny Z. Chen. 385-394 [doi]
• Geometric Spanner of Objects under L1 DistanceYongding Zhu, Jinhui Xu, Yang Yang, Naoki Katoh, Shin-ichi Tanigawa. 395-404 [doi]
• Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner ConstraintsSeok-Hee Hong, Hiroshi Nagamochi. 405-414 [doi]
• A New Characterization of P6-Free GraphsPim van t Hof, Daniël Paulusma. 415-424 [doi]
• Maximum Connected Domatic Partition of Directed Path Graphs with Single JunctionMasaya Mito, Satoshi Fujita. 425-433 [doi]
• Efficient Algorithms for the kSmallest Cuts EnumerationLi-Pu Yeh, Biing-Feng Wang. 434-443 [doi]
• Covering Directed Graphs by In-TreesNaoyuki Kamiyama, Naoki Katoh. 444-457 [doi]
• On Listing, Sampling, and Counting the Chordal Graphs with Edge ConstraintsShuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno. 458-467 [doi]
• Probe Ptolemaic GraphsDavid B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng. 468-477 [doi]
• Diagnosability of Two-Matching Composition NetworksSun-Yuan Hsieh, Chia-Wei Lee. 478-486 [doi]
• The Iterated Restricted Immediate Snapshot ModelSergio Rajsbaum, Michel Raynal, Corentin Travers. 487-497 [doi]
• Finding Frequent Items in a Turnstile Data StreamRegant Y. S. Hung, Kwok Fai Lai, Hing-Fung Ting. 498-509 [doi]
• A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk ConstraintsHung Q. Ngo, Yang Wang, Anh Le. 510-520 [doi]
• Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion CostWeiwei Wu, Minming Li, Enhong Chen. 521-530 [doi]
• Throughput Maximization with Traffic Profile in Wireless Mesh NetworkHejiao Huang, Yun Peng. 531-540 [doi]
• Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power AdjustmentDeying Li, Hongwei Du, Lin Liu, Scott C.-H. Huang. 541-550 [doi]
• (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk GraphsXiaofeng Gao, Yaochun Huang, Zhao Zhang, Weili Wu. 551-557 [doi]
• Spectrum Bidding in Wireless Networks and RelatedXiang-Yang Li, Ping Xu, ShaoJie Tang, Xiaowen Chu. 558-567 [doi]
• (1+rho)-Approximation for Selected-Internal Steiner Minimum TreeXianyue Li, Yaochun Huang, Feng Zou, Donghyun Kim, Weili Wu. 568-576 [doi]
• Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex CapacitiesXianchao Zhang, Weifa Liang, Guoliang Chen. 577-586 [doi]
• Spreading MessagesChing-Lueh Chang, Yuh-Dauh Lyuu. 587-599 [doi]
• On Some City Guarding ProblemsLichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou. 600-610 [doi]
• Optimal Insertion of a Segment Highway in a City MetricMatias Korman, Takeshi Tokuyama. 611-620 [doi]
• Approximating the Generalized Capacitated Tree-Routing ProblemEhab Morsy, Hiroshi Nagamochi. 621-630 [doi]
• Column Generation Algorithms for the Capacitated m-Ring-Star ProblemEdna A. Hoshino, Cid C. de Souza. 631-641 [doi]
• Two-Agent Scheduling with Linear Deteriorating Jobs on a Single MachinePeng Liu, Lixin Tang. 642-650 [doi]
• A Two-Stage Flexible Flowshop Problem with DeteriorationHua Gong, Lixin Tang. 651-660 [doi]
• A Lower Bound for the On-Line Preemptive Machine Scheduling with lpTianping Shuai, Donglei Du. 661-669 [doi]
• The Coordination of Two Parallel Machines Scheduling and Batch DeliveriesHua Gong, Lixin Tang. 670-677 [doi]