COCOON 2017 Accepted Papers

Sumedh Tirodkar and Sundar Vishwanathan. Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models
Jakub Gajarský, Petr Hlineny, Martin Koutecky and Shmuel Onn. Parameterized Shifted Combinatorial Optimization
Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen and Dan Wang. Approximation algorithms for the maximum weight internal spanning tree problem
Gill Barequet, Mira Shalah and Yufei Zheng. An Improved Lower Bound on the Growth Constant of Polyiamonds
Xuehou Tan and Bo Jiang. Simple O(n log ^2 n) algorithms for the planar 2-center problem
Wei Yu and Zhaohui Liu. Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems
Prosenjit Bose, Matias Korman, André van Renssen and Sander Verdonschot. Constrained Routing Between Non-Visible Vertices
Satoshi Tayu and Shuichi Ueno. Stable Matchings in Trees
Ei Ando and Shuji Kijima. An FPTAS for the Volume of Some V-polytopes --It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes
Congsong Zhang and Yong Gao. On the Complexity of k-Metric Antidimension Problem and the Size of k-Antireloving Sets in Random Graphs
Ruta Mehta and Vijay Vazirani. An Incentive Compatible, Efficient Market for Air Traffic Flow Management
Rahnuma Islam Nishat and Sue Whitesides. Bend Complexity and Hamiltonian Cycles in Grid Graphs
Guangwei Wu and Jianxin Wang. Approximation Algorithms for Scheduling Multiple Two-Stage Flowshops
Stanley Fung. Optimal Online Two-way Trading with Bounded Number of Transactions
Hoang-Oanh Le and Van Bang Le. NP-hardness and structural results for half-squares of tree convex bipartite graphs
Yuval Filmus, Hamed Hatami, Yaqiao Li and Suzin You. Information Complexity of the AND Function in the Two-Party and Multi-Party Settings
Sanjib Sadhu, Sasanka Roy, Subhas Nandy and Suchismita Roy. Optimal covering and hitting of line segments by two axis-parallel squares
Vladimir Shenmaier. Complexity and Algorithms for Finding a Subset of Vectors with the Longest Sum
Aizhong Zhou, Haitao Jiang, Jiong Guo, Haodi Feng, Nan Liu and Binhai Zhu. Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction
Akinori Kawachi, Kenichi Kawano, Francois Le Gall and Suguru Tamaki. Quantum Query Complexity of Unitary Operator Discrimination
Zhou Chen, Yukun Cheng, Qi Qi and Xiang Yan. Incentive Ratios of a Proportional Sharing Mechanism in Resource Sharing
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung and Ralf Klasing. The approximability of the p-hub center problem with parameterized triangle inequality
Mikko Koivisto, Petteri Laakkonen and Juho Lauri. NP-completeness results for partitioning a graph into total dominating sets
Athanasios Konstantinidis, Stavros Nikolopoulos and Charis Papadopoulos. Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree
Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh and Francesco Silvestri. A Time-Space Trade-off for Triangulations of Points in the Plane
Kuan-Yi Ho, Yi-Jun Chang and Hsu-Chun Yen. Unfolding Some Classes of Orthogonal Polyhedra of Arbitrary Genus
Maximilian Drees, Matthias Feldotto, Sören Riechers and Alexander Skopalik. Pure Nash Equilibria in Restricted Budget Games
Panagiotis Charalampopoulos, Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Solon Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Walen. Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes
Dongmei Zhang, Chunlin Hao, Chenchen Wu, Dachuan Xu and Zhenning Zhang. A local search approximation algorithm for the $k$-means problem with penalties
Sankardeep Chakraborty and Srinivasa Rao Satti. Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications
Jérémy Barbay, Pablo Pérez-Lantero and Javiel Rojas. Depth Distribution in High Dimensions
Mohammad Ghodsi, Hamid Homapour and Masoud Seddighin. Approximate Minimum Diameter
Alan Carneiro, Fabio Protti and Uéverton Souza. Deletion Graph Problems Based on Deadlock Resolution
Saeed Mehrabi. Approximating Weighted Duo-Preservation in Comparative Genomics
Prajakta Nimbhorkar and Arvind Rameshwar V. Dynamic Rank-Maximal Matchings
Elena Khramtcova and Evanthia Papadopoulou. Randomized Incremental Construction for the Hausdorff Voronoi Diagram revisited and extended
Jian Xu, Soumya Banerjee and Wenjing Rao. The Existence of Universally Agreed Fairest Semi-matchings in Any Given Bipartite Graph
Qilong Feng, Senmin Zhu and Jianxin Wang. An improved kernel for Parameterized Bisection above Tight Lower Bound
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto. Reconfiguration of Maximum-Weight b-Matchings in a Graph
Yiyao Jiang. Constant Approximation for Stochastic Orienteering Problem with $(1+\epsilon)$-Budget Relaxiation
Edward J. Lee and Serge Gaspers. Faster Graph Coloring in Polynomial Space
Pradeesha Ashok, Aniket Basu Roy and Sathish Govindarajan. Local Search strikes again: PTAS for variants of Geometric Covering and Packing
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno and Kunihiro Wasa. Efficient Enumeration of Maximal $k$-Degenerate Subgraphs in a Chordal Graph
Pranabendu Misra, Fahad Panolan, Ramanujan M. S. and Saket Saurabh. Linear Representation of Transversal Matroids and Gammoids parameterized by rank
Wenkai Dai. Reoptimization of Minimum Latency Problem
Purnata Ghosal, Om Prakash and Raghavendra Rao B V. On Constant depth circuits parameterized by degree: Identity testing and depth reduction
Kun He, Qian Li and Xiaoming Sun. A Tighter Relation between Sensitivity Complexity and Certificate Complexity
Qian Li and Xiaoming Sun. On the Modulo Degree Complexity of Boolean Functions