1605 | -- | 1637 | Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan 0001. On Structural Parameterizations of the Edge Disjoint Paths Problem |
1638 | -- | 1652 | Jie Zhang 0008. Average-Case Approximation Ratio of Scheduling without Payments |
1653 | -- | 1676 | Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita. Optimal Matroid Partitioning Problems |
1677 | -- | 1706 | Guilherme de C. M. Gomes, Ignasi Sau. Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization |
1707 | -- | 1733 | Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich. Range Majorities and Minorities in Arrays |
1734 | -- | 1749 | Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger. Dispersing Obnoxious Facilities on a Graph |
1750 | -- | 1785 | Susanne Albers, Arindam Khan 0001, Leon Ladewig. Improved Online Algorithms for Knapsack and GAP in the Random Order Model |
1786 | -- | 1828 | Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung. Computing the Rooted Triplet Distance Between Phylogenetic Networks |
1829 | -- | 1860 | Marc Roth. Parameterized Counting of Partially Injective Homomorphisms |
1861 | -- | 1884 | Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi. A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs |
1885 | -- | 1917 | Sariel Har-Peled, Mitchell Jones, Saladi Rahul. Active-Learning a Convex Body in Low Dimensions |
1918 | -- | 1952 | José A. Soto, Claudio Telha. Independent Sets and Hitting Sets of Bicolored Rectangular Families |