Journal: Algorithmica

Volume 81, Issue 2

419 -- 420Jiong Guo, Danny Hermelin. Foreword: Special Issue on Parameterized and Exact Computation
421 -- 438Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen. Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs
439 -- 475Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele. Turbocharging Treewidth Heuristics
476 -- 496Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler. Backdoors for Linear Temporal Logic
497 -- 518Michal Wlodarczyk 0001. Clifford Algebras Meet Tree Decompositions
519 -- 540Kitty Meeks. Randomised Enumeration of Small Witnesses Using a Decision Oracle
541 -- 556Cornelius Brand, Holger Dell, Marc Roth. Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP
557 -- 588Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. Cutwidth: Obstructions and Algorithmic Aspects
589 -- 592Carola Doerr, Dirk Sudholt. Preface to the Special Issue on Theory of Genetic and Evolutionary Computation
593 -- 631Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang 0016. The ( $$1+\lambda $$ 1 + λ ) Evolutionary Algorithm with Self-Adjusting Mutation Rate
632 -- 667Carsten Witt. Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax
668 -- 702Duc-Cuong Dang, Per Kristian Lehre, Phan Trung Hai Nguyen. Level-Based Analysis of the Univariate Marginal Distribution Algorithm
703 -- 748Benjamin Doerr, Carola Doerr, Timo Kötzing. Solving Problems with Unknown Solution Length at Almost No Extra Cost
749 -- 795Chao Qian, Chao Bian, Wu Jiang, Ke Tang. Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise
796 -- 827Tomas Gavenciak, Barbara Geissmann, Johannes Lengler. Sorting by Swaps with Noisy Comparisons
828 -- 857Feng Shi, Martin Schirneck, Tobias Friedrich 0001, Timo Kötzing, Frank Neumann 0001. Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints
858 -- 885Samadhi Nallaperuma, Pietro Simone Oliveto, Jorge Pérez Heredia, Dirk Sudholt. On the Analysis of Trajectory-Based Search Algorithms: When is it Beneficial to Reject Improvements?
886 -- 915Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich 0001, Timo Kötzing, Martin Schirneck. Island Models Meet Rumor Spreading