Conference Program

Online Conference Participation and
Presentation Instruction

To join conference: We will use Microsoft Teams as our online conferencing tool. Please install MS Teams before the conference. You just need to click the conference link to join. Please check your email to see the conference link, if you have registered, but don't get the link by Dec 18, please send email to [email protected].

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 MS Teams Sharing instruction.

Must_Read for session chairs

Must_Read for session presenters and attendees

Practice MS Teams: If you would like to test your devices and practice the tool, you can do this in MS Teams Practice Room. The practice room will be open for two whole days from Dec 18 ~ Dec 19, CST.

Session Schedule

Note: The following schedule follows US Central Standard Time (UTC -6)

Day1 (Dec. 20)

8:20 -- 8:30 Opening (TPC Co-Chairs: Weili Wu and Hongwei Du)
8:30 -- 9:30 Keynote 1 (Dr. Ovidiu Daescu), 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 -- 15:00 Session 2 (6 talks)
15:00 -- 15:20 Break
15:20 -- 17:20 Session 3 (6 talks)

Day 2 (Dec. 21)

8:30 -- 9:30 Keynote 2 (Dr. Guangmo Tong), Session Chair: Hongwei Du
9:30 -- 9:50 Announcement of AAIM2022
9:50 -- 10:00 Break
10:00 -- 12:20 Session 4 (7 talks, each 20 minutes)
12:20 -- 13:20 Lunch break
13:20 -- 15:20 Session 5 (6 talks)
15:20 -- 15:40 Break
15:40 -- 17:40 Session 6 (6 talks)

Note: Each talk is limited in 20 minutes with Q&A included

Session Details

Session 1: Approximation Algorithms,
Time: Dec. 20 9:40 - 12:00

Chair: Hovhannes Harutyunyan ([email protected])

  •  Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations, Wei Liang, Zhao Zhang

  •  Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties, Sai Ji, Gaidi Li, Dongmei Zhang, Xianzhao Zhang

  •  Approximation algorithms for the maximum bounded connected bipartition problem, Yajie Li, Weidong Li, Xiaofei Liu, Jinhua Yang

  •  An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem, Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan, Wencheng Wang, Suding Liu

  •  On Stochastic k-Facility Location, Yicheng Xu, Chunlin Hao, Chenchen Wu, Yong Zhang

  •  The Complexity of Finding a Broadcast Center, Hovhannes Harutyunyan, Zhiyuan Li

  •  An Online Algorithm for Data Caching Problem in Edge Computing, Xinxin Han, Guichen Gao, Yang Wang, Yong Zhang

Session 2: Scheduling,
Time: Dec. 20 13:00 - 15:00

Chair: Xinxin Han ([email protected])

  •  Scheduling on Multiple Two-Stage Flowshops with A Deadline, Jianer Chen, Minjie Huang, Yin Guo

  •  Single machine scheduling with rejection to minimize the weighted makespan, Lingfa Lu, Liqi Zhang, Jinwen Ou

  •  Maximizing Energy Efficiency for Charger Scheduling of WRSNs, Yi Hong, Chuanwen Luo, Zhibo Chen, Wang Xiyun, Xiao Li

  •  A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem, Yu Si, Suixiang Gao, Wenguo Yang

  •  Optimizing mobile charger scheduling for task-based sensor networks, Xiangguang Meng, Jianxiong Guo, Xingjian Ding, Xiujuan Zhang

  •  Semi-online early work maximization problem on two hierarchical machines with partial information of processing time, Man Xiao, Xiaoqiao Liu, Weidong Li

Session 3: Nonlinear Combinatorial Optimization,
Time: Dec. 20 15:20 - 17:20

Chair: Qianping Gu ([email protected])

  •  Streaming Algorithms for Maximizing DR-submodular Functions with d-Knapsack Constraints, Bin Liu, Zihan Chen, Hongmin Du

  •  Stochastic Submodular Probing with State-Dependent Costs, Shaojie Tang

  •  Bi-criteria Adaptive Algorithms for Supermodular Minimization, Xiaojuan Zhang, Qian Liu, Min Li, Yang Zhou

  •  Improved Algorithms for Non-submodular Function Maximization Problem, Zhicheng Liu, Hong Chang, Donglei Du, Xiaoyan Zhang

  •  Fixed Observation Time-step: Adaptive Influence Maximization, Yapu Zhang, Shengminjie Chen, Wenqing Xu, Zhenning Zhang

  •  Measured Continuous Greedy with Differential Privacy, Xin Sun, Gaidi Li, Yapu Zhang, Zhenning Zhang

Session 4: Network Problems,
Time: Dec. 21 10:00 -- 12:20

Chair: Jianxiong Guo ([email protected])

  •  Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks, Xiujuan Zhang, Yongcai Wang, Deying Li, Wenping Chen, Xingjian Ding

  •  Multi-attribute based Influence Maximization in Social Networks, Qiufen Ni, Jianxiong Guo, Hongmin Du

  •  A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks, Shih-Shun KAO, Ralf Klasing, Ling-Ju Hung, Sun-Yuan Hsieh

  •  A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with Min-Sum Movement, WenJie Zou, Longkun Guo, Chunlin Hao, Lei Liu

  •  Time Sensitive Sweep Coverage with Multiple UAVs, Huizhen Wang

  •  Recursive Merged Community Detection Algorithm based on Node Cluster, Ailian Wang, Liang Meng, Lu Cui

  •  Purchase Preferences - Based Air Passenger Choice Behavior Analysis from Sales Transaction Data, Xinghua Li, Suixiang Gao, Wenguo Yang, Yu Si, Zhen Liu

Session 5: Blockchain, Logic, Complexity and Reliability
Time: Dec. 21 13:20 - 15:20

Chair: Yunlong Liu ([email protected])

  •  Multi-Window Bitcoin Price PredictionFramework on Blockchain Transaction Graph, Xiao Li, Linda Du

  •  Sensitivity-Based Optimization for Blockchain Selfish Mining, Jing-Yu Ma, Quan-Lin Li

  •  Design and Implementation of List and Dictionary in XD-M Language,Yajie Wang, Nan Zhang, and Zhenhua Duan

  •  Reliable Edge Intelligence using JPEG Progressive, Haobin Luo, Xiangang Du, Luobing Dong, Guowei Su, Ruijie Chen

  •  A game-theoretic analysis of deep neural networks, Chunying Ren, Zijun Wu, Dachuan Xu, Wenqing Xu

  •  Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case, Janio Carlos Nascimento Silva, Ueverton Souza, Luiz Satoru Ochi

Session 6: Miscellaneous,
Time: Dec. 21 15:40 - 17:40

Chair: Ling-Ju Hung ([email protected])

  •  The independence numbers of weighted graphs with forbidden cycles,Ye Wang, Yan Li

  •  Wegner's Conjecture on 2-Distance Coloring,Junlei Zhu, Yuehua Bu, Hongguo Zhu

  •  An Efficient Oracle for Counting Shortest Paths in Planar Graphs, Ye Gong, Qianping Gu

  •  Restrained and total restrained domination in cographs, Xue-gang Chen, Moo Young Sohn

  •  An order Approach for the Core Maintenance Problem on Edge-weighted Graphs, Bin Liu, Zhenming Liu, Feiteng Zhang

  •  Fixed-parameter Tractability for Book Drawing with Bounded Number of Crossings Per Edge, Yunlong Liu, Yixuan Li, Jingui Huang