External Links

    Journal: Algorithmica

    Volume 73, Issue 4

    621 -- 622Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam. Guest Editors Foreword
    623 -- 636Lars Arge, Mikkel Thorup. RAM-Efficient External Memory Sorting
    637 -- 651Martin Farach-Colton, Meng-Tsung Tsai. Exact Sublinear Binomial Sampling
    652 -- 672Moni Naor, Eylon Yogev. Tight Bounds for Sliding Bloom Filters
    673 -- 695Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim. On the Number of Edges of Fan-Crossing Free Graphs
    696 -- 729René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond. Myhill-Nerode Methods for Hypergraphs
    730 -- 747Kyle Klein, Subhash Suri. Pursuit Evasion on Polyhedral Surfaces
    748 -- 749Hans L. Bodlaender, MohammadTaghi Hajiaghayi, Giuseppe F. Italiano. Editorial
    750 -- 0Hans L. Bodlaender, Mohammad Taghi Hajiaghayi, Giuseppe F. Italiano. Erratum to: Editorial

    Volume 73, Issue 3

    483 -- 510Radu Curticapean, Marvin Künnemann. A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
    511 -- 546Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano. Logit Dynamics with Concurrent Updates for Local Interaction Potential Games
    547 -- 570Davide Bilò, Luciano Gualà, Guido Proietti. A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
    571 -- 588Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann. Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
    589 -- 606Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin. Computing the Greedy Spanner in Linear Space
    607 -- 619Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria. The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology

    Volume 73, Issue 2

    235 -- 260Srikanta Tirthapura, David P. Woodruff. A General Method for Estimating Correlated Aggregates Over a Data Stream
    261 -- 288Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss. What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid
    289 -- 305Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon. b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
    306 -- 370Tanja Hartmann, Jonathan Rollin, Ignaz Rutter. Regular Augmentation of Planar Graphs
    371 -- 388Anna Adamaszek, Alexandru Popa. Algorithmic and Hardness Results for the Colorful Components Problems
    389 -- 409Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert. Reallocation Problems in Scheduling
    411 -- 440Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt 0001. Facets for Art Gallery Problems
    441 -- 459Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani. On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets
    460 -- 482Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu. Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties

    Volume 73, Issue 1

    1 -- 20Yuichi Yoshida, Hiro Ito. Testing Outerplanarity of Bounded Degree Graphs
    21 -- 41Yuren Zhou, Jun Zhang, Yong Wang. Performance Analysis of the (1+1) Evolutionary Algorithm for the Multiprocessor Scheduling Problem
    42 -- 62Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao. Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
    63 -- 86Yixin Cao, Jianer Chen, Yang Liu 0002. On Feedback Vertex Set: New Measure and New Structures
    87 -- 114Martin Farach-Colton, Miguel A. Mosteiro. Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
    115 -- 142Aparna Das, Claire Mathieu. A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing
    143 -- 165Babak Behsaz, Mohammad R. Salavatipour. On Minimum Sum of Radii and Diameters Clustering
    166 -- 201Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil. Maximum Metric Spanning Tree Made Byzantine Tolerant
    202 -- 216Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk. n
    217 -- 233Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. Fast Algorithm for Partial Covers in Words
    runs on