On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs Alberto Del PiaSilvia Di Gregorio OriginalPaper Open access 28 December 2022 Pages: 2189 - 2213
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles Mincheol KimChanyang SeoHee-Kap Ahn OriginalPaper 24 January 2023 Pages: 2214 - 2237
Online Minimization of the Maximum Starting Time: Migration Helps Asaf Levin OriginalPaper 26 January 2023 Pages: 2238 - 2259
Near-Optimal Quantum Algorithms for String Problems Shyan AkmalCe Jin OriginalPaper Open access 27 January 2023 Pages: 2260 - 2317
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes Felix ReidlBlair D. Sullivan OriginalPaper 03 February 2023 Pages: 2318 - 2347
Intersecting Longest Cycles in Archimedean Tilings Muhammad Faisal NadeemHamza IqbalMuhammad Azeem OriginalPaper 10 February 2023 Pages: 2348 - 2362
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution Yiqin GaoYves RobertFrédéric Vivien OriginalPaper 17 February 2023 Pages: 2363 - 2394
Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity Shyan AkmalLijie ChenRyan Williams OriginalPaper Open access 17 February 2023 Pages: 2395 - 2426
Unique Assembly Verification in Two-Handed Self-Assembly David CaballeroTimothy GomezTim Wylie OriginalPaper 17 February 2023 Pages: 2427 - 2453
Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs Jesse BeisegelEkkehard KöhlerMartin Strehler OriginalPaper Open access 28 February 2023 Pages: 2454 - 2481
Guest Editorial: Special Issue on Theoretical Informatics Yoshiharu KohayakawaFlávio K. Miyazawa EditorialNotes 01 February 2023 Pages: 2482 - 2484
Algorithms for p-Faulty Search on a Half-Line Anthony BonatoKonstantinos GeorgiouPaweł Prałat OriginalPaper 06 December 2022 Pages: 2485 - 2514
Computing Balanced Convex Partitions of Lines Sergey Bereg OriginalPaper 29 December 2022 Pages: 2515 - 2528