Table of Contents

• Challenges from Cancer ImmunotherapyMing Li 0001. [doi]
• Reconstructing Tumor Evolution and Progression in Structurally Variant Cancer CellsRussell Schwartz. [doi]
• Privacy Aspects in Data QueryingMichael Segal 0001. [doi]
• Constructing Independent Spanning Trees on Bubble-Sort NetworksShih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu. 1-13 [doi]
• Exact Algorithms for Finding Partial Edge-Disjoint PathsYunyun Deng, Longkun Guo, Peihuang Huang. 14-25 [doi]
• A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with ApplicationsHaitao Jiang, Lianrong Pu, Qingge Letu, David Sankoff, Binhai Zhu. 26-38 [doi]
• Contextual Dependent Click Bandit Algorithm for Web RecommendationWeiwen Liu, Shuai Li, Shengyu Zhang. 39-50 [doi]
• LP-Based Pivoting Algorithm for Higher-Order Correlation ClusteringTakuro Fukunaga. 51-62 [doi]
• Approximation Algorithms for a Two-Phase Knapsack ProblemKameng Nip, Zhenbo Wang. 63-75 [doi]
• More Routes for EvacuationKatsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano. 76-83 [doi]
• Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph ProblemAlan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza. 84-95 [doi]
• Approximating Global Optimum for Probabilistic Truth DiscoveryShi Li, Jinhui Xu 0001, Minwei Ye. 96-107 [doi]
• Online Interval Scheduling to Maximize Total SatisfactionKoji M. Kobayashi. 108-119 [doi]
• Properties of Minimal-Perimeter PolyominoesGill Barequet, Gil Ben-Shachar. 120-129 [doi]
• Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex PolygonsGill Barequet, Minati De, Michael T. Goodrich. 130-142 [doi]
• Polygon Queries for Convex Hulls of PointsEunjin Oh 0001, Hee-Kap Ahn. 143-155 [doi]
• Synergistic Solutions for Merging and Computing Planar Convex HullsJérémy Barbay, Carlos Ochoa. 156-167 [doi]
• Cophenetic Distances: A Near-Linear Time Algorithmic FrameworkPawel Górecki, Alexey Markin, Oliver Eulenstein. 168-179 [doi]
• Computing Coverage Kernels Under Restricted SettingsJérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma. 180-191 [doi]
• Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-Table Autoreducible SetsLiyu Zhang, Mahmoud Quweider, Hansheng Lei, Fitra Khan. 192-204 [doi]
• Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict GraphYinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang. 205-217 [doi]
• On Contact Representations of Directed Planar GraphsChun-Hsiang Chan, Hsu-Chun Yen. 218-229 [doi]
• Computation and Growth of Road Network DimensionsJohannes Blum, Sabine Storandt. 230-241 [doi]
• Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance BookingsKelin Luo, Thomas Erlebach, Yinfeng Xu. 242-254 [doi]
• Directed Path-Width and Directed Tree-Width of Directed Co-graphsFrank Gurski, Carolin Rehs. 255-267 [doi]
• Generalized Graph k-Coloring GamesRaffaello Carosi, Gianpiero Monaco. 268-279 [doi]
• On Colorful Bin Packing GamesVittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco. 280-292 [doi]
• Nonbipartite Dulmage-Mendelsohn Decomposition for Berge DualityNanao Kita. 293-304 [doi]
• The Path Set Packing ProblemChenyang Xu, Guochuan Zhang. 305-315 [doi]
• Manipulation Strategies for the Rank-Maximal Matching ProblemPratik Ghosal, Katarzyna E. Paluch. 316-327 [doi]
• Finding Maximal Common Subgraphs via Time-Space Efficient Reverse SearchAlessio Conte, Roberto Grossi, Andrea Marino, Luca Versari. 328-340 [doi]
• An FPT Algorithm for Contraction to CactusR. Krithika 0001, Pranabendu Misra, Prafullkumar Tale. 341-352 [doi]
• An Approximation Framework for Bounded Facility Location ProblemsWenchang Luo, Bing Su, Yao Xu, Guohui Lin. 353-364 [doi]
• Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to ConnectJean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow. 365-377 [doi]
• Solving the Gene Duplication Feasibility Problem in Linear TimeAlexey Markin, Venkata Sai Krishna Teja Vadali, Oliver Eulenstein. 378-390 [doi]
• An Efficiently Recognisable Subset of Hypergraphic SequencesSyed M. Meesum. 391-402 [doi]
• Partial Homology Relations - Satisfiability in Terms of Di-CographsNikolai Nøjgaard, Nadia El-Mabrouk, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth. 403-415 [doi]
• Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple CloudsYingying Wang, Kun Cheng, Zimao Li. 416-427 [doi]
• Reconfiguring Spanning and Induced SubgraphsTesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan. 428-440 [doi]
• Generalizing the Hypergraph Laplacian via a Diffusion Process with MediatorsT.-H. Hubert Chan, Zhibin Liang. 441-453 [doi]
• Efficient Enumeration of Bipartite Subgraphs in GraphsKunihiro Wasa, Takeaki Uno. 454-466 [doi]
• Bipartite Graphs of Small ReadabilityRayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin M. Varma. 467-479 [doi]
• Maximum Colorful Cliques in Vertex-Colored GraphsGiuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham. 480-491 [doi]
• Partial Sublinear Time Approximation and Inapproximation for Maximum CoverageBin Fu. 492-503 [doi]
• Characterizing Star-PCGsMingyu Xiao, Hiroshi Nagamochi. 504-515 [doi]
• Liar's Dominating Set in Unit Disk GraphsRamesh K. Jallu, Sangram K. Jena, Gautam K. Das. 516-528 [doi]
• Minimum Spanning Tree of Line SegmentsSanjana Dey, Ramesh K. Jallu, Subhas C. Nandy. 529-541 [doi]
• Improved Learning of k-ParitiesArnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal. 542-553 [doi]
• On a Fixed Haplotype Variant of the Minimum Error Correction ProblemAxel Goblet, Steven Kelk, Matús Mihalák, Georgios Stamoulis. 554-566 [doi]
• Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network SpacesBoris Aronov, Mark de Berg, Aleksandar Markovic 0001, Gerhard J. Woeginger. 567-578 [doi]
• Amplitude Amplification for Operator Identification and Randomized ClassesDebajyoti Bera. 579-591 [doi]
• Reconstruction of Boolean Formulas in Conjunctive Normal FormEvgeny Dantsin, Alexander Wolpert. 592-601 [doi]
• A Faster FPTAS for the Subset-Sums Ratio ProblemNikolaos Melissinos, Aris Pagourtzis. 602-614 [doi]
• A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic TimePaniz Abedin, Arnab Ganguly 0002, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan. 615-625 [doi]
• Non-determinism Reduces Construction Time in Active Self-assembly Using an Insertion PrimitiveBenjamin Hescott, Caleb Malchik, Andrew Winslow. 626-637 [doi]
• Minimum Membership Hitting Sets of Axis Parallel SegmentsN. S. Narayanaswamy, S. M. Dhannya, C. Ramya. 638-649 [doi]
• Minimum Transactions ProblemNiranka Banerjee, Varunkumar Jayapaul, Srinivasa Rao Satti. 650-661 [doi]
• Heuristic Algorithms for the Min-Max Edge 2-Coloring ProblemRadu Stefan Mincu, Alexandru Popa 0001. 662-674 [doi]
• Geometric Spanners in the MapReduce ModelSepideh Aghamolaei, Fatemeh Baharifard, Mohammad Ghodsi. 675-687 [doi]
• SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product DemandsT.-H. Hubert Chan, Bintao Sun. 688-700 [doi]
• Lower Bounds for Special Cases of Syntactic Multilinear ABPsC. Ramya, B. V. Raghavendra Rao. 701-712 [doi]
• Approximation Algorithms on Multiple Two-Stage FlowshopsGuangwei Wu, Jianer Chen. 713-725 [doi]
• Constant Factor Approximation Algorithm for l-Pseudoforest Deletion ProblemMugang Lin, Bin Fu, Qilong Feng. 726-737 [doi]
• New Bounds for Energy Complexity of Boolean FunctionsKrishnamoorthy Dinesh 0001, Samir Otiv, Jayalal Sarma. 738-750 [doi]
• Hitting and Covering PartiallyAkanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh 0001. 751-763 [doi]