Abstract is missing.
- Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation GraphsRyoto Ando, Kei Kimrua, Taiki Todo, Makoto Yokoo. 1-15 [doi]
- Proportionally Dense Subgraphs: Parameterized Hardness and Efficiently Solvable CasesNarmina Baghirova, Antoine Castillon. 16-31 [doi]
- Computing Conforming Partitions with Low Stabbing Number for Rectilinear PolygonsTherese Biedl, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Bastien Rivier. 32-46 [doi]
- On the Approximability of Graph Visibility ProblemsDavide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci 0001. 47-61 [doi]
- Algorithms for the Collaborative Delivery Problem with Monitored ConstraintsLotte Blank, Kien C. Huynh, Kelin Luo, Anurag Murty Naredla. 62-78 [doi]
- A Piecewise Approach for the Analysis of Exact AlgorithmsKatie Clinch, Serge Gaspers, Zixu He, Abdallah Saffidine, Tiankuang Zhang. 79-93 [doi]
- Parameterized Complexity of (d, r)-Domination via Modular DecompositionGennaro Cordasco, Luisa Gargano, Adele A. Rescigno. 94-110 [doi]
- Multipacking and Broadcast Domination on Cactus Graphs and Its Impact on Hyperbolic GraphsSandip Das 0001, Sk Samim Islam. 111-126 [doi]
- Evaluating Monotone Circuits on SurfacesSamir Datta, Chetan Gupta 0002. 127-142 [doi]
- Ranking and Unranking of the Planar Embeddings of a Planar GraphGiuseppe Di Battista, Fabrizio Grosso, Giulia Maragno, Maurizio Patrignani. 143-159 [doi]
- Optimal Uniform Shortest Path SamplingSimon Dreyer, Antoine Genitrini, Mehdi Naima. 160-179 [doi]
- An Efficient Implementation of Cosine Distance on Minimal Absent Word Sets Using Suffix AutomataMohammad Tamimul Ehsan, Sk. Sabit Bin Mosaddek, Mohammad Saifur Rahman. 180-195 [doi]
- Popularity on the 3D-Euclidean Stable RoommatesSteven Ge, Toshiya Itoh. 196-214 [doi]
- Independent Set Reconfiguration Under Bounded-Hop Token JumpingHiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa. 215-228 [doi]
- Approximation Algorithms for Non-sequential Star Packing ProblemsMengyuan Hu, An Zhang 0001, Yong Chen 0002, Mingyang Gong, Guohui Lin. 229-243 [doi]
- Reconfiguration Using Generalized Token JumpingJan Matyás Kristan, Jakub Svoboda. 244-265 [doi]
- Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree ProblemsJingyi Liu, Xian Chen, Yicheng Zheng, Jianxin Wang 0001, Feng Shi 0003. 266-280 [doi]
- Min-Sum Disjoint Paths on Subclasses of Chordal GraphsBar Menashe, Meirav Zehavi. 281-295 [doi]
- Maximize the Rightmost Digit:Gray Codes for Restricted Growth StringsYuan Qiu, Joe Sawada, Aaron Williams 0001. 296-311 [doi]
- NP-Completeness and Physical Zero-Knowledge Proofs for ZeigerSuthee Ruangwises. 312-325 [doi]
- Abelian and Stochastic Sandpile Models on Complete Bipartite GraphsThomas Selig, Haoyue Zhu. 326-345 [doi]
- Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration RulesTatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou 0001. 346-360 [doi]
- A Unified Model of Congestion Games with Priorities - Two-Sided Markets with Ties, Finite and Non-affine Delay Functions, and Pure Nash EquilibriaKenjiro Takazawa. 361-376 [doi]
- Dag-Like Unit Refutations in UTVPI Constraint SystemsPiotr Wojciechowski 0002, K. Subramani 0001. 377-392 [doi]
- Online Contention Resolution Schemes for Size-Stochastic KnapsacksToru Yoshinaga, Yasushi Kawase. 393-408 [doi]
- The Connected k-Vertex One-Center Problem on GraphsJingru Zhang 0001. 409-423 [doi]