Here is the tentative program.
* The conference will be held in Xizang Hotel Chengdu (Tibet Hotel Chengdu). Exact rooms of sessions will be announced soon.
February 27th:
- Registration is open during 16:00 - 18:00
February 28th:
- Registration is open during 08:30 - 17:00
| Morning |
08:50 - 09:00 |
Opening Session |
| 09:00 - 10:00 |
Invited Talk 1 |
Daniel Lokshtanov - Structure and Quasi - Polynomial Time Algorithms |
| 10:00 - 10:10 |
Photo Session |
| 10:10 - 10:30 |
Coffee Break |
| 10:30 - 12:10 |
Session 1: Graph Theory I |
| (#15) Bar Menashe, Meirav Zehavi - Min-Sum Disjoint Paths on Subclasses of Chordal Graphs |
| (#22) Therese Biedl, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Bastien Rivier - Computing Conforming Partitions with Low Stabbing Number |
| (#26) Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou - Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules |
| (#29) Suthee Ruangwises - NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger |
| Noon |
12:10 - 14:00 |
Lunch Break |
| Afternoon |
14:00 - 15:15 |
Session 2: Game Theory and Social Choice |
| (#6) Kenjiro Takazawa - A Unified Model of Congestion Games with Priorities |
| (#23) Steven Ge, Toshiya Itoh - Popularity on the 3D-Euclidean Stable Roommates |
| (#57) Ryoto Ando, Kei Kimura, Taiki Todo, Makoto Yokoo - Parameterized Voter Relevance in Facility Location Games |
| 15:15 - 15:45 |
Coffee Break |
| 15:45 - 17:25 |
Session 3: Algorithms and Approximation |
| (#30) Mengyuan Hu, An Zhang, Yong Chen, Mingyang Gong, Guohui Lin - Approximation Algorithms for Non-Sequential Star Packing Problems |
| (#31) Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci - On the Approximability of Graph Visibility Problems |
| (#58) Lotte Blank, Kien Huynh, Kelin Luo, Anurag Murty Naredla - Algorithms for the Collaborative Delivery Problem with Monitored Constraints |
| (#62) Sandip Das, Sk Samim Islam - Multipacking and Broadcast Domination on Cactus Graphs |
| Evening |
Exact Time TBA |
Banquet |
March 1st:
- Registration is open during 08:30 - 17:00
| Morning |
09:00 - 10:00 |
Invited Talk 2 |
Venkatesan Guruswami - When and Why do Efficient Algorithms Exist (for Constraint Satisfaction and Beyond) |
| 10:00 - 10:10 |
Coffee Break |
| 10:30 - 12:10 |
Session 4: Exact and Parameterized Algorithms |
| (#34) Katie Clinch, Serge Gaspers, Zixu He, Abdallah Saffidine, Tiankuang Zhang - A Piecewise Approach for the Analysis of Exact Algorithms |
| (#50) Narmina Baghirova, Antoine Castillon - Proportionally Dense Subgraphs: Parameterized Hardness and Efficiently Solvable Cases |
| (#73) Jingyi Liu, Xian Chen, Yicheng Zheng, Jianxin Wang, Feng Shi - Parameterized Algorithms for the Spanning Forest Isomorphism |
| (#49) Gennaro Cordasco, Luisa Gargano, Adele Rescigno - Parameterized Complexity of (d,r)-Domination via Modular Decomposition |
| Noon |
12:10 - 14:00 |
Lunch Break |
| Afternoon |
14:00 - 15:15 |
Session 5: Reconfiguration and Token Jumping |
| (#38) Mohammad Tamimul Ehsan, Sk. Sabit Bin Mosaddek, M Saifur Rahman - An Efficient Implementation of Cosine Distance on Minimal Absent Word Sets |
| (#41) Toru Yoshinaga, Yasushi Kawase - Online Contention Resolution Schemes for Size-Stochastic Knapsacks |
| (#46) Piotr Wojciechowski, K. Subramani - Dag-like Unit Refutations in UTVPI Constraint Systems |
| 15:15 - 15:45 |
Coffee Break |
| 15:45 - 17:25 |
Session 6: Graph Theory II |
| (#18) Jan Matyáš Křišťan, Jakub Svoboda - Reconfiguration Using Generalized Token Jumping |
| (#65) Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa - Independent Set Reconfiguration Under Bounded-Hop Token Jumping |
| (#66) Giuseppe Di Battista, Fabrizio Grosso, Giulia Maragno, Maurizio Patrignani - Ranking and Unranking of the Planar Embeddings of a Planar Graph |
| (#68) Jingru Zhang - The Connected k-Vertex One-Center Problem on Graphs |
March 2nd:
- Registration is open during 08:30 - 12:00
| Morning |
09:00 - 10:00 |
Invited Talk 3 |
Ken-ichi Kawarabayashi - TBA |
| 10:00 - 10:10 |
Coffee Break |
| 10:30 - 12:10 |
Session 7: Algorithms for Graphs and Networks |
| (#44) Samir Datta, Chetan Gupta - Evaluating Monotone Circuits on Surfaces |
| (#70) Simon Dreyer, Antoine Genitrini, Mehdi Naima - Optimal Uniform Shortest Path Sampling |
| (#72) Yuan Friedrich Qiu, Joe Sawada, Aaron Williams - Maximize the Rightmost Digit: Gray Codes for Restricted Growth Strings |
| (#14) Thomas Selig, Haoyue Zhu - Abelian and Stochastic Sandpile Models on Complete Bipartite Graphs |
| Noon |
12:10 - 12:20 |
Closing |