Conference Program

The conference venue is at Prince Waikiki, Palolo Room 1&2 (3rd floor), hotel map(Click on the image to enlarge):

To Conference room: Take the escalator to 3rd floor and turn slightly right, you will see our Palolo conference room

To 100 Sails Restaurant & Bar : Same 3rd floor, left to the escalator.

Hybrid Conference Instruction


We will use Microsoft Teams (Download MS Teams) for our hybrid conferencing tool.

General Instruction:

  1. All Registrants:

    You will receive the meeting invitation, including meeting ID and password, via the email on our record (e.g., the email on the registration form, the email you used to contact us). Please note: you must be fully registered at COCOA 2023 to receive this information. If you have not received the conference invitation by Dec. 7th, please contact our web chairs: Mr. Xiao Li ([email protected]) and Mr. Ke Su ([email protected]).

  2. For MS Teams Beginners:

    You may need an MS Teams account to join the conference. If you are a new user of MS Teams, please explore and practice the main functions prior to the conference. Some helpful tutorials can be found at the MS Teams Website: Microsoft Teams video training - Microsoft Support.

  3. Test Session:

    Please feel free to use the test session below any time as you need. To join with meeting ID, please navigate to "Calendar" located at the left menu bar, then find the "# Join with an ID" on the top. Test Session Meeting ID: 262 279 700 122 Password: rbeVwM . Or you can click the direct meeting link to join: [meeting link].

  4. Recording and Privacy Policy:

    Please note all sessions may be recorded without further notice.

  5. Emergency Technical Support:

    Mr. Ke Su ([email protected]).

Detailed Instruction:

Session Schedule

Note: The following schedule follows Hawaii Local Time (UTC/GMT -10), The conference venue is at Prince Waikiki Hotel, Palolo Room 1&2 (3rd floor)

Day1 (Dec. 15)

8:20-8:30am, Opening
8:30-9:30am, Session 1 (4 talks)
9:30-9:45am, Coffee Break
9:45-11:45am Session 2 (8 talks)

11:45am – 1:15pm Lunch Break

1:15 -2:15pm Keynote (Prof. Naoki Katoh, Title: Sublinear Computation Paradigm: Algorithmic Revolution in the Big Data Era)
2:15-3:15 Session 3 (4 talks)
3:15 – 3:30pm Coffee Break
3:30 -5:45pm Session 4 (9 talks)

Day 2 (Dec. 16)

8:30-9:30am, Session 5 (4 talks)
9:30-9:45am, Coffee Break
9:45-11:45am Session 6 (8 talks)

11:45am – 1:15pm Lunch Break

1:15-2:15pm Keynote (Prof. Hui Xiong, Title: Human and Social Nature in AI Algorithms)
2:15 -3:15pm Session 7 (4 talks)
3:15 – 3:30pm Coffee Break
3:30 -5:45pm Session 8 (9 talks)

Day 3 (Dec. 17)

8:30-10:30am, Session 9 (8 talks)
10:30-10:45am, Coffee Break
10:45am-1:00pm Session 10 (9 talks)

1:00-2:00pm Coffee Break (Lunch Break)

2:00-3:30pm Session 11 (6 talks)

Note: Each talk is limited in 15 minutes with Q&A included (12 minutes talk + 3 minutes questions)

Session Details

Session 1: Models and Algorithms ,
Time: Dec. 15 8:30-9:30am

Chair: Habib M. Ammari (Texas A&M University-Kingsville, USA)

  •  Differentiable Discrete Optimization using Dataless Neural Networks, SANGRAM KISHOR JENA, K. Subramani, Alvaro Velasquez

  •  When Advertising meets Assortment Planning: Joint Advertising and Assortment Optimization under Multinomial Logit Model, Chenhao Wang, Yao Wang, Shaojie Tang

  •  Twin-treewidth: A single-exponential logic-based approach, Maurício Da Silva Pires, Ueverton Souza, Bruno Lopes

  •  Highway Preferential Attachment Models for Geographic Routing, Ofek Gila, Michael Goodrich, Evrim Ozel

Session 2: Optimization in Graphs,
Time: Dec. 15 9:45-11:45am

Chair: Christine Chung (Connecticut College, USA)

  •  An Efficient Local Search Algorithm for Correlation Clustering on Large Graphs, Nathan Cordner, George Kollios

  •  Algorithms on a path covering problem with applications in transportation, Ruxandra Marinescu-Ghemeci, Alexandru Popa, Tiberiu-Iulian Sirbu

  •  Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges, Yuki Tokuni, Katoh Naoki, Junichi Teruyama, Yuya Higashikawa

  •  An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line, Stephen Arndt, Josh Ascher, Kirk Pruhs

  •  Online Dominating Set and Coloring, MINATI DE, Satyam Singh, Sambhav Khurana

  •  Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on graphs having small dominating sets, Ueverton Souza, Raquel Bravo, Maria Luiza Cruz, Roldofo Oliveira

  •  Exactly k MSTs: How many vertices suffice?, Apratim Dutta, Rahul Muthu, anuj tawari, Sunitha V

  •  Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs, Lucas Magee, Yusu Wang

Session 3: Scheduling,
Time: Dec. 15 2:15-3:15pm

Chair: Mihaela Cardei (Florida Atlantic University, USA)

  •  Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints, Minqin Liu, Wei Yu, Zhaohui Liu, Xinmeng Guo

  •  Two Exact Algorithms for the Packet Scheduling Problem, Fei Li, Ningshi Yao

  •  Improved Scheduling with a Shared Resource, Peter Kling, Florian Schneider, Christoph Damerius

  •  An Energy-efficient Scheduling Method for Real-time Multi-workflow in Container Cloud, Zaixing Sun, Zhikai Li, Chonglin Gu, Hejiao Huang

Session 4: Set-Related Optimizations,
Time: Dec. 15 3:30 -5:45pm

Chair: Shuyang Gu (Texas A&M University-Central Texas, USA)

  •  Weakly Nondominated Solutions of Set-Valued Optimization Problems with Variable Ordering Structures in Linear Spaces, Zhiang Zhou, Wenbin Wei, Kequan Zhao

  •  The MaxIS-Shapley Value in Perfect Graphs, Junqi Tan, Dongjing Miao, Pengyu Chen

  •  Asteroidal Sets and Dominating Paths, Oleksiy Al-saadi, Jamie Radcliffe

  •  A Novel Approximation Algorithm for Max-Covering Circle Problem, Kaiqi Zhang, Siyuan Zhang, Jirun Gao, Hongzhi Wang, Hong Gao, Jianzhong Li

  •  GAMA: Genetic algorithm for k-coverage and connectivity with minimum sensor activation in wireless sensor networks, HABIB AMMARI, Syed Zaidi, Kevin Gutama

  •  Simple Heuristics for the Rooted Max Tree Coverage Problem, Jiang Zhou, Peng Zhang

  •  Efficient Algorithms for k-Submodular Maximization with the p-system and d-knapsack Constraints, Wenzhe Zhang, Shufang Gong, Bin Liu

  •  Data Summarization beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization, Shaojie Tang

  •  Greedy+Max: An Efficient Approximation Algorithm for `k`-Submodular Knapsack Maximization, Zhongzheng Tang, Jingwen Chen, Chenhao Wang, Tian Wang, Weijia Jia

Session 5: Complexity and Approximation,
Time: Dec. 16 8:30-9:30am

Chair: Hovhannes A. Harutyunyan (Concordia University, Canada)

  •  Restricted Holant Dichotomy on Domains 3 and 4, Yin Liu, Austen Fan, Jin-Yi Cai

  •  Earliest Deadline First is a `2`-approximation for DARP with Time Windows, Barbara Anthony, Christine Chung, Ananya Das, David Yuen

  •  Improved approximation for broadcasting in k-Path Graphs, Narek Hovhannisyan, Hovhannes Harutyunyan

  •  The fine-grained complexity of approximately counting proper connected colorings (extended abstract), Robert Barish, Tetsuo Shibuya

Session 6: Applied Optimization and Algorithms,
Time: Dec. 16 9:45-11:45am

Chair: Tianxin Zhou (Santa Clara Univeristy, USA)

  •  Improved Lower Bound for Estimating the Number of Defective Items, Nader Bshouty

  •  Popularity on the Roommate Diversity Problem, Steven Ge, Toshiya Itoh

  •  On Half Guarding Polygons, Erik Krohn, Alex Pahlow, Zhongxiu Yang

  •  Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging Problem, Anthony Deschênes, Raphaël Boudreault, Vanessa Simard, Jonathan Gaudreault, Claude-Guy Quimper

  •  Algorithms for the Ridesharing with Profit Constraint Problem, Qian-Ping Gu, Jiajian Liang

  •  Multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms, Jiale Zhang, Xiuqi Huang, Zifeng Liu, Xiaofeng Gao, Guihai Chen

  •  Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs, Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono

  •  The Line-constrained Maximum Coverage Facility Location Problem, Hiroki Maegawa, Naoki Katoh, Yuki Tokuni, Yuya Higashikawa

Session 7: Combinatorics and Computing,
Time: Dec. 16 2:15 -3:15pm

Chair: Sergey Bereg (The University of Texas at Dallas, USA)

  •  Strong edge coloring of subquartic graphs, Junlei Zhu, Hongguo Zhu

  •  Two multicolor Ramsey numbers involving bipartite graphs, Yan Li, Ye Wang

  •  Mechanism Design for Time-Varying Value Tasks in High-Load Edge Computing Markets, Qie Li, Zichen Wang, Hongwei Du

  •  Computing random r-orthogonal Latin squares, Sergey Bereg

Session 8: Optimization and Algorithms,
Time: Dec. 16 3:30 -5:45pm

Chair: Ling-Ju Hung (National Taipei University of Business, Taiwan)

  •  Practical Attribute-Based Multi-Keyword Search Scheme with Sensitive Information Hiding for Cloud Storage Systems, Jie Zhao, Hejiao Huang, Yongliang Xu, Xiaojun Zhang, Hongwei Du

  •  A Two-stage Seeds Algorithm for Competitive Influence Maximization considering User Demand, Zhiheng You, Hongwei Du, Liang Ziwei

  •  Testing Higher-order Clusterability on graphs, Yifei Li, Donghua Yang, Jianzhong Li

  •  The 2-mixed-center color spanning problem, Yin Wang, Yi Xu, Yinfeng Xu, Huili Zhang

  •  A Dynamic Parameter Adaptive Path Planning Algorithm, Guangyu Yao, Nan Zhang, Zhenhua Duan, Cong Tian

  •  On the Mating Between a Polygonal Curve and a Convex Polygon, Jin-Yi Liu

  •  A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion, Yunlong Liu, Guang Xiao, Ao Liu, Di Wu, Jingui Huang

  •  Multi-Winner Approval Voting with Grouped Voters, Yinghui Wen, Jiong Guo, Chunjiao Song, Aizhong Zhou

  •  EFX Allocation to Chores Over Small Graph, Huahua Miao, Sijia Dai, Yong Zhang, Yicheng Xu

Session 9: Graph Planer and Others,
Time: Dec. 17 8:30-10:30am

Chair: Xiao Li (The University of Texas at Dallas)

  •  An exact algorithm for the line-constrained bottleneck k-Steiner tree problem, Jianping Li, Suding Liu, Junran Lichen

  •  On Connectedness of Solutions to Integer Linear Systems, Takasugu Shigenobu, Naoyuki Kamiyama

  •  The Longest Subsequence-Repeated Subsequence Problem, Manuel Lafond, Wenfeng Lai, Binhai Zhu, Adiesha Liyanage

  •  An Approximation Algorithm for Covering Vertices by 4^+-Paths, Mingyang Gong, Zhizhong Chen, Guohui Lin, Lusheng Wang

  •  V-Words, Lyndon Words and Substring circ-UMFFs, Jacqueline W. Daykin, Neerja Mhaskar, William F. Smyth

  •  The Two-Center Problem of Uncertain Points on Trees, Haitao Xu, Jingru Zhang

  •  Space-Time Graph Planner for Unsignalized Intersections with CAVs, Caner Mutlu, Ionut Cardei, Mihaela Cardei

  •  The Two Sheriffs Problem: Cryptographic Formalization and Generalization, Kota Sugimoto, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto

Session 10: Extreme Graph and Others,
Time: Dec. 17 10:45am-1:00pm

Chair: Mihaela Cardei (Florida Atlantic University)

  •  Zero-visibility Cops and Robber game on Cage graph, Xiaoli Sun, yi sun

  •  Online Facility Assignment for General Layout of Servers on a Line, Tsubasa Harada, Toshiya Itoh

  •  Guarding Precise and Imprecise Polyhedral Terrains with Segments, Bradley McCoy, Binhai Zhu, Aakash Dutt

  •  The Bag-Based Search: A meta-algorithm to construct tractable logical circuits for graphs based on tree decomposition, Masakazu Ishihata

  •  On Problems Related to Absent Subsequences, Zdenek Tronicek

  •  Some Combinatorial Algorithms on the Dominating Number of Anti-Rank k Hypergraphs, Zhuo Diao, Zhongzheng Tang

  •  Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints, K. Subramani, Piotr Wojciechowski

  •  Critical `(P_5,dart)`-Free Graphs, Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang

  •  Graph Clustering through Users' Properties and Social Influence, Jianxiong Guo, Zhehao Zhu, Yucen Gao, Xiaofeng Gao

Session 11: Machine Learning, Blockchain, and Others
Time: Dec. 17 2:00-3:30pm

Chair: Joonglyul Lee (University of North Carolina at Pembroke, USA)

  •  Incorporating Neural Point Process-based Temporal Feature for Rumor Detection, Runzhe Li, Zhipeng Jiang, Suixiang Gao, Wenguo Yang

  •  Improving Contraction Hierarchies by Combining with All-Pairs Shortest Paths Problem Algorithms, Xinyu Song, Zhipeng Jiang, Wenguo Yang, Suixiang Gao

  •  Information Theory of Blockchain Systems, Quan-Lin Li, Yaqian Ma, Jing-Yu Ma, Yan-Xia Chang

  •  Machine Learning with Low Resource Data from Psychiatric Clinics, Hongmin Du, Xiao Li, Neil Chen, Miklos Vasarhelyi

  •  Single Image Dehazing Based on Dynamic Convolution and Transformer, Quancheng Ning, Nan Zhang

  •  Reinforcement Learning for Combating Cyberbullying in Online Social Networks, Wenting Wang, Tiantian Chen, Weili Wu