1. On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs

   • Alberto Del Pia
   • Silvia Di Gregorio

   OriginalPaper Open access 28 December 2022 Pages: 2189 - 2213

   

2. Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles

   • Mincheol Kim
   • Chanyang Seo
   • Hee-Kap Ahn

   OriginalPaper 24 January 2023 Pages: 2214 - 2237

   

3. Online Minimization of the Maximum Starting Time: Migration Helps

   • Asaf Levin

   OriginalPaper 26 January 2023 Pages: 2238 - 2259

4. Near-Optimal Quantum Algorithms for String Problems

   • Shyan Akmal
   • Ce Jin

   OriginalPaper Open access 27 January 2023 Pages: 2260 - 2317

   

5. A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes

   • Felix Reidl
   • Blair D. Sullivan

   OriginalPaper 03 February 2023 Pages: 2318 - 2347

   

6. Intersecting Longest Cycles in Archimedean Tilings

   • Muhammad Faisal Nadeem
   • Hamza Iqbal
   • Muhammad Azeem

   OriginalPaper 10 February 2023 Pages: 2348 - 2362

   

7. Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution

   • Yiqin Gao
   • Yves Robert
   • Frédéric Vivien

   OriginalPaper 17 February 2023 Pages: 2363 - 2394

   

8. Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity

   • Shyan Akmal
   • Lijie Chen
   • Ryan Williams

   OriginalPaper Open access 17 February 2023 Pages: 2395 - 2426

9. Unique Assembly Verification in Two-Handed Self-Assembly

   • David Caballero
   • Timothy Gomez
   • Tim Wylie

   OriginalPaper 17 February 2023 Pages: 2427 - 2453

   

10. Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs

    • Jesse Beisegel
    • Ekkehard Köhler
    • Martin Strehler

    OriginalPaper Open access 28 February 2023 Pages: 2454 - 2481

    

11. Guest Editorial: Special Issue on Theoretical Informatics

    • Yoshiharu Kohayakawa
    • Flávio K. Miyazawa

    EditorialNotes 01 February 2023 Pages: 2482 - 2484

12. Algorithms for p-Faulty Search on a Half-Line

    • Anthony Bonato
    • Konstantinos Georgiou
    • Paweł Prałat

    OriginalPaper 06 December 2022 Pages: 2485 - 2514

    

13. Computing Balanced Convex Partitions of Lines

    • Sergey Bereg

    OriginalPaper 29 December 2022 Pages: 2515 - 2528