To join conference: We will use Cisco Webex Meeting as the online conferencing tool. Windows system and Mac OS are preffred for Webex Meeting. Please install Cisco Webex Meeting in your laptop. You are not required to register an account to use it. Just simply copy the conference room number (177 967 7394) into the Cisco Webex Meeting, and enter the correct password, then you are in. Please check your email to see the password.
To make presentation: Your presentation is limited in 20 minutes with Q&A included. Please make your powerpionts ready before your presentation. You Do Not need to upload it to anywhere. When you make presentation, click the "Share" button, and choose to share the whole screen (recommended) or the MS Powerpoint only. We will be able to see your powerpoints. Then just go ahead to do the presentaiton as regular times! We highly recommend you to do live presentations so that we can have better communication, pre-recorded video should be the last choice when it is neceassry.
You can click here to see detailed step-by-step instruction.
Must_Read for session chairs [Updated about pre-recorded video]
Note: The following schedule follows US Central Standard Time (GMT-6)
Day1 (Dec. 11)
8:20 -- 8:30 Opening (TPC Co-Chairs: Weili Wu and Zhongnan Zhang)
8:30 -- 9:30 Keynote 1 (Dr. Hui Xiong), Session Chair: Weili Wu
9:30 -- 9:40 Break
9:40 -- 12:00 Session 1 (7 talks, each 20 minutes)
12:00 -- 13:00 Lunch break
13:00 -- 14:40 Session 2 (5 talks)
14:40 -- 15:00 Break
15:00 -- 17:00 Session 3 (6 talks)
Day 2 (Dec. 12)
8:30 -- 9:30 Keynote 2 (Dr. Zhao Zhang), Session Chair: Zhongnan Zhang
9:30 -- 9:40 Break
9:40 -- 12:00 Session 4 (7 talks, each 20 minutes)
12:00 -- 13:00 Lunch break
13:00 -- 14:40 Session 5 (5 talks)
14:40 -- 15:00 Break
15:00 -- 17:00 Session 6 (6 talks)
Day 3 (Dec. 13)
8:20 -- 8:30 Announcement for COCOA 2021 next year, Session Chair: Zhongnan Zhang
8:30 -- 10:50 Session 7 (7 talks, each 20 minutes)
10:50 -- 11:00 Break
11:00 -- 13:00 Session 8 (6 talks)
13:00 -- 14:00 Lunch Break
14:00 -- 16:00 Session 9 (6 talks)
16:00 -- 16:10 Closing Remarks (Dr. Weili Wu)
Note: Each talk is limited in 20 minutes with Q&A included
Approximate Ridesharing of Personal Vehicles Problem, Qian-Ping Gu, Jiajian Liang, Guochuan Zhang
A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee, Hengzhao Ma, Jianzhong Li
Sampling Based Approximate Skyline Calculation on Big Data, Xingxing Xiao, Jianzhong Li
Approximating k-orthogonal Line Center, Barunabha Chakraborty, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
Selecting Sources for Query Approximation with Bounded Resources, Hongjie Guo, Jianzhong Li, Hong Gao
Parameterized Complexity of Satisfactory Partition Problem, Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
An approximation of the zero error capacity by a greedy algorithm, Marcin Jurkiewicz
On the Complexity of a Periodic Scheduling Problem with Precedence Relations, Richard HladÃk, Anna Minaeva, Zdenek Hanzalek
Energy-constrained Drone Delivery Scheduling, Rafael Papa, Ionut Cardei, Mihaela Cardei
Scheduling Jobs with Precedence Constraints to Minimize Peak Demand, Elliott Pryor, Brendan Mumey, Sean Yaw
Reachability games for optimal multi-agent scheduling of tasks with variable durations, Dhananjay Raju, Niklas Lauffer, Ufuk Topcu
Improved Scheduling with a Shared Resourcevia Structural Insights, Christoph Damerius, Peter Kling, Minming Li, Florian Schneider, Ruilong ZHANG
Two-stage Pricing Strategy with Price Discount in Online Social Networks, He Yuan, Ziwei Liang, Hongwei Du
Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
Matched Participants Maximization Based on Social Spread, Guoyao Rao, Yongcai Wang, Wenping Chen, Deying Li, Weili Wu
Mixed-case Community Detection Problem in Social Networks, Yapu Zhang, Jianxiong Guo, Wenguo Yang
How to get a degree-anonymous graph using minimum number of edge rotations, Cristina Bazgan, Pierre Cazals, Janka Chlebikova
The Small Set Vertex Expansion Problem, Soumen Maity/p>
On Unit read-once resolutions and Copy complexity, Piotr Wojciechowski, K. Subramani
Propositional Projection Temporal Logic Specification Mining, Nan Zhang, Xiaoshuai Yuan, Zhenhua Duan
An Improved Exact Algorithm for the Exact Satisfiability Problem, Gordon Hoi
Transforming Multi-matching Nested Traceable Automata to Multi-matching Nested Expressions, Jin Liu, zhenhua duan, Cong Tian
On the complexity of some facet-defining inequalities of the QAP-polytope, Pawan Aurora, Hans Raj Tiwary
Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles, sharareh alipour, Salman Parsa
On the Complexity of Minimum Maximal Uniquely Restricted Matching, Juhi Chaudhary, B S Panda
A Two-layers Heuristic Search Algorithm for Milk Run with A New PDPTW Model, Xuhong Cai, Li Jiang, Songhu Guo, Hejiao Huang, Hongwei Du
Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives, Nader Bshouty, Catherine Haddad-Zaknoon
Nearly Complete Characterization of 2-Agent Deterministic Strategyproof Mechanisms for Single Facility Location in Lp Space, Jianan Lin
Packing and Covering Triangles in Dense Random Graphs, Zhongzheng Tang, Zhuo Diao
Mechanism Design for Facility Location Games with Candidate Locations, Zhongzheng Tang, chenhao wang, Mengqi Zhang, yingchao zhao
Online Maximum k-Interval Coverage Problem, Songhua Li, Minming Li, Lingjie Duan, Victor C.S. Lee
Vertex fault-tolerant spanners for weighted points in polygonal domains, R Inkulu, Apurv Singh
Competitive Analysis for Two Variants of Online Metric Matching Problem, Toshiya Itoh, Shuichi Miyazaki, Makoto Satake
Guarding Disjoint Orthogonal Polygons in the Plane, Ovidiu Daescu, Hemant Malik
Optimal strategies in Single Round Voronoi Game on Convex Polygons with Constraints, Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Sarvottamananda Swami
Cutting Stock with Rotation: Packing Square Items into Square Bins, Shahin kamali, Pooya Nikbakht
Remotely Useful Greedy Algorithms, Moritz Beck
Parameterized Algorithms for Fixed-order Book Drawing with Bounded Number of Crossings Per Edge, Yunlong Liu, Jie Chen, Jingui Huang
Fractional Maker-Breaker Resolving Game, Eunjeong Yi
Price of Fairness in Budget Division for Egalitarian Social Welfare, Zhongzheng Tang, chenhao wang, Mengqi Zhang
Inspection Strategy for On-board Fuel Sampling within Emission Control Areas, Lingyue Li, Gao Sui-xiang, Wenguo Yang
Novel algorithms for maximum DS decomposition, Shengminjie Chen, Wenguo Yang, Suixiang Gao, Rong Jin
Reading Articles Online, Andreas Karrenbauer, Elizaveta Kovalevskaya
An Efficient Mechanism for Resource Allocation in Mobile Edge Computing, Zeng Guotai, Chen Zhang, Hongwei Du
Data Sensing with Limited Mobile Sensors in Sweep Coverage, Zixiong Nie, Chuang Liu, Hongwei Du
Trip-vehicle Assignment Algorithms for Ride-Sharing, Songhua Li, Minming Li, Victor C.S. Lee
Minimum Wireless Charger Placement with Individual Energy Requirement, Xingjian Ding, Jianxiong Guo, Deying Li, Ding-Zhu Du
An Efficient Algorithm for Routing and Recharging of Electric Vehicles, Tayebeh Bahreini, Nathan Fisher, Daniel Grosu
The Optimization of Self-Interference In Wideband Full-Duplex Phased Array with Joint Transmit and Receive Beamforming, Xiaoxin Wang, Zhipeng Jiang, Wenguo Yang, Gao Sui-xiang
Imbalance on Threshold Graphs and Bipartite Permutation Graphs, Jan Gorzny
Star-critical Ramsey number of large cycle and book, Yan Li, Yusheng Li, Ye Wang
Constructing Order Type Graphs using an Axiomatic Approach, Sergey Bereg, Mohammadreza Haghpanah
FISSION: A Practical Algorithm for Computing Minimum Balanced Node Separators, Johannes Blum, Ruoying Li, Sabine Storandt
Inductive graph invariants and algorithmic applications, C.R. Subramanian
Oriented coloring of msp-digraphs and oriented co-graphs, Frank Gurski, Dominique Komander, Marvin Lindemann
