Journal: Algorithmica

Volume 85, Issue 7

1825 -- 1849Sayan Bandyapadhyay. Improved Bounds for Metric Capacitated Covering Problems
1850 -- 1882Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen. Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups
1883 -- 1911Kangsan Kim, Yongho Shin, Hyung-Chan An. Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center
1912 -- 1947Guilherme C. M. Gomes, Matheus R. Guedes, Vinícius Fernandes dos Santos. Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization
1948 -- 2000Di Chen, Mordecai J. Golin. Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows
2001 -- 2027Yossi Azar, Chay Machluf, Boaz Patt-Shamir, Noam Touitou. Competitive Vertex Recoloring
2028 -- 2064Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche. Multistage s-t Path: Confronting Similarity with Dissimilarity
2065 -- 2086Pranabendu Misra, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
2087 -- 2130Tobias Friedrich 0001, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko. Social Distancing Network Creation
2131 -- 2155Bruno Pasqualotto Cavalar, Zhenjian Lu. Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
2156 -- 2187Tomohiro Koana, Christian Komusiewicz, Frank Sommer. Computing Dense and Sparse Subgraphs of Weakly Closed Graphs