1. Parameterized Complexity of Diameter

   • Matthias Bentert
   • André Nichterlein

   OriginalPaper Open access 05 September 2022 Pages: 325 - 351

   

2. Efficient Isomorphism for \(S_d\)-Graphs and T-Graphs

   • Deniz Ağaoğlu Çağırıcı
   • Petr Hliněný

   OriginalPaper 05 September 2022 Pages: 352 - 383

   

3. Solving Target Set Selection with Bounded Thresholds Faster than \(2^n\)

   • Ivan Bliznets
   • Danil Sagunov

   OriginalPaper 14 September 2022 Pages: 384 - 405

   

4. Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries

   • Thomas Erlebach
   • Michael Hoffmann
   • Murilo Santos de Lima

   OriginalPaper Open access 15 September 2022 Pages: 406 - 443

   

5. Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets

   • Júlio Araújo
   • Marin Bougeret
   • Ignasi Sau

   OriginalPaper 17 September 2022 Pages: 444 - 491

   

6. Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series

   • Vincent Froese
   • Brijnesh Jain
   • Mathias Weller

   OriginalPaper Open access 22 September 2022 Pages: 492 - 508

   

7. Succinct Permutation Graphs

   • Konstantinos Tsakalidis
   • Sebastian Wild
   • Viktor Zamaraev

   OriginalPaper Open access 24 September 2022 Pages: 509 - 543

   

8. An Improved Upper Bound on the Queue Number of Planar Graphs

   • Michael Bekos
   • Martin Gronemann
   • Chrysanthi N. Raftopoulou

   OriginalPaper Open access 28 September 2022 Pages: 544 - 562

   

9. Improved Algorithms for Scheduling Unsplittable Flows on Paths

   • Hamidreza Jahanjou
   • Erez Kantor
   • Rajmohan Rajaraman

   OriginalPaper 01 October 2022 Pages: 563 - 583

   

10. Faster Graph Coloring in Polynomial Space

    • Serge Gaspers
    • Edward J. Lee

    OriginalPaper Open access 11 October 2022 Pages: 584 - 609

    

11. Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling

    • K. Subramani
    • Piotr Wojciechowski

    OriginalPaper 11 October 2022 Pages: 610 - 637