Thomas Jansen

According to our database1, Thomas Jansen authored at least 84 papers between 1997 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Unlimited Budget Analysis of Randomised Search Heuristics.
CoRR, 2019

Unlimited budget analysis.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

2018

Theoretical Analysis of Lexicase Selection in Multi-objective Optimization.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

2017
Populations Can Be Essential in Tracking Dynamic Optima.
Algorithmica, 2017

On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation.
Algorithmica, 2017

2016
Example Landscapes to Support Analysis of Multimodal Optimisation.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

2015
Genetic and Evolutionary Computation.
Theor. Comput. Sci., 2015

Analysis of Randomised Search Heuristics for Dynamic Optimisation.
Evolutionary Computation, 2015

Populations can be Essential in Dynamic Optimisation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

On the Black-Box Complexity of Example Functions: The Real Jump Function.
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

2014
Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics.
Proceedings of the Theory and Principled Methods for the Design of Metaheuristics, 2014

Transforming Evolutionary Search into Higher-Level Evolutionary Search by Capturing Problem Structure.
IEEE Trans. Evolutionary Computation, 2014

Reevaluating Immune-Inspired Hypermutations Using the Fixed Budget Perspective.
IEEE Trans. Evolutionary Computation, 2014

Performance analysis of randomised search heuristics operating with a fixed budget.
Theor. Comput. Sci., 2014

Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
Analyzing Evolutionary Algorithms - The Computer Science Perspective
Natural Computing Series, Springer, ISBN: 978-3-642-17338-7, 2013

Mutation Rate Matters Even When Optimizing Monotonic Functions.
Evolutionary Computation, 2013

A method to derive fixed budget results from expected optimisation times.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Approximating vertex cover using edge-based representations.
Proceedings of the Foundations of Genetic Algorithms XII, 2013

2012
Computational Complexity of Evolutionary Algorithms.
Proceedings of the Handbook of Natural Computing, 2012

Computing Longest Common Subsequences with the B-Cell Algorithm.
Proceedings of the Artificial Immune Systems - 11th International Conference, 2012

Artificial immune systems for optimisation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Fixed budget computations: a different perspective on run time analysis.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
On benefits and drawbacks of aging strategies for randomized search heuristics.
Theor. Comput. Sci., 2011

Analyzing different variants of immune inspired somatic contiguous hypermutations.
Theor. Comput. Sci., 2011

On the role of age diversity for effective aging operators.
Evolutionary Intelligence, 2011

Artificial Immune Systems (Dagstuhl Seminar 11172).
Dagstuhl Reports, 2011

Theory of Evolutionary Computation.
Algorithmica, 2011

Variation in Artificial Immune Systems: Hypermutations with Mutation Potential.
Proceedings of the Artificial Immune Systems - 10th International Conference, 2011

On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem.
Proceedings of the Artificial Immune Systems - 10th International Conference, 2011

Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Simulated Annealing.
Proceedings of the Theory of Randomized Search Heuristics: Foundations and Recent Developments., 2011

2010
Analysis of an Asymmetric Mutation Operator.
Evolutionary Computation, 2010

Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization.
Evolutionary Computation, 2010

Optimizing Monotone Functions Can Be Difficult
CoRR, 2010

Stability in the Self-Organized Evolution of Networks.
Algorithmica, 2010

Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem.
Algorithmica, 2010

Optimizing Monotone Functions Can Be Difficult.
Proceedings of the Parallel Problem Solving from Nature, 2010

On the Benefits of Aging and the Importance of Details.
Proceedings of the Artificial Immune Systems, 9th International Conference, 2010

Aging beyond restarts.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Computational complexity and evolutionary computation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Incremental evolution of local search heuristics.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009
Ingo Wegener.
Evolutionary Computation, 2009

Comparing Different Aging Operators.
Proceedings of the Artificial Immune Systems, 8th International Conference, 2009

A Theoretical Analysis of Immune Inspired Somatic Contiguous Hypermutations for Function Optimization.
Proceedings of the Artificial Immune Systems, 8th International Conference, 2009

Maximal age in randomized search heuristics with aging.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

2008
Comparing global and local mutations on bit strings.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

2007
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation.
Theor. Comput. Sci., 2007

A building-block royal road where crossover is provably essential.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

On the Brittleness of Evolutionary Algorithms.
Proceedings of the Foundations of Genetic Algorithms, 9th International Workshop, 2007

2006
On the analysis of a dynamic evolutionary algorithm.
J. Discrete Algorithms, 2006

On the local performance of simulated annealing and the (1+1) evolutionary algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

06061 Abstracts Collection -- Theory of Evolutionary Algorithms.
Proceedings of the Theory of Evolutionary Algorithms, 05.02. - 10.02.2006, 2006

06061 Executive Summary -- Theory of Evolutionary Algoritms.
Proceedings of the Theory of Evolutionary Algorithms, 05.02. - 10.02.2006, 2006

2005
On the Choice of the Offspring Population Size in Evolutionary Algorithms.
Evolutionary Computation, 2005

Real royal road functions--where crossover provably is essential.
Discrete Applied Mathematics, 2005

Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

A Comparison of Simulated Annealing with a Simple Evolutionary Algorithm.
Proceedings of the Foundations of Genetic Algorithms, 8th International Workshop, 2005

Design and analysis of an asymmetric mutation operator.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

2004
The Cooperative Coevolutionary (1+1) EA.
Evolutionary Computation, 2004

Bridging the Gap Between Theory and Practice.
Proceedings of the Parallel Problem Solving from Nature, 2004

The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.
Proceedings of the Parallel Problem Solving from Nature, 2004

Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.
Proceedings of the Parallel Problem Solving from Nature, 2004

04081 Abstracts Collection - Theory of Evolutionary Algorithms.
Proceedings of the Theory of Evolutionary Algorithms, 15.-20. February 2004, 2004

2003
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
Electronic Colloquium on Computational Complexity (ECCC), 2003

Exploring the Explorative Advantage of the Cooperative Coevolutionary (1+1) EA.
Proceedings of the Genetic and Evolutionary Computation, 2003

Sequential versus parallel cooperative coevolutionary (1+1) EAs.
Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2003, 8, 2003

2002
Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions.
Theor. Comput. Sci., 2002

On the analysis of the (1+1) evolutionary algorithm.
Theor. Comput. Sci., 2002

The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help.
Algorithmica, 2002

On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms.
Proceedings of the Parallel Problem Solving from Nature, 2002

An Analysis Of The Role Of Offspring Population Size In EAs.
Proceedings of the GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 2002

A New Framework for the Valuation of Algorithms for Black-Box Optimization.
Proceedings of the Seventh Workshop on Foundations of Genetic Algorithms, 2002

2001
Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness.
IEEE Trans. Evolutionary Computation, 2001

2000
On the Choice of the Mutation Probability for the (1+1) EA.
Proceedings of the Parallel Problem Solving from Nature, 2000

Dynamic Parameter Control in Simple Evolutionary Algorithms.
Proceedings of the Sixth Workshop on Foundations of Genetic Algorithms, 2000

Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen.
PhD thesis, 2000

1999
Perhaps Not a Free Lunch But At Least a Free Appetizer.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 1999

On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help.
Proceedings of the Algorithms, 1999

1998
A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs.
Evolutionary Computation, 1998

On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm.
Proceedings of the Parallel Problem Solving from Nature, 1998

1997
Introduction to the Theory of Complexity and Approximation Algorithms.
Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997


  Loading...