Table of Contents

• On the Complexity of Constrained Reconfiguration and Motion PlanningNicolas Bousquet 0001, Remy El Sabeh, Amer E. Mouawad, Naomi Nishimura. 1-15 [doi]
• Efficient Solutions to Variants of Inversion Problems of Range Minimum QueriesSouta Kobayashi, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara. 16-30 [doi]
• Sublinear Time Algorithms for Abelian Group Isomorphism and Basis ConstructionNader H. Bshouty. 31-45 [doi]
• Towards an Algebraic Approach to the Reconfiguration CSPKei Kimura. 46-60 [doi]
• Algorithms and Complexity Results for K-Theoretic Persistent HomologyYoshihiro Maruyama. 61-74 [doi]
• Mutually Abelian-Bordered Binary WordsAnuran Maity, Kanduru V. Krishna. 75-89 [doi]
• Minimum Length Word-Representants of Treelike Permutation GraphsTithi Dwary, Kanduru V. Krishna. 90-103 [doi]
• A Quadratic Lower Bound for 2dfas Against One-Way LivenessKehinde Adeogun, Christos Kapoutsis. 104-116 [doi]
• Vertical-Horizontal Full Compatibility of One-Dimensional SubshiftsArthur Mittelstaedt, Gaétan Richard. 117-127 [doi]
• Asymptotically Optimal Representation of Palindromic StructureMichael Itzhaki. 128-143 [doi]
• On the Order-Diameter Ratio of Girth-Diameter CagesStijn Cambie, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede. 144-156 [doi]
• Enumeration With Nice Roman Domination PropertiesKevin Mann. 157-171 [doi]
• Enumeration Kernels of Polynomial Size for Cuts of Bounded DegreeChristian Komusiewicz, Diptapriyo Majumdar. 172-186 [doi]
• Weighted Food Webs Make Computing Phylogenetic Diversity So Much HarderJannik Schestag. 187-202 [doi]
• A Practical Algorithm for 3-AdmissibilityChristine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl. 203-215 [doi]
• Using Ray-Shooting Queries for Sublinear Algorithms for Dominating Sets in RDV GraphsTherese Biedl, Prashant Gokhale. 216-230 [doi]
• Sublinear Work Parallel Quantum Algorithms for Computational GeometryShion Fukuzawa, Michael T. Goodrich, Sandy Irani. 231-245 [doi]
• On Strictly Output-Sensitive Color Frequency ReportingErwin Glazenburg, Frank Staals. 246-259 [doi]
• On the Complexity of Capacitated Vehicle Routing with Order RestrictionsSteven Miltenburg, Tim Oosterwijk, René Sitters. 260-273 [doi]
• Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or BandwidthNicolas El Maalouly, Kostas Lakis. 274-287 [doi]
• Overlapping BiclusteringMatthias Bentert, Pål Grønås Drange, Erlend Haugen. 288-302 [doi]
• Finding a HIST: Chordality, Structural Parameters, and DiameterTesshu Hanaka, Hironori Kiya, Hirotaka Ono 0001. 303-316 [doi]
• Parameterized Algorithms for Locally Minimal Defensive AllianceAjinkya Gaikwad, Soumen Maity, Saket Saurabh 0001. 317-331 [doi]
• Exploiting Low Scanwidth to Resolve Soft PolytomiesSebastian Bruchhold, Mathias Weller. 332-346 [doi]
• Maintaining a Kingdom in a TournamentOren Weimann, Raphael Yuster. 347-360 [doi]
• Learning-Augmented Online Bipartite Matching in the Random Arrival Order ModelKunanon Burathep, Thomas Erlebach, William K. Moses Jr.. 361-375 [doi]
• On the Sprague-Grundy Values of Games with a PassHikaru Manabe, Ryohei Miyadera, Koki Suetsugu. 376-389 [doi]
• Reverse Mathematics for Neural NetworksYoshihiro Maruyama. 390-403 [doi]
• Private Graph Colouring with Limited DefectivenessAleksander B. G. Christiansen, Eva Rotenberg, Teresa Anna Steiner, Juliette Vlieghe. 404-415 [doi]
• Complexity Aspects of Homomorphisms of Ordered GraphsMichal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski. 416-431 [doi]
• Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex SetRin Saito, Anouk Sommer, Tatsuhiro Suga, Takahiro Suzuki 0002, Yuma Tamura. 432-446 [doi]
• Quantified Colouring and H-Free AlgorithmicsKristina Asimi, Tala Eagling-Vose, Santiago Guzmán-Pro, Barnaby Martin, Yiming Qiu. 447-460 [doi]
• Bounds and Hardness Results for Conflict-Free ChoosabilityShiwali Gupta, Rogers Mathew. 461-474 [doi]
• The Rectilinear Steiner Forest ArborescenceLukasz Mielewczyk, Leonidas Palios, Pawel Zylinski. 475-490 [doi]
• Face-Hitting Dominating Sets in Plane Graphs: Alternative Proof and Linear-Time AlgorithmTherese Biedl. 491-504 [doi]
• k-Planar and Fan-Crossing Drawings and Transductions of Planar GraphsPetr Hlinený, Jan Jedelský. 505-516 [doi]
• Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-GraphsSabine Cornelsen, Henry Förster, Siddharth Gupta 0002, Stephen G. Kobourov, Johannes Zink 0001. 517-531 [doi]
• Edge-Constrained Hamiltonian Paths on a Point SetTodor Antic, Aleksa Dzuklevski, Jirí Fiala 0001, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, Johannes Zink 0001. 532-546 [doi]
• Optimal Approximations for the Requirement Cut Problem on Sparse Graph ClassesNadym Mallek, Kirill Simonov. 547-562 [doi]
• Clique-Free t-Matchings in Degree-Bounded GraphsKatarzyna E. Paluch 0001, Mateusz Wasylkiewicz. 563-577 [doi]
• Spanning Trees with a Small Vertex Cover: The Complexity on Specific Graph ClassesToranosuke Kokai, Akira Suzuki 0001, Takahiro Suzuki 0002, Yuma Tamura, Xiao Zhou 0001. 578-592 [doi]
• Efficient Trace Frequency Queries in Sparse GraphsChristine Awofeso, Pål Grønås Drange, Patrick Greaves, Oded Lachish, Felix Reidl. 593-606 [doi]
• Counting Large Patterns in Degenerate GraphsChristine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl. 607-620 [doi]
• Pinwheel Scheduling with Real PeriodsHiroshi Fujiwara, Kota Miyagi, Katsuhisa Ouchi. 621-633 [doi]
• Limitations of Density-Based Heuristics and an Alternative Approach for Pinwheel Scheduling with DurationsYosuke Kusano. 634-647 [doi]
• Optimal-Length Labeling Schemes and Fast Algorithms for k-Gathering and k-BroadcastingAdam Ganczorz, Tomasz Jurdzinski. 648-662 [doi]
• Distribution Testing Meets Sum EstimationSampriti Roy. 663-677 [doi]
• The Buffer Minimization Problem for Scheduling Flow Jobs with ConflictsNiklas Haas, Sören Schmitt, Rob van Stee. 678-692 [doi]