Journal: Algorithmica

Volume 50, Issue 4

415 -- 417José R. Correa, Marcos A. Kiwi. Foreword
418 -- 445Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda. Random Bichromatic Matchings
446 -- 454Béla Bollobás, Guy Kindler, Imre Leader, Ryan O Donnell. Eliminating Cycles in the Discrete Torus
455 -- 478Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young. Incremental Medians via Online Bidding
479 -- 496Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton. Algorithms for Modular Counting of Roots of Multivariate Polynomials
497 -- 554Loïck Lhote, Brigitte Vallée. Gaussian Laws for the Main Parameters of the Euclid Algorithms
555 -- 583Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige. Minimum Cost Source Location Problems with Flow Requirements
584 -- 596Ilya Baran, Erik D. Demaine, Mihai Patrascu. Subquadratic Algorithms for 3SUM

Volume 50, Issue 3

299 -- 311Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao. The Swap Edges of a Multiple-Sources Routing Tree
312 -- 328Patchrawat Uthaisombut. Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness
329 -- 350Petra Berenbrink, Tom Friedetzky, Russell A. Martin. On the Stability of Dynamic Diffusion Load Balancing
351 -- 368Richard Cole, Lukasz Kowalik. New Linear-Time Algorithms for Edge-Coloring Planar Graphs
369 -- 385V. Berry, Z. S. Peng, H. F. Ting. From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
386 -- 414Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff. Delineating Boundaries for Imprecise Regions

Volume 50, Issue 2

173 -- 174Frank K. H. A. Dehne, Jörg-Rüdiger Sack. Introduction to Special Issue
175 -- 207Minkyoung Cho, David M. Mount. Improved Approximation Bounds for Planar Point Pattern Matching
208 -- 222Karim Douïeb, Stefan Langerman. Dynamic Hotlinks
223 -- 235Kazuo Iwama, Andrzej Lingas, Masaki Okita. Max-Stretch Reduction for Tree Spanners
236 -- 243Timothy M. Chan. All-Pairs Shortest Paths with Real Weights in ::::O:::: ( ::::n:::: :::3:::/log ::::n:::: ) Time
244 -- 254André Berger, Ojas Parekh. Linear Time Algorithms for Generalized Edge Dominating Set Problems
255 -- 278Ilya Baran, Erik D. Demaine, Dmitriy A. Katz. Optimally Adaptive Integration of Univariate Lipschitz Functions
279 -- 298Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips. Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance

Volume 50, Issue 1

1 -- 57Dimitris Fotakis. On the Competitive Ratio for Online Facility Location
58 -- 71Min-Te Sun, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang Lai. An Optimal Algorithm for the Minimum Disc Cover Problem
72 -- 97Nir Naaman, Raphael Rom. Average Case Analysis of Bounded Space Bin Packing Algorithms
98 -- 119Anupam Gupta, Aravind Srinivasan, Éva Tardos. Cost-Sharing Mechanisms for Network Design
120 -- 158Raffaella Gentilini, Carla Piazza, Alberto Policriti. Symbolic Graphs: Linear Solutions to Connectivity Related Problems
159 -- 172Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich. On Enumerating Minimal Dicuts and Strongly Connected Subgraphs