COCOON 2018, July 2-4, 2018, Qingdao, China
The 24th International Computing and Combinatorics Conference

Accepted Papers



1: Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai and Ro-Yu Wu. Constructing Independent Spanning Trees on Bubble-Sort Networks
2: Yunyun Deng, Longkun Guo and Peihuang Huang. Optimal Algorithms for Finding Partial Edge-Disjoint Paths
3: Haitao Jiang, Lianrong Pu, Letu Qingge, David Sankoff and Binhai Zhu. A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications
4: Weiwen Liu, Shuai Li and Shengyu Zhang. Contextual Dependent Click Bandit Algorithm for Web Recommendation
5: Takuro Fukunaga. LP-based pivoting algorithm for higher-order correlation clustering
6: Kameng Nip and Zhenbo Wang. Approximation algorithms for a two-phase knapsack problem
7: Katsuhisa Yamanaka, Yasuko Matsui and Shin-Ichi Nakano. More Routes for Evacuation
8: Ueverton Souza, Alan Carneiro and Fabio Protti. Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion -- A Deadlock Resolution Graph Problem
9: Shi Li, Jinhui Xu and Minwei Ye. Approximating Global Optimum for Probabilistic Truth Discovery
10: Koji M. Kobayashi. Online interval scheduling to maximize total satisfaction
11: Gill Barequet and Gil Ben-Shachar. Properties of Minimal-Perimeter Polyominoes
12: Gill Barequet, Minati De and Michael Goodrich. Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
13: Eunjin Oh and Hee-Kap Ahn. Polygon Queries for Convex Hulls of Points
14: Jeremy Barbay and Carlos Ochoa. Synergistic Solutions for Merging and Computing Planar Convex Hulls
15: Pawel Gorecki, Alexey Markin and Oliver Eulenstein. Cophenetic Distances: A Near-Linear Time Algorithmic Framework
16: Jeremy Barbay, Pablo Perez-Lantero and Javiel Rojas-Ledesma. Computing Coverage Kernels Under Restricted Settings
17: Liyu Zhang, Mahmoud Quweider, Hansheng Lei and Fitra Khan. Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-table Autoreducible Sets
18: Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu and An Zhang. Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
19: Chun-Hsiang Chan and Hsu-Chun Yen. On Contact Representations of Directed Planar Graphs
20: Johannes Blum and Sabine Storandt. Computation and Growth of Road Network Dimensions
21: Kelin Luo, Thomas Erlebach and Yinfeng Xu. Car-Sharing between Two Locations: Online Scheduling with Flexible Advance Bookings
22: Frank Gurski and Carolin Rehs. Directed path-width and directed tree-width of directed co-graphs
23: Raffaello Carosi and Gianpiero Monaco. Generalized Graph k-Coloring Games
24: Vittorio Bilo, Francesco Cellinese, Giovanna Melideo and Gianpiero Monaco. On Colorful Bin Packing Games
25: Nanao Kita. Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality
26: Chenyang Xu and Guochuan Zhang. The Path Set Packing Problem
27: Pratik Ghosal and Katarzyna Paluch. Manipulation Strategies for the Rank-Maximal Matching Problem
28: Alessio Conte, Roberto Grossi, Andrea Marino and Luca Versari. Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search
29: R. Krithika, Pranabendu Misra and Prafullkumar Tale. An FPT Algorithm for Contraction to Cactus
30: Wenchang Luo, Bing Su, Yao Xu and Guohui Lin. An approximation framework for bounded facility location problems
31: Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn and Andrew Winslow. Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect
32: Alexey Markin, Venkata Sai Krishna Teja Vadali and Oliver Eulenstein. Solving the Gene Duplication Feasibility Problem in Linear Time
33: Meesum Syed Mohammad. An Efficiently Recognisable Subset of Hypergraphic Sequences
34: Nikolai Nojgaard, Nadia El-Mabrouk, Daniel Merkle, Nicolas Wieseke and Marc Hellmuth. Partial Homology Relations - Satisfiability in terms of Di-Cographs
35: Yingying Wang, Kun Cheng and Zimao Li. Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds
36: Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan. Reconfiguring spanning and induced subgraphs
37: T-H. Hubert Chan and Zhibin Liang. Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators
38: Kunihiro Wasa and Takeaki Uno. Efficient Enumeration of Bipartite Subgraphs in Graphs
39: Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova and Nithin Varma. Bipartite Graphs of Small Readability
40: Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang and Hong Phong Pham. Maximum colorful cliques in vertex-colored graphs
41: Bin Fu. Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage
42: Mingyu Xiao and Hiroshi Nagamochi. Characterizing Star-PCGs
43: Ramesh K Jallu, Sangram K Jena and Gautam K Das. Liar's Dominating Set in Unit Disk Graphs
44: Sanjana Dey, Ramesh K Jallu and Subhas Nandy. Minimum Spanning Tree of Line Segments
45: Arnab Bhattacharyya, Ameet Gadekar and Ninad Rajgopal. Improved learning of $k$-parities
46: Axel Goblet, Steven Kelk, Matus Mihalak and Georgios Stamoulis. On a Fixed Haplotype Variant of the Minimum Error Correction Problem
47: Boris Aronov, Mark de Berg, Aleksandar Markovic and Gerhard J. Woeginger. Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces
48: Debajyoti Bera. Amplitude Amplification for Operator Identification and Randomized Classes
49: Evgeny Dantsin and Alexander Wolpert. Reconstruction of Boolean Formulas in Conjunctive Normal Form
50: Nikolaos Melissinos and Aris Pagourtzis. A Faster FPTAS for the Subset-Sums Ratio Problem
51: Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan and Kunihiko Sadakane. A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time
52: Benjamin Hescott, Caleb Malchik and Andrew Winslow. Non-Determinism Reduces Construction Time in Active Self-Assembly Using an Insertion Primitive
53: N.S. Narayanaswamy, S.M. Dhannya and C. Ramya. Minimum Membership Hitting Sets of Axis Parallel Segments
54: Niranka Banerjee, Varunkumar Jayapaul and Srinivasa Rao Satti. Minimum Transactions Problem
55: Radu-Stefan Mincu and Alexandru Popa. Heuristic algorithms for the min-max edge 2-coloring problem
56: Sepideh Aghamolaei, Fatemeh Baharifard and Mohammad Ghodsi. Geometric Spanners in the MapReduce Model
57: T-H. Hubert Chan and Bintao Sun. SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands
58: C Ramya and Raghavendra Rao B V. Lower Bounds for Special Cases of Syntactic Multilinear ABPs
59: Guangwei Wu and Jianer Chen. Approximation Algorithms on Multiple Two-Stage Flowshops
60: Mugang Lin, Bin Fu and Qilong Feng. Constant Factor Approximation Algorithm for $l$-Pseudoforest Deletion Problem
61: Krishnamoorthy Dinesh, Samir Otiv and Jayalal Sarma. New Bounds for Energy Complexity of Boolean Functions
62: Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot and Saket Saurabh. Hitting and Covering Partially


Past Editions

  • COCOON 2017
  • COCOON 2016