Parameterized Complexity of Geometric Covering Problems Having Conflicts Aritra BanikFahad PanolanSaket Saurabh Original Research 11 July 2019 Pages: 1 - 19
Connected Vertex Cover for \((sP_1+P_5)\)-Free Graphs Matthew JohnsonGiacomo PaesaniDaniël Paulusma Original Research 20 June 2019 Pages: 20 - 40
A Polynomial Sized Kernel for Tracking Paths Problem Aritra BanikPratibha ChoudharySaket Saurabh OriginalPaper 05 July 2019 Pages: 41 - 63
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts Brian BrubachKarthik A. SankararamanPan Xu Original Research 13 July 2019 Pages: 64 - 87
Extensions of Self-Improving Sorters Siu-Wing ChengKai JinLie Yan OriginalPaper 05 July 2019 Pages: 88 - 106
Succinct Non-overlapping Indexing Arnab GangulyRahul ShahSharma V. Thankachan OriginalPaper 30 July 2019 Pages: 107 - 117
Mim-Width II. The Feedback Vertex Set Problem Lars JaffkeO-joung KwonJan Arne Telle OriginalPaper 18 July 2019 Pages: 118 - 145
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs Johanna E. PreißerJens M. Schmidt OriginalPaper 17 July 2019 Pages: 146 - 162