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

Program

Sunday | Monday | Tuesday | Wednesday


Sunday, July 1, 2018

15:00 - 21:00
Regestration

Monday, July 2, 2018

Openning Ceremony
Athens Lecture Hall
8:20 - 8:30
Open Address
 
Invited Talk I
Athens Lecture Hall
8:35 - 9:35
Russell Schwartz
Reconstructing tumor evolution and progression in structurally variant cancer cells
 
9:35 - 10:05
Photo & Coffee Break
 
Session I
Athens Lecture Hall
10:05 - 10:30
Katsuhisa Yamanaka, Yasuko Matsui and Shin-Ichi Nakano
More Routes for Evacuation
10:30 - 10:55
Johannes Blum and Sabine Storandt
Computation and Growth of Road Network Dimensions
10:55 - 11:20
Kunihiro Wasa and Takeaki Uno
Efficient Enumeration of Bipartite Subgraphs in Graphs
11:20 - 11:45
Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova and Nithin Varma
Bipartite Graphs of Small Readability
11:45 - 12:10
Mingyu Xiao and Hiroshi Nagamochi
Characterizing Star-PCGs
 
12:10 - 14:00
Lunch
 
Session II
Athens Lecture Hall
14:00 - 14:25
Alexey Markin, Venkata Sai Krishna Teja Vadali and Oliver Eulenstein
Solving the Gene Duplication Feasibility Problem in Linear Time
14:25 - 14:50
Nikolai Nojgaard, Nadia El-Mabrouk, Daniel Merkle, Nicolas Wieseke and Marc Hellmuth
Partial Homology Relations - Satisfiability in terms of Di-Cographs
14:50 - 15:15
Axel Goblet, Steven Kelk, Matus Mihalak and Georgios Stamoulis
On a Fixed Haplotype Variant of the Minimum Error Correction Problem
15:15 - 15:40
Benjamin Hescott, Caleb Malchik and Andrew Winslow
Non-Determinism Reduces Construction Time in Active Self-Assembly Using an Insertion Primitive
15:40 - 16:05
Sepideh Aghamolaei, Fatemeh Baharifard and Mohammad Ghodsi
Geometric Spanners in the MapReduce Model
 
16:05 - 16:15
Coffee Break
 
Session III
Athens Lecture Hall
16:15 - 16:40
Takuro Fukunaga
LP-based pivoting algorithm for higher-order correlation clustering
16:40 - 17:05
N.S. Narayanaswamy, S.M. Dhannya and C. Ramya
Minimum Membership Hitting Sets of Axis Parallel Segments
17:05 - 17:30
Arnab Bhattacharyya, Ameet Gadekar and Ninad Rajgopa
Improved learning of $k$-parities
17:30 - 17:55
C Ramya and Raghavendra Rao B V
Lower Bounds for Special Cases of Syntactic Multilinear ABPs
17:55 - 18:20
Krishnamoorthy Dinesh, Samir Otiv and Jayalal Sarma
New Bounds for Energy Complexity of Boolean Functions
 
18:20 - 20:00
Dinner

Tuesday, July 3, 2018

Invited Talk II
Athens Lecture Hall
8:30 - 9:30
Ming Li
Challenges from Cancer Immunotherapy
 
9:30 - 9:40
Coffee Break
 
Session IV
Athens Lecture Hall
9:40 - 10:05
Liyu Zhang, Mahmoud Quweider, Hansheng Lei and Fitra Khan
Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-table Autoreducible Sets
10:05 - 10:30
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
10:30 - 10:55
Yingying Wang, Kun Cheng and Zimao Li
Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds
10:55 - 11:20
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan
Reconfiguring spanning and induced subgraphs
11:20 - 11:45
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
11:45 - 12:10
Niranka Banerjee, Varunkumar Jayapaul and Srinivasa Rao Satti
Minimum Transactions Problem
 
12:10 - 14:00
Lunch
 
Session V-I
Athens Lecture Hall
14:00 - 14:25
Weiwen Liu, Shuai Li and Shengyu Zhang
Contextual Dependent Click Bandit Algorithm for Web Recommendation
14:25 - 14:50
Gill Barequet, Minati De and Michael Goodrich
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
14:50 - 15:15
Eunjin Oh and Hee-Kap Ahn
Polygon Queries for Convex Hulls of Points
15:15 - 15:40
Jeremy Barbay and Carlos Ochoa
Synergistic Solutions for Merging and Computing Planar Convex Hulls
15:40 - 16:05
Debajyoti Bera
Amplitude Amplification for Operator Identification and Randomized Classes
 
Session V-II
Milan Lecture Hall
14:00 - 14:25
Haitao Jiang, Lianrong Pu, Letu Qingge, David Sankoff and Binhai Zhu
A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications
14:25 - 14:50
Kameng Nip and Zhenbo Wang
Approximation algorithms for a two-phase knapsack problem
14:50 - 15:15
Shi Li, Jinhui Xu and Minwei Ye
Approximating Global Optimum for Probabilistic Truth Discovery
15:15 - 15:40
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
15:40 - 16:05
Nikolaos Melissinos and Aris Pagourtzis
A Faster FPTAS for the Subset-Sums Ratio Problem
 
16:05 - 16:15
Coffee Break
 
Session VI-I
Athens Lecture Hall
16:15 - 16:40
Ueverton Souza, Alan Carneiro and Fabio Protti
Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion -- A Deadlock Resolution Graph Problem
16:40 - 17:05
Chenyang Xu and Guochuan Zhang
The Path Set Packing Problem
17:05 - 17:30
R. Krithika, Pranabendu Misra and Prafullkumar Tale
An FPT Algorithm for Contraction to Cactus
17:30 - 17:55
Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot and Saket Saurabh
Hitting and Covering Partially
 
Session VI-II
Milan Lecture Hall
16:15 - 16:40
Koji M. Kobayashi
Online interval scheduling to maximize total satisfaction
16:40 - 17:05
Jeremy Barbay, Pablo Perez-Lantero and Javiel Rojas-Ledesma
Computing Coverage Kernels Under Restricted Settings
17:05 - 17:30
Kelin Luo, Thomas Erlebach and Yinfeng Xu
Car-Sharing between Two Locations: Online Scheduling with Flexible Advance Bookings
17:30 - 17:55
Wenchang Luo, Bing Su, Yao Xu and Guohui Lin
An approximation framework for bounded facility location problems
 
18:00 - 19:30
Banquet

Wednesday, July 4, 2018

Invited Talk III
Athens Lecture Hall
8:30 - 9:30
Michael Segal
Privacy Aspects in Data Querying
 
Session VII
Athens Lecture Hall
9:40 - 10:05
Nanao Kita
Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality
10:05 - 10:30
Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai and Ro-Yu Wu
Constructing Independent Spanning Trees on Bubble-Sort Networks
10:30 - 10:55
Yunyun Deng, Longkun Guo and Peihuang Huang
Optimal Algorithms for Finding Partial Edge-Disjoint Paths
10:55 - 11:20
Gill Barequet and Gil Ben-Shachar
Properties of Minimal-Perimeter Polyominoes
11:20 - 11:45
Pawel Gorecki, Alexey Markin and Oliver Eulenstein
Cophenetic Distances: A Near-Linear Time Algorithmic Framework
11:45 - 12:10
Chun-Hsiang Chan and Hsu-Chun Yen
On Contact Representations of Directed Planar Graphs
 
12:10 - 14:00
Lunch
 
Session VIII-I
Athens Lecture Hall
14:00 - 14:25
Frank Gurski and Carolin Rehs
Directed path-width and directed tree-width of directed co-graphs
14:25 - 14:50
Pratik Ghosal and Katarzyna Paluch
Manipulation Strategies for the Rank-Maximal Matching Problem
14:50 - 15:15
Alessio Conte, Roberto Grossi, Andrea Marino and Luca Versari
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search
15:15 - 15:40
Meesum Syed Mohammad
An Efficiently Recognisable Subset of Hypergraphic Sequences
15:40 - 16:05
T-H. Hubert Chan and Zhibin Liang
Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators
 
Session VIII-II
Milan Lecture Hall
14:00 - 14:25
Raffaello Carosi and Gianpiero Monaco
Generalized Graph k-Coloring Games
14:25 - 14:50
Vittorio Bilo, Francesco Cellinese, Giovanna Melideo and Gianpiero Monaco
On Colorful Bin Packing Games
14:50 - 15:15
Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang and Hong Phong Pham
Maximum colorful cliques in vertex-colored graphs
15:15 - 15:40
Boris Aronov, Mark de Berg, Aleksandar Markovic and Gerhard J. Woeginger
Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces
15:40 - 16:05
Radu-Stefan Mincu and Alexandru Popa
Heuristic algorithms for the min-max edge 2-coloring problem
 
16:05 - 16:15
Coffee Break
 
Session IX-I
Athens Lecture Hall
16:15 - 16:40
Sanjana Dey, Ramesh K Jallu and Subhas Nandy
Minimum Spanning Tree of Line Segments
16:40 - 17:05
Ramesh K Jallu, Sangram K Jena and Gautam K Das
Liar's Dominating Set in Unit Disk Graphs
17:05 - 17:30
Evgeny Dantsin and Alexander Wolpert
Reconstruction of Boolean Formulas in Conjunctive Normal Form
 
Session IX-II
Milan Lecture Hall
16:15 - 16:40
T-H. Hubert Chan and Bintao Sun
SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands
16:40 - 17:05
Guangwei Wu and Jianer Chen
Approximation Algorithms on Multiple Two-Stage Flowshops
17:05 - 17:30
Mugang Lin, Bin Fu and Qilong Feng
Constant Factor Approximation Algorithm for $l$-Pseudoforest Deletion Problem
17:30 - 17:55
Bin Fu
Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage


Past Editions

  • COCOON 2017
  • COCOON 2016