1. Editor’s Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium

   News 08 November 2022 Pages: 3521 - 3521

2. A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem

   • Lehilton Lelis Chaves Pedrosa
   • Hugo Kooki Kasuya Rosado

   OriginalPaper 19 January 2022 Pages: 3522 - 3558

   

3. Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes

   • Gill Barequet
   • Mira Shalah

   OriginalPaper 12 March 2022 Pages: 3559 - 3586

   

4. On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number

   • Jean R. S. Blair
   • Pinar Heggernes
   • Daniel Lokshtanov

   OriginalPaper 22 March 2022 Pages: 3587 - 3602

   

5. Exponential-Time Quantum Algorithms for Graph Coloring Problems

   • Kazuya Shimizu
   • Ryuhei Mori

   OriginalPaper Open access 01 June 2022 Pages: 3603 - 3621

   

6. Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations

   • Khaled Elbassioni

   OriginalPaper 08 June 2022 Pages: 3622 - 3654

7. Monotone Circuit Lower Bounds from Robust Sunflowers

   • Bruno Pasqualotto Cavalar
   • Mrinal Kumar
   • Benjamin Rossman

   OriginalPaper Open access 14 July 2022 Pages: 3655 - 3685

8. Distinct Fringe Subtrees in Random Trees

   • Louisa Seelbach Benkner
   • Stephan Wagner

   OriginalPaper Open access 01 August 2022 Pages: 3686 - 3728