Abstract is missing.
- On Pumping Problems for Unary Regular LanguagesHermann Gruber, Markus Holzer 0001, Christian Rauch 0001. 3-16 [doi]
- The Complexity of Graph Exploration GamesJanosch Fuchs, Christoph Grüne, Tom Janßen. 17-30 [doi]
- A SUBSET-SUM Characterisation of the A-HierarchyJan Gutleben, Arne Meier. 31-44 [doi]
- On the Periodic Decompositions of Multidimensional ConfigurationsPyry Herva, Jarkko Kari. 45-57 [doi]
- Quantum Algorithm for the Multiple String Matching ProblemKamil Khadiev, Danil Serov. 58-69 [doi]
- Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of RoundsMichael T. Goodrich, Ryuto Kitagawa, Michael Mitzenmacher. 70-84 [doi]
- The Complexity of Counting Turns in the Line-Based Dial-a-Ride ProblemAntonio Lauerbach, Kendra Reiter, Marie Schmidt. 85-98 [doi]
- Colorful 3-Rainbow DominationTetiana Lavynska. 99-111 [doi]
- The Computational Complexity of Equilibria with Strategic ConstraintsBruce M. Kapron, Koosha Samieefar. 112-127 [doi]
- Exact Characterizations of Non-commutative Algebraic Complexity Without HomogeneityGuillaume Malod. 128-141 [doi]
- Roman Hitting SetKevin Mann, Henning Fernau. 142-156 [doi]
- Visual Complexity of Point Set MappingsWouter Meulemans, Arjen Simons, Kevin Verbeek. 157-171 [doi]
- Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix TreesTakuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama. 172-183 [doi]
- Knowledge Neurons in the Knowledge Graph-based Link Prediction ModelsGrzegorz P. Mika, Amel Bouzeghoub, Katarzyna Wegrzyn-Wolska, Yessin M. Neggaz. 184-197 [doi]
- Disjoint Covering of Bipartite Graphs with s-clubsAngelo Monti, Blerina Sinaimeri. 198-210 [doi]
- Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite AlphabetsYutaro Numaya, Yoshito Kawasaki, Ryo Yoshinaka, Ayumi Shinohara. 211-224 [doi]
- Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar GraphsChristian Ortlieb. 225-237 [doi]
- DAG Scheduling in the BSP ModelPál András Papp, Georg Anegg, Albert-Jan Yzelman. 238-253 [doi]
- Incremental Computation of the Set of Period SetsEric Rivals. 254-268 [doi]
- Tolerant Testing and Distance Estimation for Distributions Under Memory ConstraintsSampriti Roy, Yadu Vasudev. 269-283 [doi]
- Packed Acyclic Deterministic Finite AutomataHiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga. 284-297 [doi]
- Holey Graphs: Very Large Betti Numbers are TestableDániel Szabó, Simon Apers. 298-310 [doi]
- Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch SphereReuben Tate, Stephan J. Eidenbenz. 311-323 [doi]
- Online Busy Time Scheduling with Untrusted PredictionRick van de Bovenkamp, Alison Hsiang-Hsuan Liu. 324-336 [doi]
- Maximal α-Gapped Repeats in a Fibonacci StringKazuma Yamane, Yuto Nakashima 0001, Kazuhisa Seto, Takashi Horiyama. 337-350 [doi]