Journal: Algorithmica

Volume 85, Issue 8

2189 -- 2213Alberto Del Pia, Silvia Di Gregorio. On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
2214 -- 2237Mincheol Kim, Chanyang Seo, Taehoon Ahn 0001, Hee-Kap Ahn. Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles
2238 -- 2259Asaf Levin. Online Minimization of the Maximum Starting Time: Migration Helps
2260 -- 2317Shyan Akmal, Ce Jin 0001. Near-Optimal Quantum Algorithms for String Problems
2318 -- 2347Felix Reidl, Blair D. Sullivan. A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes
2348 -- 2362Muhammad Faisal Nadeem, Hamza Iqbal, Hafiz Muhammad Afzal Siddiqui, Muhammad Azeem 0002. Intersecting Longest Cycles in Archimedean Tilings
2363 -- 2394Yiqin Gao, Yves Robert, Frédéric Vivien. Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution
2395 -- 2426Shyan Akmal, Lijie Chen 0001, Ce Jin 0001, Malvika Raj, R. Ryan Williams. Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity
2427 -- 2453David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie. Unique Assembly Verification in Two-Handed Self-Assembly
2454 -- 2481Jesse Beisegel, Ekkehard Köhler, Robert Scheffler 0001, Martin Strehler 0001. Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs
2482 -- 2484Yoshiharu Kohayakawa, Flávio Keidi Miyazawa. Guest Editorial: Special Issue on Theoretical Informatics
2485 -- 2514Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat. Algorithms for p-Faulty Search on a Half-Line
2515 -- 2528Sergey Bereg. Computing Balanced Convex Partitions of Lines