Papers submitted

1. Induced packing treewidth II. Excluding a clique or a biclique
   with P. Rzążewski

2. A dense Weisfeiler–Leman algorithm for deciding bounded-cliquewidth homomorphism indistinguishability
   with R. Curticapean, D. Neuen, T. Seppelt, and B. Young

3. Induced packing treewidth
   with P. Rzążewski

4. Clique-width and induced topological minors
   with P. R. Bieliński, J. Czyżewska, M. Milanič, and P. Rzążewski

5. The Gallai vertex problem is hard
   with E. Rotenberg and L. Wulf

6. Equitable coloring of large bipartite graphs

7. Non-empty intersection of longest paths in P5-free and claw-free graphs
   with P. T. Lima

Papers published or accepted

8. Maximum list r-colorable induced subgraphs in kP3-free graphs
   with E. Galby, P. T. Lima, and A. Munaro. Algorithmica (2026) and ESA 2025

9. Counting equitable k-colorings in graphs of bounded clique-width
   with Holger Dell, and Thore Husfeldt. MFCS 2026

10. Upper clique transversal on interval graphs and beyond
    with L. Jaffke, and P. T. Lima. MFCS 2026

11. Hitting all longest paths in H-free graphs and H-graphs
    with P. T. Lima, and P. Rzążewski. LATIN 2026

12. On the parameterized complexity of sparsest cut and small-set expansion problems
    with R. Javadi. Discrete Applied Mathematics

13. Beyond distributed subgraph detection
    with J. H. Korhonen. LIPIcs