Journal: Algorithmica

Volume 81, Issue 3

917 -- 966Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna. Edge Bipartization Faster than $$2^k$$ 2 k
967 -- 985Surender Baswana, Keerti Choudhary, Liam Roditty. An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model
986 -- 1005Mathieu Liedloff, Pedro Montealegre, Ioan Todinca. Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques
1006 -- 1030Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar. Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median
1031 -- 1052Andreas Emil Feldmann. Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs
1053 -- 1074T. Karthick, Frédéric Maffray, Lucas Pastor. Polynomial Cases for the Vertex Coloring Problem
1075 -- 1095Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto. LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design
1096 -- 1125Austin Halper, Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong. Station Assignment with Reallocation
1126 -- 1151Yann Disser, Stefan Kratsch, Manuel Sorge. The Minimum Feasible Tileset Problem
1152 -- 1179Spyros Angelopoulos 0001, Reza Dorrigiv, Alejandro López-Ortiz. On the Separation and Equivalence of Paging Strategies and Other Online Algorithms
1180 -- 1204Frank Kammer, Dieter Kratsch, Moritz Laudahn. Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
1205 -- 1231Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani. Distributed Methods for Computing Approximate Equilibria
1232 -- 1246Mourad Baïou, Francisco Barahona. Faster Algorithms for Security Games on Matroids
1247 -- 1266Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova. The Power and Limitations of Uniform Samples in Testing Properties of Figures
1267 -- 1287Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. Parameterized Algorithms for List K-Cycle
1288 -- 1318David G. Harris. Deterministic Parallel Algorithms for Bilinear Objective Functions