Improved Bounds for Metric Capacitated Covering Problems Sayan Bandyapadhyay OriginalPaper 15 December 2022 Pages: 1825 - 1849
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups Sanjana DeyFlorent FoucaudArunabha Sen OriginalPaper 19 December 2022 Pages: 1850 - 1882
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center Kangsan KimYongho ShinHyung-Chan An OriginalPaper 20 December 2022 Pages: 1883 - 1911
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization Guilherme C. M. GomesMatheus R. GuedesVinicius F. dos Santos OriginalPaper 20 December 2022 Pages: 1912 - 1947
Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows Di ChenMordecai Golin OriginalPaper 29 December 2022 Pages: 1948 - 2000
Competitive Vertex Recoloring Yossi AzarChay MachlufNoam Touitou OriginalPaper 03 January 2023 Pages: 2001 - 2027
Multistage s–t Path: Confronting Similarity with Dissimilarity Till FluschnikRolf NiedermeierPhilipp Zschoche OriginalPaper Open access 03 January 2023 Pages: 2028 - 2064
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number Pranabendu MisraSaket SaurabhMeirav Zehavi OriginalPaper Open access 11 January 2023 Pages: 2065 - 2086
Social Distancing Network Creation Tobias FriedrichHans GawendowiczAnna Melnichenko OriginalPaper Open access 12 January 2023 Pages: 2087 - 2130
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage Bruno P. CavalarZhenjian Lu Research Open access 13 January 2023 Pages: 2131 - 2155
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs Tomohiro KoanaChristian KomusiewiczFrank Sommer OriginalPaper Open access 20 January 2023 Pages: 2156 - 2187