The conference will be held at the School of Physical and Mathematical Sciences, 21 Nanyang Link, Singapore 637371. See this page for directions to the building.
The following programme is a draft and remains subject to change.
Each accepted paper is assigned a 20-minute slot, including presentation, Q&A, and transition time.
| 23 July |
Talks: SPMS LT3 (SPMS-03-02)
Food: Level 3 Atrium
Resting Room: SPMS LT2 (SPMS-03-03) |
| 09:00-09:05 |
Opening |
| 09:05-10:05 |
Invited Talk
Session chair:
Xiaoming Sun |
Yuichi Yoshida. Approximation vs Sensitivity: Stable Algorithms Under Input Perturbations |
| 10:05-10:25 |
Photo session |
| 10:25-11:00 |
Tea break |
| 11:00-12:00 |
Session 1
Session Chair:
Yi-Jun Chang |
- Tian Bai*, Yixin Cao and Mingyu Xiao. Feedback Set Problems on (Planar) Graphs of Bounded Degrees
- Toranosuke Kokai*, Akira Suzuki, Yuma Tamura and Xiao Zhou. On the Complexity of $k$-Colorable Perfect Matching
- Shiming Li*, Yong Chen, Zhaohui Liu, Wei Yu and An Zhang. Improved Algorithms for the Maximum Weight Star Packing Problem
|
| 12:00-13:30 |
Lunch |
| 13:30-14:30 |
Session 2
Session Chair:
Frank Stephan |
- Guohua Wu and Jia Li Zheng*. Ordinal Ranks of $\Delta^0_2$-measurable functions
- Pranjal Dutta* and Bhargav Thankey. On the Border Complexity of Sums of ROFs
- Pablo Concha-Vega*. Local Homophily on Bicolored Graphs is P-complete
|
| 14:30-14:50 |
Tea break |
| 14:50-16:10 |
Session 3
Session Chair:
Sanjay Jain |
- Reo Eriguchi* and Kazumasa Shinagawa. Single-Shuffle Full-Open Card-Based Secure Computation Protocols for Any Function
- Masanori Kabutomori and Takaaki Mizuki*. Six Standard Playing Cards Are Sufficient for All Three-Input Boolean Functions
- Xin Tong*, Haitao Jiang, Tiantian Li, Lianrong Pu, Binhai Zhu and Daming Zhu. A Faster Algorithm for Sorting by Reciprocal Translocations
- Yu-Heng Su*, Jhih-Ming Yang and Wing-Kai Hon. Sorting Sequences by Symmetric Reversals
|
| 16:10-16:30 |
Tea break |
| 16:30-17:30 |
Session 4
Session Chair:
Themistoklis Gouleakis |
- Hongjie Guo*, Jinchao Wu, Jianxu Shen and Hanchun Yuan. Asymptotically Optimal Collaborative Caching in Edge Computing Systems
- Yaojun Liu*, Xin Han, Hanbin Yang, Yong Zhou and Hao Lu. Online Fault-tolerant Bin Packing Problem Revised
- Yusuf Amidu*, Khaled Elbassioni and Adriana F. Gabor. A Competitive Algorithm for the Online Stochastic Resource Allocation Problem with Departures
|
| 18:30-21:00 |
Banquet at Pearl Garden Restaurant
(transport will be provided) |
| 24 July |
Talks: SPMS LT3 (SPMS-03-02)
Food: Level 3 Atrium
Resting Room: SPMS LT2 (SPMS-03-03) |
| 09:00-10:00 |
Invited Talk
Session chair:
Yi Li |
Seth Pettie. Looking at Data Sketching Through the Levy-Khintchine Lens |
| 10:00-10:30 |
Tea break |
| 10:30-11:50 |
Session 5
Session Chair:
Yu Chen |
- Li Peihua* and Guo Jiong. Parameterized Approximation Algorithms for Dominating Set and Power Dominating Set By Using Leafage
- Yixin Cao and Zhongyi Zhang*. Min Sum Set Cover: Structures and Algorithm
- Toranosuke Kokai, Rin Saito*, Tatsuhiro Suga, Takahiro Suzuki and Yuma Tamura. Parameterized Complexity of Odd Domination and its Generalization
- Parinya Chalermsook, Wanchote Po Jiamjitrak, Ly Orgo and Minoo Zarsav*. Bi-Perfect Graphs and the Approximability of Maximum Balanced Biclique
|
| 12:00-13:30 |
Lunch |
| 13:30-14:30 |
Session 6
Session Chair:
Pranjal Dutta |
- Yunlong Liu*, Bingyang Wang and Jingui Huang. An Improved Kernelization Algorithm for Vertex Splitting to Pathwidth-one
- Samuel German*. Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
- Samuel German*. The Path-External Conjecture for Zero Forcing: Distance-Hereditary Graphs and a Split-Decomposition Reduction
|
| 14:30-14:50 |
Tea break |
| 14:50-16:10 |
Session 7
Session Chair:
Xiaowei Wu |
- Xinyao Wang* and Zihui Liang. Graph partitioning games
- Sophie Boileau, Andrew Hong, David Liben-Nowell, Alistair Pattison*, Anna Rafferty and Charlie Roslansky. Maximizing the Margin between Desirable and Undesirable Elements in a Covering Problem
- Daisuke Shibatani* and Yutaro Yamaguchi. Envy-Free School Redistricting Between Two Groups
- Panfeng Liu and Biaoshuai Tao*. Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs
|
| 16:10-16:30 |
Tea break |
| 16:30-17:30 |
Session 8
Session Chair:
TBD |
- Niranka Banerjee, Christian Engels and Duc A. Hoang. (Presenter: Yuma Tamura) Distance Recoloring
- Weiming Feng, Zelin Li* and Pan Peng. Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model
- Madhura Dutta*, Florent Foucaud and Subhas C. Nandy. Algorithms and bounds for path covers of tree-structured graphs
|
| 25 July |
Talks: SPMS LT4 (SPMS-03-08) [Note the location change]
Food: Level 5 Staff Lounge [Note the location change]
Resting Room: SPMS LT5 (SPMS-03-09) |
| 09:00-10:20 |
Session 9
Session Chair:
Yutaro Yamaguchi |
- Pengxiang Pan, Suding Liu and Hongtao Zhu*. The heterogeneous rural postman problem
- Pengxiang Pan and Hongtao Zhu*. The min-max clustered general routing problem with a depot
- Siyuan Chen*, Shengminjie Chen, Suixiang Gao, Zheyu Jiang, Wenguo Yang and Dun Ma. On the Structure of Generalized Flows over Time: Why Storage is Unnecessary
- Hao Lu*, Yuan Yuan, Xin Han, Yaojun Liu and Hanbin Yang. Two-machine flow shop scheduling with one non-availability interval
|
| 10:20-10:50 |
Tea break |
| 10:50-11:50 |
Session 10
Session Chair:
Xiaohui Bei |
- Andrei Bulatov and Arash Beikmohammadi*. Discrete Homotopy and Promise Constraint Satisfaction Problem
- Nikhil Balaji*, Prasad Chaugule and Nitin Saurabh. On the Arithmetic Complexity of Euler Tours
- Priyanshu Kumar Pant and Ranveer Singh*. Permanental Energy of Graphs
|
| |
End of Conference |