WALCOM 2025

Accepted Papers

  1. (#6) Kenjiro Takazawa. A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria
  2. (#14) Thomas Selig and Haoyue Zhu. Abelian and stochastic sandpile models on complete bipartite graphs
  3. (#15) Bar Menashe and Meirav Zehavi. Min-Sum Disjoint Paths on Subclasses of Chordal Graphs
  4. (#18) Jan Matyáš Křišťan and Jakub Svoboda. Reconfiguration Using Generalized Token Jumping
  5. (#22) Therese Biedl, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat and Bastien Rivier. Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons
  6. (#23) Steven Ge and Toshiya Itoh. Popularity on the 3D-Euclidean Stable Roommates
  7. (#26) Tatsuhiro Suga, Akira Suzuki, Yuma Tamura and Xiao Zhou. Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules
  8. (#29) Suthee Ruangwises. NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
  9. (#30) Mengyuan Hu, An Zhang, Yong Chen, Mingyang Gong and Guohui Lin. Approximation algorithms for non-sequential star packing problems
  10. (#31) Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano and Stefano Leucci. On the approximability of graph visibility problems
  11. (#34) Katie Clinch, Serge Gaspers, Zixu He, Abdallah Saffidine and Tiankuang Zhang. A Piecewise Approach for the Analysis of Exact Algorithms
  12. (#38) Mohammad Tamimul Ehsan, Sk. Sabit Bin Mosaddek and M Saifur Rahman. An Efficient Implementation of Cosine Distance on Minimal Absent Word Sets using Suffix Automata
  13. (#41) Toru Yoshinaga and Yasushi Kawase. Online Contention Resolution Schemes for Size-stochastic Knapsacks
  14. (#44) Samir Datta and Chetan Gupta. Evaluating Monotone Circuits on Surfaces
  15. (#46) Piotr Wojciechowski and K. Subramani. Dag-like unit refutations in UTVPI Constraint Systems
  16. (#49) Gennaro Cordasco, Luisa Gargano and Adele Rescigno. Parameterized Complexity of (d,r)-Domination via Modular Decomposition
  17. (#50) Narmina Baghirova and Antoine Castillon. Proportionally dense subgraphs: parameterized hardness and efficiently solvable cases
  18. (#57) Ryoto Ando, Kei Kimura, Taiki Todo and Makoto Yokoo. Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation Graphs
  19. (#58) Lotte Blank, Kien Huynh, Kelin Luo and Anurag Murty Naredla. Algorithms for the Collaborative Delivery Problem with Monitored Constraints
  20. (#62) Sandip Das and Sk Samim Islam. Multipacking and broadcast domination on cactus graphs and its impact on hyperbolic graphs
  21. (#65) Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito and Toshimitsu Masuzawa. Independent Set Reconfiguration Under Bounded-Hop Token Jumping
  22. (#66) Giuseppe Di Battista, Fabrizio Grosso, Giulia Maragno and Maurizio Patrignani. Ranking and Unranking of the Planar Embeddings of a Planar Graph
  23. (#68) Jingru Zhang. The Connected k-Vertex One-Center Problem on Graphs
  24. (#70) Simon Dreyer, Antoine Genitrini and Mehdi Naima. Optimal Uniform Shortest Path Sampling
  25. (#72) Yuan Friedrich Qiu, Joe Sawada and Aaron Williams. Maximize the Rightmost Digit: Gray Codes for Restricted Growth Strings
  26. (#73) Jingyi Liu, Xian Chen, Yicheng Zheng, Jianxin Wang and Feng Shi. Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree Problems