Table of Contents

• Improved Algorithms for the Evacuation Route Planning ProblemGopinath Mishra, Subhra Mazumdar, Arindam Pal. 3-19 [doi]
• Improved MaxSAT Algorithms for Instances of Degree 3Chao Xu 0010, Jianer Chen, Jianxin Wang. 20-30 [doi]
• Directed Pathwidth and PalletizersFrank Gurski, Jochen Rethmann, Egon Wanke. 31-44 [doi]
• Black and White Bin Packing RevisitedJing Chen, Xin Han, Wolfgang W. Bein, Hing-Fung Ting. 45-59 [doi]
• Local Search Algorithms for k-Median and k-Facility Location Problems with Linear PenaltiesYishui Wang, Dachuan Xu, Donglei Du, Chenchen wu. 60-71 [doi]
• A (5.83+\epsilon ) ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear PenaltiesYicheng Xu, Dachuan Xu, Donglei Du, Chenchen wu. 72-81 [doi]
• Variants of Multi-resource Scheduling Problems with Equal Processing TimesHamed Fahimi, Claude-Guy Quimper. 82-97 [doi]
• The Discrete and Mixed Minimax 2-Center ProblemYi Xu, Jigen Peng, Yinfeng Xu, Binhai Zhu. 101-109 [doi]
• Approximation Algorithms for Generalized MST and TSP in Grid ClustersBinay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol. 110-125 [doi]
• Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined LineApurva Mudgal, Supantha Pandit. 126-137 [doi]
• Optimal Self-assembly of Finite Shapes at Temperature 1 in 3DDavid Furcy, Scott M. Summers. 138-151 [doi]
• Line Segment Covering of Cells in ArrangementsMatias Korman, Sheung-Hung Poon, Marcel Roeloffzen. 152-162 [doi]
• An Improved On-line Strategy for Exploring Unknown PolygonsXuehou Tan, Qi Wei. 163-177 [doi]
• Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing ProblemMichael Khachay, Helen Zaytseva. 178-190 [doi]
• A Fast and Effective Heuristic for Discovering Small Target Sets in Social NetworksGennaro Cordasco, Luisa Gargano, Marco Mecchia, Adele A. Rescigno, Ugo Vaccaro. 193-208 [doi]
• An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillarAlejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart. 209-220 [doi]
• A Sensor Deployment Strategy in Bus-Based Hybrid Ad-Hoc NetworksHongwei Du, Rongrong Zhu, Xiaohua Jia, Chuang Liu. 221-235 [doi]
• New Insight into 2-Community Structures in Graphs with Applications in Social NetworksCristina Bazgan, Janka Chlebíková, Thomas Pontoizeau. 236-250 [doi]
• WDCS: A Weight-Based Distributed Coordinate SystemYaNing Liu, Hongwei Du, Qiang Ye. 251-260 [doi]
• Adaptive Scheduling Over a Wireless Channel Under Constrained JammingAntonio Fernández Anta, Chryssis Georgiou, Elli Zavou. 261-278 [doi]
• Metric and Distributed On-Line Algorithm for Minimizing Routing Interference in Wireless Sensor NetworksKejia Zhang, Qilong Han, Zhipeng Cai, Guisheng Yin, Junyu Lin. 279-292 [doi]
• Distributed Algorithm for Mending Barrier Gaps via Sensor Rotation in Wireless Sensor NetworksYueshi Wu, Mihaela Cardei. 293-304 [doi]
• A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time DeadlineDan Yang, Xiaohan He, Liang Song, Hejiao Huang, Hongwei Du. 307-318 [doi]
• Indoor Localization via Candidate Fingerprints and Genetic AlgorithmZeqi Song, Hongwei Du, Hejiao Huang, Chuang Liu. 319-333 [doi]
• On Clustering Without Replication in Combinatorial CircuitsZola Donovan, Vahan Mkrtchyan, K. Subramani. 334-347 [doi]
• On Replica Placement in High-Availability Storage Under Correlated FailureK. Alex Mills, R. Chandrasekaran, Neeraj Mittal. 348-363 [doi]
• Observing the State of a Smart Grid Using Bilevel ProgrammingSonia Toubaline, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti. 364-376 [doi]
• Optimizing Static and Adaptive Probing Schedules for Rapid Event DetectionAhmad Mahmoody, Evgenios M. Kornaropoulos, Eli Upfal. 377-391 [doi]
• Vertex Cover in Conflict Graphs: Complexity and a Near Optimal ApproximationDongjing Miao, Jianzhong Li, Xianmin Liu, Hong Gao. 395-408 [doi]
• On the Complexity of Scaffolding Problems: From Cliques to Sparse GraphsMathias Weller, Annie Chateau, Rodolphe Giroudeau. 409-423 [doi]
• Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion ProblemsN. R. Aravind, R. B. Sandeep, Naveen Sivadasan. 424-438 [doi]
• Multicast Network Design Game on a RingAkaki Mamageishvili, Matús Mihalák. 439-451 [doi]
• Extreme Witnesses and Their ApplicationsAndrzej Lingas, Mia Persson. 452-466 [doi]
• Orbital Independence in Symmetric Mathematical ProgramsGustavo Dias, Leo Liberti. 467-480 [doi]
• Symbolic Model Checking for Alternating Projection Temporal LogicHaiyang Wang, Zhenhua Duan, Cong Tian. 481-495 [doi]
• An I/O Efficient Algorithm for Minimum Spanning TreesAlka Bhushan, Sajith Gopalan. 499-509 [doi]
• The Connected p-Centdian Problem on Block GraphsLiying Kang, Jianjie Zhou, Erfang Shan. 510-520 [doi]
• Searching for (near) Optimal CodesXueliang Li, Yaping Mao, Meiqin Wei, Ruihu Li. 521-536 [doi]
• Dynamic Single-Source Shortest Paths in Erdös-Rényi Random GraphsWei Ding, Ke Qiu. 537-550 [doi]
• Trees, Paths, Stars, Caterpillars and SpidersMinghui Jiang. 551-565 [doi]
• Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified SubsetWenbin Chen, Lingxi Peng, Jianxiong Wang, FuFang Li, Maobin Tang. 566-573 [doi]
• Deleting Edges to Restrict the Size of an Epidemic: A New Application for TreewidthJessica Enright, Kitty Meeks. 574-585 [doi]
• Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph ProblemsYuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu. 586-600 [doi]
• The Influence of Preprocessing on Steiner Tree ApproximationsStephan Beyer, Markus Chimani. 601-616 [doi]
• Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic TimeDanjun Huang, Ko-Wei Lih, Wei-Fan Wang. 617-632 [doi]
• Maximum Independent Set on B_1 B 1 -VPG GraphsAbhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian. 633-646 [doi]
• Approximating the Restricted 1-Center in GraphsWei Ding, Ke Qiu. 647-659 [doi]
• The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of GraphsEunjeong Yi. 660-675 [doi]
• Edge-Disjoint Packing of Stars and CyclesMinghui Jiang, Ge Xia, Yong Zhang. 676-687 [doi]
• Dynamic Minimum Bichromatic Separating CircleBogdan Armaselu, Ovidiu Daescu. 688-697 [doi]
• Searching Graph Communities by Modularity Maximization via Convex OptimizationYuqing Zhu, Chengyu Sun, Deying Li, Cong Chen, Yin-Feng Xu. 701-708 [doi]
• A New Tractable Case of the QAP with a Robinson MatrixEranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger. 709-720 [doi]
• An Online Model of Berth and Quay Crane Integrated Allocation in Container TerminalsFeifeng Zheng, Longliang Qiao, Ming Liu. 721-730 [doi]
• On the Minimal Constraint Satisfaction Problem: Complexity and GenerationGuillaume Escamocher, Barry O'Sullivan. 731-745 [doi]
• Algebraic Theory on Shortest Paths for All FlowsTadao Takaoka. 746-757 [doi]
• The Minimum Acceptable Violation Ranking of Alternatives from Voters' Ordinal RankingsKelin Luo, Yinfeng Xu. 758-770 [doi]
• Listing Center Strings Under the Edit Distance MetricHiromitsu Maji, Taisuke Izumi. 771-782 [doi]
• Online Scheduling for Electricity Cost in Smart GridXin Feng, Yinfeng Xu, Feifeng Zheng. 783-793 [doi]
• Proportional Cost Buyback Problem with Weight BoundsYasushi Kawase, Xin Han, Kazuhisa Makino. 794-808 [doi]