Journal: Algorithmica

Volume 87, Issue 12

1711 -- 1731Karthik C. S. 0001, Euiwoong Lee, Pasin Manurangsi. On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
1732 -- 1803Minglong Qin, Penghui Yao. Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States
1804 -- 1863Joost Jorritsma, Johannes Lengler, Dirk Sudholt. Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima
1864 -- 1898N. R. Aravind, Roopam Saxena. Parameterized Complexity of Path Set Packing
1899 -- 1932Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee 0001. Log-Diameter MST Verification and Sensitivity in MPC
1933 -- 1996Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura. Reconfiguration of Multisets with Applications to Bin Packing
1997 -- 2017Boris Aronov, Mark de Berg, Leonidas Theocharous. A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb {R}^2$