Accepted Papers

• Parinya Chalermsook, Wanchote Po Jiamjitrak, Ly Orgo and Minoo Zarsav
  Bi-Perfect Graphs and the Approximability of Maximum Balanced Biclique
• Reo Eriguchi and Kazumasa Shinagawa
  Single-Shuffle Full-Open Card-Based Secure Computation Protocols for Any Function
• Pengxiang Pan, Suding Liu and Hongtao Zhu
  The heterogeneous rural postman problem
• Yu-Heng Su, Jhih-Ming Yang and Wing-Kai Hon
  Sorting Sequences by Symmetric Reversals
• Li Peihua and Guo Jiong
  Parameterized Approximation Algorithms for Dominating Set and Power Dominating Set By Using Leafage
• Pengxiang Pan and Hongtao Zhu
  The min-max clustered general routing problem with a depot
• Niranka Banerjee, Christian Engels and Duc A. Hoang
  Distance Recoloring
• 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
• Hongjie Guo, Jinchao Wu, Jianxu Shen and Hanchun Yuan
  Asymptotically Optimal Collaborative Caching in Edge Computing Systems
• Yixin Cao and Zhongyi Zhang
  Min Sum Set Cover: Structures and Algorithm
• Weiming Feng, Zelin Li and Pan Peng
  Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model
• Toranosuke Kokai, Rin Saito, Tatsuhiro Suga, Takahiro Suzuki and Yuma Tamura
  Parameterized Complexity of Odd Domination and its Generalization
• Xin Tong, Haitao Jiang, Tiantian Li, Lianrong Pu, Binhai Zhu and Daming Zhu
  A Faster Algorithm for Sorting by Reciprocal Translocations
• 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
• Yunlong Liu, Bingyang Wang and Jingui Huang
  An Improved Kernelization Algorithm for Vertex Splitting to Pathwidth-one
• Hao Lu, Yuan Yuan, Xin Han, Yaojun Liu and Hanbin Yang
  Two-machine flow shop scheduling with one non-availability interval
• Madhura Dutta, Florent Foucaud and Subhas C. Nandy
  Algorithms and bounds for path covers of tree-structured graphs
• Guohua Wu and Jia Li Zheng
  Ordinal Ranks of Delta^0_2-measurable functions
• Andrei Bulatov and Arash Beikmohammadi
  Discrete Homotopy and Promise Constraint Satisfaction Problem
• Pablo Concha-Vega
  Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
• Toranosuke Kokai, Akira Suzuki, Yuma Tamura and Xiao Zhou
  On the Complexity of $k$-Colorable Perfect Matching
• Yaojun Liu, Xin Han, Hanbin Yang, Yong Zhou and Hao Lu
  On Online Fault-Tolerant Bin Packing for Server Consolidation
• Priyanshu Kumar Pant and Ranveer Singh
  Permanental Energy of Graphs
• Yusuf Amidu, Khaled Elbassioni and Adriana F. Gabor
  A Competitive Algorithm for the Online Stochastic Resource Allocation Problem with Departures
• Daisuke Shibatani and Yutaro Yamaguchi
  Envy-Free School Redistricting Between Two Groups
• Nikhil Balaji, Prasad Chaugule and Nitin Saurabh
  On the Arithmetic Complexity of Euler Tours
• Shiming Li, Yong Chen, Zhaohui Liu, Wei Yu and An Zhang
  Improved Algorithms for the Maximum Weight Star Packing Problem
• Masanori Kabutomori and Takaaki Mizuki
  Six Standard Playing Cards Are Sufficient for All Three-Input Boolean Functions
• Samuel German
  Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
• Samuel German
  The Path-Extremal Conjecture for Zero Forcing: Distance-Hereditary Graphs and a Split-Decomposition Reduction
• Panfeng Liu and Biaoshuai Tao
  Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs
• Tian Bai, Yixin Cao and Mingyu Xiao
  Feedback Set Problems on (Planar) Graphs of Bounded Degrees
• Pranjal Dutta and Bhargav Thankey
  On the Border Complexity of Sums of ROFs