Journal: Algorithmica

Volume 78, Issue 4

1107 -- 1108Nikhil Bansal, Irene Finocchi. Guest Editors' Foreword
1109 -- 1130Kyle Genova, David P. Williamson. An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem
1131 -- 1150Anna Großwendt, Heiko Röglin. Improved Analysis of Complete-Linkage Clustering
1151 -- 1181Daniel Graf. How to Sort by Walking and Swapping on Paths and Trees
1182 -- 1205Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket. On the Approximability of Digraph Ordering
1206 -- 1224Éric Colin de Verdière. Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
1225 -- 1245Michael Dinitz, Michael Schapira, Asaf Valadarsky. Explicit Expanding Expanders
1246 -- 1262Yossi Azar, Oren Gilon. Scheduling with Deadlines and Buffer Management with Processing Requirements
1263 -- 1283Rasmus Pagh, Ninh Pham, Francesco Silvestri 0001, Morten Stöckel. I/O-Efficient Similarity Join

Volume 78, Issue 3

741 -- 770Hu Ding, Jinhui Xu 0001. FPTAS for Minimizing the Earth Mover's Distance Under Rigid Transformations and Related Problems
771 -- 787S. Thomas McCormick, Britta Peis, José Verschae, Andreas Wierz. Primal-Dual Algorithms for Precedence Constrained Covering Problems
788 -- 818Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis. Resolving Braess's Paradox in Random Networks
819 -- 868Guy Even, Moti Medina. Online Packet-Routing in Grids with Bounded Buffers
869 -- 895Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik. Robustness of the Rotor-Router Mechanism
896 -- 913Frantisek Galcík, Ján Katrenic, Gabriel Semanisin. On Computing an Optimal Semi-matching
914 -- 944Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov. Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
945 -- 967Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil. Extending Partial Representations of Interval Graphs
968 -- 989Konstantinos Panagiotou, Leo Speidel. Asynchronous Rumor Spreading on Random Graphs
990 -- 1019Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, S. Venkatesh 0001, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides. Connectivity Graphs of Uncertainty Regions
1020 -- 1040Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman 0001, Timothy M. Chan. On the Succinct Representation of Equivalence Classes
1041 -- 1066Jiecao Chen, Qin Zhang 0001. Improved Algorithms for Distributed Entropy Monitoring
1067 -- 1106Elliot Anshelevich, Onkar Bhardwaj, Martin Hoefer. Stable Matching with Network Externalities

Volume 78, Issue 2

379 -- 393J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan. Top-k Term-Proximity in Succinct Space
394 -- 424Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola, Marco Previtali, Raffaella Rizzi. An External-Memory Algorithm for String Graph Construction
425 -- 452Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren. Strategyproof Mechanisms for Competitive Influence in Networks
453 -- 491Timothy M. Chan, Meng He 0001, J. Ian Munro, Gelin Zhou. Succinct Indices for Path Minimum, with Applications
492 -- 520Susanne Albers, Matthias Hellwig. Online Makespan Minimization with Parallel Schedules
521 -- 557Jelena Marasevic, Clifford Stein, Gil Zussman. Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis
558 -- 560Carola Doerr, Francisco Chicano. Preface to the Special Issue on Theory of Genetic and Evolutionary Computation
561 -- 586Benjamin Doerr, Frank Neumann, Andrew M. Sutton. Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas
587 -- 609Christian Gießen, Carsten Witt. The Interplay of Population Size and Mutation Probability in the (1 + λ) EA on OneMax
610 -- 640Carola Doerr, Johannes Lengler. OneMax in Black-Box Models with Several Restrictions
641 -- 659Andrei Lissovoi, Carsten Witt. A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization
660 -- 680Duc-Cuong Dang, Thomas Jansen 0001, Per Kristian Lehre. Populations Can Be Essential in Tracking Dynamic Optima
681 -- 713Tiago Paixão, Jorge Pérez Heredia, Dirk Sudholt, Barbora Trubenová. Towards a Runtime Comparison of Natural and Artificial Evolution
714 -- 740Dogan Corus, Jun He, Thomas Jansen 0001, Pietro Simone Oliveto, Dirk Sudholt, Christine Zarges. On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation

Volume 78, Issue 1

1 -- 46Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki. Binary Pattern Tile Set Synthesis Is NP-Hard
47 -- 85Aaron M. Andrews, Haitao Wang. Minimizing the Aggregate Movements for Interval Coverage
86 -- 109Rudolf Scheifele. Steiner Trees with Bounded RC-Delay
110 -- 146Rajesh Chitnis, László Egri, Dániel Marx. List H-Coloring a Graph by Removing Few Vertices
147 -- 165Sariel Har-Peled, Subhro Roy. Approximating the Maximum Overlap of Polygons under Translation
166 -- 208K. Subramani, Piotr J. Wojciechowski. A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints
209 -- 231Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin. Distribution-Sensitive Construction of the Greedy Spanner
232 -- 254Haitao Wang, Jingru Zhang. Computing the Center of Uncertain Points on Tree Networks
255 -- 273Uriel Feige, Moshe Tennenholtz. Optimization with Uniform Size Queries
274 -- 297Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman 0001, Narges Simjour, Akira Suzuki. On the Parameterized Complexity of Reconfiguration Problems
298 -- 318Basile Couëtoux, Elie Nakache, Yann Vaxès. The Maximum Labeled Path Problem
319 -- 341Meirav Zehavi. Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree Graphs
342 -- 377Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon. Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm