Table of Contents

• Exact Algorithms for the Bounded Repetition Longest Common Subsequence ProblemYuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima. 1-12 [doi]
• Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five ElementsMirza Galib Anwarul Husain Baig, Deepanjan Kesh. 13-25 [doi]
• Critical Rows of Almost-Factorable MatricesPeter Ballen. 26-38 [doi]
• Minimum-Width Drawings of Phylogenetic TreesJuan José Besa Vial, Michael T. Goodrich, Timothy Johnson, Martha C. Osegueda. 39-55 [doi]
• Balanced Connected Subgraph Problem in Geometric Intersection GraphsSujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy. 56-68 [doi]
• Approximating Bounded Job Start Scheduling with Application in Royal Mail Deliveries Under UncertaintyJeremy T. Bradley, Dimitrios Letsios, Ruth Misener, Natasha Page. 69-81 [doi]
• Contact Representations of Directed Planar Graphs in 2D and 3DChun-Hsiang Chan, Hsu-Chun Yen. 82-93 [doi]
• Identifying Structural Hole Spanners in Social Networks via Graph EmbeddingSijie Chen, Ziwei Quan, Yong Liu. 94-106 [doi]
• The Price of Anarchy for the Load Balancing Game with a Randomizing SchedulerXujin Chen, Xiaodong Hu 0001, Xiaoying Wu. 107-118 [doi]
• A Randomized Approximation Algorithm for Metric Triangle PackingYong Chen 0002, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang. 119-129 [doi]
• Approximation Algorithms for Maximally Balanced Connected Graph PartitionYong Chen 0002, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang. 130-141 [doi]
• Edge Exploration of a Graph by Mobile AgentAmit Kumar Dhar, Barun Gorain, Kaushik Mondal 0003, Shaswati Patra, Rishi Ranjan Singh. 142-154 [doi]
• Fast Diameter Computation Within Split GraphsGuillaume Ducoffe , Michel Habib, Laurent Viennot. 155-167 [doi]
• Approximate Shortest Paths in Polygons with ViolationsBinayak Dutta, Sasanka Roy. 168-180 [doi]
• Parametrized Runtimes for Label TournamentsStefan Funke, Sabine Storandt. 181-196 [doi]
• The k-Delivery Traveling Salesman Problem: RevisitedJinxiang Gan, Guochuan Zhang. 197-209 [doi]
• Algorithmic Pricing for the Partial AssignmentGuichen Gao, Li Ning, Hing-Fung Ting, Yong Zhang 0001, Yifei Zou. 210-222 [doi]
• Recognizing the Tractability in Big Data ComputingXiangyu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu. 223-234 [doi]
• A Novel Virtual Traffic Light Algorithm Based on V2V for Single Intersection in Vehicular NetworksLongjiang Guo, De Wang, Peng Li 0016, Lichen Zhang 0001, Meirei Ren, Hong Liu, A'na Wang. 235-251 [doi]
• Characterizations for Special Directed Co-graphsFrank Gurski, Dominique Komander, Carolin Rehs. 252-264 [doi]
• Scheduling Game with Machine Modification in the Random SettingChaoyu He, Zhiyi Tan. 265-276 [doi]
• Tracking Histogram of Attributes over Private Social Data in Data MarketsZaobo He, Yan Huang. 277-288 [doi]
• Feature Selection Based on Graph StructureZhiwei Hu, Zhaogong Zhang, Zongchao Huang, Dayuan Zheng, Ziliang Zhang. 289-302 [doi]
• Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph ProblemYasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto. 303-315 [doi]
• A Fast Exact Algorithm for Airplane Refueling ProblemJianshu Li, Xiaoyin Hu, Junjie Luo, Jinchuan Cui. 316-327 [doi]
• Approximation Algorithm and Incentive Ratio of the Selling with PreferencePan Li, Qiang Hua, Zhijun Hu, Hing-Fung Ting, Yong Zhang 0001. 328-339 [doi]
• Car-Sharing Problem: Online Scheduling with Flexible Advance BookingsHaodong Liu, Kelin Luo, Yinfeng Xu, Huili Zhang. 340-351 [doi]
• Improved Approximation Algorithm for Minimum Weight k-Subgraph Cover ProblemPengcheng Liu, Xiaohui Huang, Zhao Zhang 0002. 352-361 [doi]
• A True O(nlog n) Algorithm for the All-k-Nearest-Neighbors ProblemHeng-Zhao Ma, Jianzhong Li. 362-374 [doi]
• Approximation Algorithms for Some Minimum Postmen Cover ProblemsYuying Mao, Wei Yu 0011, Zhaohui Liu, Jiafeng Xiong. 375-386 [doi]
• New Results on a Family of Geometric Hitting Set Problems in the PlaneJoseph S. B. Mitchell, Supantha Pandit. 387-399 [doi]
• Two-Machine Flow Shop Scheduling Problem Under Linear ConstraintsKameng Nip, Zhenbo Wang. 400-411 [doi]
• Some Graph Optimization Problems with Weights Satisfying Linear ConstraintsKameng Nip, Zhenbo Wang, Tianning Shi. 412-424 [doi]
• On the Hardness of Some Geometric Optimization Problems with RectanglesSupantha Pandit. 425-436 [doi]
• On Vertex-Edge and Independent Vertex-Edge DominationSubhabrata Paul, Keshav Ranjan. 437-448 [doi]
• The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter GraphsBenoît Darties, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet. 449-460 [doi]
• Card-Based Secure Ranking ComputationsKen Takashima, Yuta Abe, Tatsuya Sasaki, Daiki Miyahara, Kazumasa Shinagawa, Takaaki Mizuki, Hideaki Sone. 461-472 [doi]
• Improved Stretch Factor of Delaunay Triangulations of Points in Convex PositionXuehou Tan, Charatsanyakul Sakthip, Bo Jiang 0004. 473-484 [doi]
• Solving (k-1)-Stable Instances of k-terminal cut with Isolating CutsMark Velednitsky. 485-495 [doi]
• A Task Assignment Approach with Maximizing User Type Diversity in Mobile CrowdsensingA'na Wang, Lichen Zhang 0001, Longjiang Guo, Meirui Ren, Peng Li 0016, Bin Yan. 496-506 [doi]
• Cake Cutting with Single-Peaked ValuationsChenhao Wang, Xiaoying Wu. 507-516 [doi]
• The One-Cop-Moves Game on Graphs of Small TreewidthLusheng Wang, Boting Yang. 517-528 [doi]
• Bounded Degree Graphs Computed for Traveling Salesman Problem Based on Frequency QuadrilateralsYong Wang 0027. 529-540 [doi]
• Prediction Based Reverse Auction Incentive Mechanism for Mobile Crowdsensing SystemZhen Wang, Jinghua Zhu, Doudou Li. 541-552 [doi]
• PATRON: A Unified Pioneer-Assisted Task RecommendatiON Framework in Realistic Crowdsourcing SystemYuchen Xia, Zhitian Xu, Xiaofeng Gao, Mo Chi, Guihai Chen. 553-564 [doi]
• Sequence Submodular Maximization Meets StreamingRuiqi Yang, Dachuan Xu, Longkun Guo, Dongmei Zhang. 565-575 [doi]
• Graph Simplification for Infrastructure Network DesignSean Yaw, Richard S. Middleton, Brendan Hoover. 576-589 [doi]
• TNT: An Effective Method for Finding Correlations Between Two Continuous VariablesDayuan Zheng, Zhaogong Zhang, Yuting Zhang. 590-600 [doi]
• On Conflict-Free Chromatic Guarding of Simple PolygonsOnur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy. 601-612 [doi]