Parameterized Complexity of Diameter Matthias BentertAndré Nichterlein OriginalPaper Open access 05 September 2022 Pages: 325 - 351
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
Solving Target Set Selection with Bounded Thresholds Faster than \(2^n\) Ivan BliznetsDanil Sagunov OriginalPaper 14 September 2022 Pages: 384 - 405
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries Thomas ErlebachMichael HoffmannMurilo Santos de Lima OriginalPaper Open access 15 September 2022 Pages: 406 - 443
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets Júlio AraújoMarin BougeretIgnasi Sau OriginalPaper 17 September 2022 Pages: 444 - 491
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series Vincent FroeseBrijnesh JainMathias Weller OriginalPaper Open access 22 September 2022 Pages: 492 - 508
Succinct Permutation Graphs Konstantinos TsakalidisSebastian WildViktor Zamaraev OriginalPaper Open access 24 September 2022 Pages: 509 - 543
An Improved Upper Bound on the Queue Number of Planar Graphs Michael BekosMartin GronemannChrysanthi N. Raftopoulou OriginalPaper Open access 28 September 2022 Pages: 544 - 562
Improved Algorithms for Scheduling Unsplittable Flows on Paths Hamidreza JahanjouErez KantorRajmohan Rajaraman OriginalPaper 01 October 2022 Pages: 563 - 583
Faster Graph Coloring in Polynomial Space Serge GaspersEdward J. Lee OriginalPaper Open access 11 October 2022 Pages: 584 - 609
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling K. SubramaniPiotr Wojciechowski OriginalPaper 11 October 2022 Pages: 610 - 637