Algorithmica, 0178-4617
Journal
1 - 9 out of 9Page size: 10
Publications
- 2019
- Published
A tight lower bound for planar Steiner Orientation
Rajesh Chitnis, 1 Aug 2019, In: Algorithmica. 81, 8, p. 3200-3216 17 p.Research output: Contribution to journal › Article › peer-review
- Published
Level-based analysis of the univariate marginal distribution algorithm
Per Kristian Lehre & Hai Nguyen, 15 Feb 2019, In: Algorithmica. 81, 2, p. 668-702 35 p.Research output: Contribution to journal › Article › peer-review
- 2017
- Published
Populations Can Be Essential in Tracking Dynamic Optima
Per Kristian Lehre, 1 Jun 2017, In: Algorithmica. 78, 2, p. 660-680 21 p.Research output: Contribution to journal › Article › peer-review
- Published
List H-coloring a graph by removing few vertices
Rajesh Chitnis, May 2017, In: Algorithmica. 78, 1, p. 110-146 37 p.Research output: Contribution to journal › Article › peer-review
- Published
A tight algorithm for Strongly Connected Steiner Subgraph on two terminals with demands
Rajesh Chitnis, 1 Apr 2017, In: Algorithmica. 77, 4, p. 1216-1239 24 p.Research output: Contribution to journal › Article › peer-review
- 2016
- Published
Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information
Per Kristian Lehre, 1 Jul 2016, In: Algorithmica. 75, 3, p. 428-461 34 p.Research output: Contribution to journal › Article › peer-review
- 2011
- Published
Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima
Dirk Sudholt, 1 Mar 2011, In: Algorithmica. 59, 3, p. 343-368 26 p.Research output: Contribution to journal › Article
- Published
Precision, Local Search and Unimodal Functions
Jon Rowe, 1 Mar 2011, In: Algorithmica. 59, 3, p. 301-322 22 p.Research output: Contribution to journal › Article
- Published
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
Pietro Oliveto, 1 Mar 2011, In: Algorithmica. 59, 3, p. 369-386 18 p.Research output: Contribution to journal › Article