Accepted papers can be viewed through the links to the proceedings:

Accepted Papers

  1. Maximizing Diversity and Persuasiveness of Opinion Articles in Social Networks
    Liman Du, Wenguo Yang, Suixiang Gao

  2. Stochastic Model for Rumor Blocking Problem in Social Networks under Rumor Source Uncertainty
    Jianming Zhu, Runzhi Li, Smita Ghosh, Weili Wu

  3. The k edge-vertex domination problem
    Peng Li, Xingli Zhou, Zhiang Zhou

  4. Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs
    Marc Hellmuth, Guillaume Scholz

  5. Fitch Graph Completion
    Marc Hellmuth, Peter F. Stadler, Sandhya Thekkumpadan Puthiyaveedu

  6. The Heterogeneous Rooted Tree Cover Problem
    Pengxiang Pan, Junran Lichen, Ping Yang, Jianping Li

  7. Variants of Euclidean k-center Clusterings
    Shin-ichi Nakano

  8. The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model
    Hengzhao Ma, Jianzhong Li

  9. Algorithms for Shortest Path Tour Problem in Large-Scale Road Network
    Yucen Gao, Mingqian Ma, Jiale Zhang, Songjian Zhang, Jun Fang, Xiaofeng Gao, Guihai Chen

  10. Complexity and Enumeration in Models of Genome Rearrangement
    Lora Bailey, Heather Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann

  11. Red-black Spanners for Mixed-charging Vehicular Networks
    Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Yuki Tokuni, Binhai Zhu, Junichi Teruyama

  12. Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays
    Naonori Kakimura, Tomohiro Nakayoshi

  13. Conditional automatic complexity and its metrics
    Bjørn Kjos-Hanssen

  14. Resource-Adaptive Newton's Method for Distributed Learning
    Shuzhen Chen, Yuan Yuan, Youming Tao, Zhipeng Cai, Dongxiao Yu

  15. Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher
    Akinori Kawachi, Yuki Naito

  16. The Regularized Submodular Maximization via the Lyapunov Method
    Xin Sun, Congying Han, Chenchen Wu, Dachuan Xu, Yang Zhou

  17. Self-stabilizing (Delta+1)-Coloring in Sublinear (in Delta) Rounds via Locally-iterative Algorithms
    Yitong Yin, Chaodong ZHENG, Xinyu Fu

  18. Diversity and freshness-aware regret minimizing set queries
    Hongjie Guo, Jianzhong Li, Fangyao Shen, Hong Gao

  19. A Modified EXP3 in Adversarial Bandits with Multi-User Delayed Feedback
    Yandi Li, Jianxiong Guo

  20. DR-submodular Function Maximization with Adaptive Stepsize
    Yanfei Li, Min Li, Qian Liu, Yang Zhou

  21. Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width
    Weidong Luo

  22. On Detecting Some Defective Items in Group Testing
    Nader Bshouty, Catherine Haddad-Zaknoon

  23. An Efficient Data Analysis Method for Big Data using Multiple-Model Linear Regression
    Bohan Lyu, Jianzhong Li

  24. Topological network-control games
    Zihui Liang, Bakh Khoussainov, Haidong Yang

  25. Multi-Load Agent Path Finding for Online Pickup and Delivery Problem
    Yifei Li, Hao Ye, Ruixi Huang, Hejiao Huang, Hongwei Du

  26. Cabbage Can't Always be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals
    Xin Tong, Ziyi Fang, Haitao Jiang, Lusheng Wang, Binhai Zhu, Daming Zhu, Yixiao Yu

  27. Solving systems of linear equations through zero forcing sets
    Chao Xu, Siyun Zhou, Jianbo Wang

  28. Streaming and Query Once Space Complexity of Longest Increasing Subsequence
    Xin Li, Yu Zheng

  29. k-median/means with outliers revisited: a simple fpt approximation
    Xianrun Chen, Lu Han, Dachuan Xu, Yicheng Xu, Yong Zhang

  30. A cost-sharing scheme for the $k$-product facility location game with penalties
    Xiaowei Li, Xiwen Lu

  31. Approximating Decision Trees with Priority Hypotheses
    Jing Yuan, Shaojie Tang

  32. Extended formulations via decision diagrams
    Ryotaro Mitsuboshi, Kohei Hatano, Haruki Hamasaki, Eiji Takimoto, Horakou Rahmanian, Yuta Kurokawa

  33. Approximating the $\lambda$-low-density Value
    Joachim Gudmundsson, Zijin Huang, Sampson Wong

  34. Exponential Time Complexity of the Complex Weighted Boolean \#CSP
    YIng Liu

  35. Lower Bounds of Functions on Finite Abelian Groups
    Jianting Yang, Ke Ye, Lihong Zhi

  36. Hardness and approximation for the star $p$-hub routing cost problem in $\Delta_\beta$-metric graphs
    Meng-Shiou Tsai, Sun-Yuan Hsieh, Ling-Ju Hung

  37. A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering
    Zimo Sheng, Mingyu Xiao

  38. On the Routing Problems in Graphs with Ordered Forbidden Transitions
    Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou

  39. Shortest Longest-Path Graph Orientations
    Yuichi Asahiro, Jesper Jansson, Avraham Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov

  40. Sink Location Problems in Dynamic Flow Grid Networks
    Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni

  41. List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs
    Banu Baklan Sen, Öznur Yaşar Diner, Thomas Erlebach

  42. Delaying Decisions and Reservation Costs
    Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith

  43. Random Shortening of Linear Codes and Applications
    Xue Chen, Kuan Cheng, Xin Li, Songtao Mao

  44. Profit Maximization for Competitive Influence Spread in Social Networks
    Qiufen Ni, Yun Bai, Zhongzheng Tang

  45. Algorithms for Full-View Coverage of Targets with Group Set Cover
    Jingfang Su, Hongwei Du

  46. Greedy Gray codes for Dyck words and ballot sequences
    Dennis Wong, Vincent Vajnovszki

  47. Improved Sourcewise Roundtrip Spanners with Constant Stretch
    Eli Stafford, Chunjiang Zhu

  48. Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing
    Jingyang Zhao, Mingyu Xiao

  49. On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
    Andrew Drucker, Yuan Li

  50. A PTAS Framework for Clustering Problems in Doubling Metrics
    Di Wu, Jinhui Xu, Jianxin Wang

  51. Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication
    Matthew Anderson, Vu Le

  52. (min,+) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences
    Andrzej Lingas, Mia Persson

  53. Approval-Based Participatory Budgeting with Donations
    Shiwen Wang, Chenhao Wang, Tian Wang, Weijia Jia

  54. A Physical Zero-knowledge Proof for Sumplete, a Puzzle Generated by ChatGPT
    Kyosuke Hatsugai, Kyoichi Asano, Yoshiki Abe

  55. A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons
    Amirhossein Mozafari, Binay Bhattacharya, Thomas Shermer

  56. Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs
    Kangyi Tian, Mingyu Xiao, Boting Yang

  57. An Approach to Agent Path Planning under Temporal Logic Constraints
    Chaofeng Yu, Nan Zhang

  58. Sum-of-Local-Effects Data Structures for Separable Graphs
    Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh

  59. Randomized Data Partitioning with Efficient Search, Retrieval and Privacy-Preservation
    Muhammed Kulekci

  60. Improved bounds for the binary paint shop problem
    Jaroslav Hančl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Šámal, Pavel Valtr