Parameterised Counting in Logspace Anselm HaakArne MeierB. V. Raghavendra Rao OriginalPaper Open access 21 April 2023 Pages: 2923 - 2961
On Finding the Best and Worst Orientations for the Metric Dimension Julio AraujoJulien BensmailAna Silva OriginalPaper 03 May 2023 Pages: 2962 - 3002
A General Framework for Enumerating Equivalence Classes of Solutions Yishu WangArnaud MaryBlerina Sinaimeri OriginalPaper 04 May 2023 Pages: 3003 - 3023
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs Philip N. KleinClaire MathieuHang Zhou OriginalPaper 05 May 2023 Pages: 3024 - 3057
A Polynomial Kernel for 3-Leaf Power Deletion Jungho AhnEduard EibenSang-il Oum OriginalPaper 09 May 2023 Pages: 3058 - 3087
A Tight \((3/2+\varepsilon )\)-Approximation for Skewed Strip Packing Waldo GálvezFabrizio GrandoniMalin Rau OriginalPaper 10 May 2023 Pages: 3088 - 3109
Almost Universal Anonymous Rendezvous in the Plane Yoann DieudonnéAndrzej PelcFranck Petit OriginalPaper 11 May 2023 Pages: 3110 - 3143
One-Pass Additive-Error Subset Selection for \(\ell _{p}\) Subspace Approximation and (k, p)-Clustering Amit DeshpandeRameshwar Pratap OriginalPaper 11 May 2023 Pages: 3144 - 3167
Blocking Trails for f-factors of Multigraphs Harold N. Gabow OriginalPaper 13 May 2023 Pages: 3168 - 3213
A Weight-Scaling Algorithm for f-Factors of Multigraphs Harold N. Gabow OriginalPaper 18 May 2023 Pages: 3214 - 3289
Finding Matching Cuts in H-Free Graphs Felicia LuckeDaniël PaulusmaBernard Ries OriginalPaper Open access 07 June 2023 Pages: 3290 - 3322
Publisher Correction: Longest Common Substring with Approximately k Mismatches Tomasz KociumakaJakub RadoszewskiTatiana Starikovskaya Publisher Correction Open access 10 April 2023 Pages: 3323 - 3323