1. Structural Parameterizations of Clique Coloring

   • Lars Jaffke
   • Paloma T. Lima
   • Geevarghese Philip

   OriginalPaper Open access 29 November 2021 Pages: 273 - 303

   

2. Tight Bounds for Online Weighted Tree Augmentation

   • Joseph (Seffi) Naor
   • Seeun William Umboh
   • David P. Williamson

   OriginalPaper 30 November 2021 Pages: 304 - 324

   

3. Approximation Schemes for the Generalized Extensible Bin Packing Problem

   • Asaf Levin

   OriginalPaper 01 December 2021 Pages: 325 - 343

4. Mechanisms for (Mis)allocating Scientific Credit

   • Jon Kleinberg
   • Sigal Oren

   OriginalPaper 06 January 2022 Pages: 344 - 378

   

5. Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness

   • Julian Dörfler
   • Marc Roth
   • Philip Wellnitz

   OriginalPaper Open access 07 December 2021 Pages: 379 - 404

   

6. On the Parameterized Complexity of Maximum Degree Contraction Problem

   • Saket Saurabh
   • Prafullkumar Tale

   OriginalPaper 08 January 2022 Pages: 405 - 435

   

7. Fast Exact Algorithms Using Hadamard Product of Polynomials

   • V. Arvind
   • Abhranil Chatterjee
   • Partha Mukhopadhyay

   OriginalPaper 10 January 2022 Pages: 436 - 463

8. Additive Approximation of Generalized Turán Questions

   • Noga Alon
   • Clara Shikhelman

   OriginalPaper 13 January 2022 Pages: 464 - 481

9. On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets

   • Daniel Lokshtanov
   • Amer E. Mouawad
   • Sebastian Siebertz

   OriginalPaper 14 January 2022 Pages: 482 - 509

   

10. Contraction Bidimensionality of Geometric Intersection Graphs

    • Julien Baste
    • Dimitrios M. Thilikos

    OriginalPaper 24 January 2022 Pages: 510 - 531

    

11. Matching Regular Expressions on uncertain data

    • José Arturo Gil
    • Simone Santini

    OriginalPaper Open access 04 January 2022 Pages: 532 - 564