2413 | -- | 2447 | Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani. Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees |
2448 | -- | 2478 | Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia. Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data |
2479 | -- | 2518 | Benjamin Doerr, Andrew James Kelley. Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus |
2519 | -- | 2556 | Omer Cohen Sidon, Dana Ron. Sample-Based Distance-Approximation for Subsequence-Freeness |
2557 | -- | 2574 | Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi. Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants |
2575 | -- | 2604 | Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur. Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions |
2605 | -- | 2624 | Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette. Parity Permutation Pattern Matching |
2625 | -- | 2651 | Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano. Approximation Algorithms for Covering Vertices by Long Paths |
2652 | -- | 2675 | Davide Bilò. New Algorithms for Steiner Tree Reoptimization |
2676 | -- | 2713 | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov. Approximating Long Cycle Above Dirac's Guarantee |
2714 | -- | 2738 | Robert Ganian, Viktoriia Korchemna. Slim Tree-Cut Width |