Table of Contents

• On the Capture Time of Cops and Robbers Game on a Planar GraphPhotchchara Pisantechakool, Xuehou Tan. 3-17 [doi]
• The Mixed Evacuation ProblemYosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa. 18-32 [doi]
• A Comprehensive Reachability Evaluation for Airline Networks with Multi-constraintsXiaotian You, Xiaofeng Gao, Yaru Dang, Guihai Chen, Xinglong Wang. 33-48 [doi]
• Approximation and Hardness Results for the Max k-Uncut ProblemPeng Zhang, Chenchen wu, Dachuan Xu, Xinghe Zhang. 49-61 [doi]
• On Strong Tree-BreadthArne Leitert, Feodor F. Dragan. 62-76 [doi]
• Computing a Tree Having a Small Vertex CoverTakuro Fukunaga, Takanori Maehara. 77-91 [doi]
• On the Approximability of Partial VC DimensionCristina Bazgan, Florent Foucaud, Florian Sikora. 92-106 [doi]
• Improved Precise Fault Diagnosis Algorithm for Hypercube-Like GraphsTai-Ling Ye, Dun-Wei Cheng, Sun-Yuan Hsieh. 107-112 [doi]
• Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity AnalysisRiccardo Dondi, Florian Sikora. 113-127 [doi]
• Total Dual Integrality of Triangle CoveringXujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang. 128-143 [doi]
• Time-Optimal Broadcasting of Multiple Messages in 1-in Port ModelPetr Gregor, Riste Skrekovski, Vida Vukasinovic. 144-158 [doi]
• Fast Searching on Complete k-partite GraphsYuan Xue, Boting Yang, Farong Zhong, Sandra Zilles. 159-174 [doi]
• Cliques in Regular Graphs and the Core-Periphery Problem in Social NetworksUlrik Brandes, Eugenia Holm, Andreas Karrenbauer. 175-186 [doi]
• Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing ProblemPawan Aurora, Monalisa Jena, Rajiv Raman. 187-201 [doi]
• An Introduction to Coding Sequences of GraphsShamik Ghosh, Raibatak Sen Gupta, Malay K. Sen. 202-215 [doi]
• Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity ProblemEtienne Birmelé, Fabien de Montgolfier, Léo Planche. 216-229 [doi]
• On the Complexity of Extracting Subtree with Keeping DistinguishabilityXianmin Liu, Zhipeng Cai, Dongjing Miao, Jianzhong Li. 230-240 [doi]
• Safe Sets in Graphs: Graph Classes and Structural ParametersRaquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu. 241-253 [doi]
• On Local Structures of Cubicity 2 GraphsSujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen. 254-269 [doi]
• Approximability of the Distance Independent Set Problem on Regular Graphs and Planar GraphsHiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano. 270-284 [doi]
• Algorithmic Aspects of Disjunctive Total Domination in GraphsChin Fu Lin, Sheng-Lung Peng. 285-293 [doi]
• Instance Guaranteed Ratio on Greedy Heuristic for Genome ScaffoldingClément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau. 294-308 [doi]
• Performing Multicut on Walkable Environments - Obtaining a Minimally Connected Multi-layered Environment from a Walkable EnvironmentArne Hillebrand, Marjan van den Akker, Roland Geraerts, Han Hoogeveen. 311-325 [doi]
• Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time BoundSung Eun Bae, Tong-Wook Shinn, Tadao Takaoka. 326-339 [doi]
• The Mixed Center Location ProblemYi Xu, Jigen Peng, Yinfeng Xu. 340-349 [doi]
• Constrained Light Deployment for Reducing Energy Consumption in BuildingsHuamei Tian, Kui Wu, Sue Whitesides, Cuiying Feng. 350-364 [doi]
• On the 2-Center Problem Under Convex Polyhedral Distance FunctionSergey Bereg. 365-377 [doi]
• Algorithms for Colourful Simplicial Depth and Medians in the PlaneOlga Zasenko, Tamon Stephen. 378-392 [doi]
• Realizability of Graphs as Triangle Cover Contact GraphsShaheena Sultana, Md. Saidur Rahman 0001. 393-407 [doi]
• A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract)Wei Ding, Ke Qiu. 408-420 [doi]
• On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphsSancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza. 423-437 [doi]
• Algorithmic Analysis for Ridesharing of Personal VehiclesQian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang. 438-452 [doi]
• On the Complexity of Bounded Deletion PropagationDongjing Miao, Yingshu Li, Xianmin Liu, Jianzhong Li. 453-462 [doi]
• On Residual Approximation in Solution Extension ProblemsMathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet. 463-476 [doi]
• On the Parameterized Parallel Complexity and the Vertex Cover ProblemFaisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan. 477-488 [doi]
• A Linear Potential Function for Pairing HeapsJohn Iacono, Mark V. Yagnatinsky. 489-504 [doi]
• Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic OrderKung-Jui Pai, Ro-Yu Wu, Jou-Ming Chang, Shun-Chieh Chang. 505-518 [doi]
• Optimal Speed Scaling with a Solar Cell - (Extended Abstract)Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs. 521-535 [doi]
• An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-SolutionsChenchen wu, Donglei Du, Dachuan Xu. 536-546 [doi]
• On-Line Pattern Matching on Uncertain Sequences and ApplicationsCarl Barton, Chang Liu, Solon P. Pissis. 547-562 [doi]
• Scheduling with Interjob Communication on Parallel ProcessorsJürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide, Sören Riechers. 563-577 [doi]
• Cost-Efficient Scheduling on Machines from the CloudAlexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers. 578-592 [doi]
• Strategic Online Facility LocationMaximilian Drees, Björn Feldkord, Alexander Skopalik. 593-607 [doi]
• An Efficient PTAS for Parallel Machine Scheduling with Capacity ConstraintsLin Chen 0011, Klaus Jansen, Wenchang Luo, Guochuan Zhang. 608-623 [doi]
• A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial SpaceNoriyuki Fujimoto. 624-638 [doi]
• An Incentive Mechanism for Selfish Bin CoveringWeian Li, Qizhi Fang, Wenjing Liu. 641-654 [doi]
• Congestion Games with Mixed ObjectivesMatthias Feldotto, Lennart Leder, Alexander Skopalik. 655-669 [doi]
• An Optimal Strategy for Static Black-Peg Mastermind with Two PegsGerold Jäger. 670-682 [doi]
• The Incentive Ratio in Exchange EconomiesIdo Polak. 685-692 [doi]
• w-Centroids and Least (w, l)-Central Subtrees in Weighted TreesErfang Shan, Liying Kang. 693-701 [doi]
• Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSOXiaohan He, Xiaoli Zeng, Liang Song, Hejiao Huang, Hongwei Du. 702-709 [doi]
• Convex Independence in Permutation GraphsWing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang Hsuan Liu. 710-717 [doi]
• The Connected p-Center Problem on Cactus GraphsChunsong Bai, Liying Kang, Erfang Shan. 718-725 [doi]
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment ProblemSourour Elloumi, Amélie Lambert. 726-734 [doi]
• Using Unified Model Checking to Verify HeapsXu Lu, Zhenhua Duan, Cong Tian. 735-743 [doi]
• A Filtering Heuristic for the Computation of Minimum-Volume Enclosing EllipsoidsLinus Källberg, Thomas Larsson. 744-753 [doi]
• Relaxations of Discrete Sets with Semicontinuous VariablesGustavo Angulo. 754-762 [doi]
• Unfolding the Core Structure of the Reciprocal Graph of a Massive Online Social NetworkBraulio Dumba, Zhi-Li Zhang. 763-771 [doi]
• Tackling Common Due Window Problem with a Two-Layered ApproachAbhishek Awasthi, Jörg Lässig, Thomas Weise, Oliver Kramer. 772-781 [doi]
• A Polynomial Time Solution for Permutation Scaffold FillingNan Liu, Peng Zou, Binhai Zhu. 782-789 [doi]