All the events will be held at the QiongLin Hall on the 3rd floor, Bldg.8 of the City Hotel Xiamen. All papers of COCOA2019 can be downloaded here.
Registration |
08:00 – 15:30 |
| -
Session 7
Computational Geometry & Graph Theory
(Session Chair: Hsu-Chun Yen, National Taiwan University, Taiwan) |
08:30 - 08:50 |
Bounded Degree Graphs Computed for Traveling Salesman Problem Based on Frequency Quadrilaterals
Yong Wang (North China Electric Power University, China) |
08:50 - 09:10 |
Solving (k − 1)-Stable Instances of k-terminal cut with Isolating Cuts
Mark Velednitsky (University of California, Berkeley, USA) |
09:10 - 09:30 |
Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem
Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone and Akihiro Yamamoto (Kyoto University, Japan) |
09:30 - 09:50 |
On Conflict-free Chromatic Guarding of Simple Polygons
Onur Çağırıcı and Petr Hlineny (Masaryk University, Czechia); Bodhayan Roy (Indian Institute of Technology Bombay, India); Subir Kumar Ghosh (Ramakrishna Mission Vivekananda University, India) |
Coffee Break |
09:50 - 10:20 |
| -
Session 8
Graph Theory
(Session Chair: Sean Yaw, Montana State University, USA) |
10:20 - 10:40 |
Some Graph Optimization Problems with Weights Satisfying Linear Constraints
Kameng Nip (Sun Yat-sen University, China), Zhenbo Wang and Tianning Shi (Tsinghua University, China)
|
10:40 - 11:00 |
Contact Representations of Directed Planar Graphs in 2D and 3D
Chun-Hsiang Chan and Hsu-Chun Yen (National Taiwan University, Taiwan) |
11:00 - 11:20 |
Feature Selection Based On Graph Structure
Zhiwei Hu, Zhaogong Zhang, Zongchao Huang and Dayuan Zheng (Heilongjiang University, China); Ziliang Zhang (University of Alabama, USA)
|
11:20 - 11:40 |
Characterizations for special directed co-graphs
Frank Gurski, Dominique Komander and Carolin Rehs (University of Düsseldorf, Germany) |
11:40 - 12:00 |
On vertex-edge and independent vertex-edge domination
Subhabrata Paul (IIT Patna, India) and Keshav Ranjan (IIT Madras, India) |
Lunch |
12:00 - 13:30 |
| -
Session 9
Computational Geometry & Graph Theory (Session Chair: Longjiang Guo, Shaanxi Normal University, China) |
13:30 - 13:50 |
Approximate shortest paths in polygons with violations
Binayak Dutta (Tezpur University, India) and Sasanka Roy (Indian Statistical Institute, India)
|
13:50 - 14:10 |
Balanced Connected Subgraph Problem in Geometric Intersection Graphs
Sujoy Bhore (Vienna University of Technology, Austria), Satyabrata Jana (Indian Statistical Institute, India), Supantha Pandit (Dhirubhai Ambani Institute of Information and Communication Technology, India) and Sasanka Roy (Indian Statistical Institute, India)
|
14:10 - 14:30 |
The One-Cop-Moves Game on Graphs of Small Treewidth
Lusheng Wang (City University of Hong Kong, Hong Kong) and Boting Yang (University of Regina, Canada)
|
14:30 - 14:50 |
Edge Exploration of a Graph by Mobile Agent
Amit Kumar Dhar and Barun Gorain (Indian Institute of Technology Bhilai, India); Kaushik Mondal (Indian Institute of Information Technology Vadodara, India); Shaswati Patra and Rishi Ranjan Singh (Indian Institute of Technology Bhilai, India)
|
14:50 - 15:10 |
Identifying Structural Hole Spanners in Social Networks via Graph Embedding
Sijie Chen, Yong Liu and Ziwei Quan (Heilongjiang University, China) |
Coffee Break |
15:10 - 15:30 |
| -
Session 10
Networking & Scheduling
(Session Chair: Longcheng Liu, Xiamen University, China) |
15:30 - 15:50 |
PATRON: A Unified Pioneer-Assisted Task Recommendation Framework in Realistic Crowdsourcing System
Yuchen Xia, Zhitian Xu and Xiaofeng Gao (Shanghai Jiao Tong University, China); Mo Chi (Tencent Inc., China); Guihai Chen (Shanghai Jiao Tong University, China)
|
15:50 - 16:10 |
Prediction Based Reverse Auction Incentive Mechanism for Mobile Crowdsensing System
Zhen Wang, Jinghua Zhu and Doudou Li (Heilongjiang University, China)
|
16:10 - 16:30 |
A Task assignment Approach with Maximizing User Type Diversity in Mobile Crowdsensing
Ana Wang, Lichen Zhang, Longjiang Guo, Meirui Ren, Peng Li and Bin Yan (Shaanxi Normal University, China)
|
16:30 - 16:50 |
Car-Sharing problem: Online scheduling with Flexible Advance Bookings
Haodong Liu, Kelin Luo, Yinfeng Xu and Huili Zhang (Xi'an Jiaotong University, China)
|
16:50 - 17:10 |
Graph Simplification for Infrastructure Network Design
Sean Yaw (Montana State University, USA); Richard Middleton and Brendan Hoover (Los Alamos National Laboratory, USA) |