Thomas Jansen

103 papers A 35B 2Journal 33Unranked 23
YearRankTypeTitle / Venue / Authors
2024 — conf
Experimental and Theoretical Analysis of Local Search Optimising OBDD Variable Orderings.
EvoStar
Thomas Jansen, Christine Zarges
2022 — ed.
Advances in Computational Intelligence Systems - Contributions Presented at the 20th UK Workshop on Computational Intelligence, September 8-10, 2021, Aberystwyth, Wales, UK
UKCI
Thomas Jansen, Richard Jensen, Neil Mac Parthaláin, Chih-Min Lin
2020 — ch.
Analysing Stochastic Search Heuristics Operating on a Fixed Budget.
Theory of Evolutionary Computation
Thomas Jansen
2019 J jnl
Unlimited Budget Analysis of Randomised Search Heuristics.
CoRR
Jun He, Thomas Jansen, Christine Zarges
2019 — conf
Unlimited budget analysis.
GECCO (Companion)
Jun He, Thomas Jansen, Christine Zarges
2018 — conf
Theoretical Analysis of Lexicase Selection in Multi-objective Optimization.
PPSN (2)
Thomas Jansen, Christine Zarges
2018 — conf
Workshops at PPSN 2018.
PPSN (2)
Robin C. Purshouse, Christine Zarges, Sylvain Cussat-Blanc, Michael G. Epitropakis, Marcus Gallagher, Thomas Jansen, Pascal Kerschke, Xiaodong Li, Fernando G. Lobo, Julian F. Miller, Pietro S. Oliveto, Mike Preuss, Giovanni Squillero, Alberto Paolo Tonda, Markus Wagner, Thomas Weise, Dennis Wilson, Borys Wróbel, Ales Zamuda
2017 J jnl
On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation.
Algorithmica
Dogan Corus, Jun He, Thomas Jansen, Pietro S. Oliveto, Dirk Sudholt, Christine Zarges
2017 J jnl
Populations Can Be Essential in Tracking Dynamic Optima.
Algorithmica
Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre
2016 A conf
Example Landscapes to Support Analysis of Multimodal Optimisation.
PPSN
Thomas Jansen, Christine Zarges
2016 J jnl
Populations can be essential in tracking dynamic optima.
CoRR
Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre
2015 J jnl
Analysis of Randomised Search Heuristics for Dynamic Optimisation.
Evol. Comput.
Thomas Jansen, Christine Zarges
2015 J jnl
Genetic and Evolutionary Computation.
Theor. Comput. Sci.
Tobias Friedrich, Jun He, Thomas Jansen, Alberto Moraglio
2015 A conf
On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations.
GECCO
Dogan Corus, Jun He, Thomas Jansen, Pietro S. Oliveto, Dirk Sudholt, Christine Zarges
2015 A conf
On the Black-Box Complexity of Example Functions: The Real Jump Function.
FOGA
Thomas Jansen
2015 A conf
Populations can be Essential in Dynamic Optimisation.
GECCO
Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre
2015 A ed.
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17 - 20, 2015
FOGA
Jun He, Thomas Jansen, Gabriela Ochoa, Christine Zarges
2014 — conf
Artificial immune systems for optimisation.
GECCO (Companion)
Thomas Jansen, Christine Zarges
2014 — ch.
Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics.
Theory and Principled Methods for the Design of Metaheuristics
Thomas Jansen
2014 A conf
Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem.
GECCO
Thomas Jansen, Christine Zarges
2014 J jnl
Performance analysis of randomised search heuristics operating with a fixed budget.
Theor. Comput. Sci.
Thomas Jansen, Christine Zarges
2014 J jnl
Reevaluating Immune-Inspired Hypermutations Using the Fixed Budget Perspective.
IEEE Trans. Evol. Comput.
Thomas Jansen, Christine Zarges
2014 J jnl
Transforming Evolutionary Search into Higher-Level Evolutionary Search by Capturing Problem Structure.
IEEE Trans. Evol. Comput.
Rob Mills, Thomas Jansen, Richard A. Watson
2013 A conf
A method to derive fixed budget results from expected optimisation times.
GECCO
Benjamin Doerr, Thomas Jansen, Carsten Witt, Christine Zarges
2013 — book
Analyzing Evolutionary Algorithms - The Computer Science Perspective
Thomas Jansen
2013 A conf
Approximating vertex cover using edge-based representations.
FOGA
Thomas Jansen, Pietro S. Oliveto, Christine Zarges
2013 — conf
Artificial immune systems for optimisation.
GECCO (Companion)
Thomas Jansen, Christine Zarges
2013 J jnl
Mutation Rate Matters Even When Optimizing Monotonic Functions.
Evol. Comput.
Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
2012 — conf
Artificial immune systems for optimisation.
GECCO (Companion)
Thomas Jansen, Christine Zarges
2012 — ch.
Computational Complexity of Evolutionary Algorithms.
Handbook of Natural Computing
Thomas Jansen
2012 — conf
Computing Longest Common Subsequences with the B-Cell Algorithm.
ICARIS
Thomas Jansen, Christine Zarges
2012 A conf
Fixed budget computations: a different perspective on run time analysis.
GECCO
Thomas Jansen, Christine Zarges
2011 A conf
Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering.
FOGA
Thomas Jansen, Christine Zarges
2011 J jnl
Analyzing different variants of immune inspired somatic contiguous hypermutations.
Theor. Comput. Sci.
Thomas Jansen, Christine Zarges
2011 J jnl
Artificial Immune Systems (Dagstuhl Seminar 11172).
Dagstuhl Reports
Emma Hart, Thomas Jansen, Jon Timmis
2011 — conf
Computational complexity and evolutionary computation.
GECCO (Companion)
Thomas Jansen, Frank Neumann
2011 J jnl
On benefits and drawbacks of aging strategies for randomized search heuristics.
Theor. Comput. Sci.
Thomas Jansen, Christine Zarges
2011 — conf
On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem.
ICARIS
Thomas Jansen, Pietro S. Oliveto, Christine Zarges
2011 J jnl
On the role of age diversity for effective aging operators.
Evol. Intell.
Thomas Jansen, Christine Zarges
2011 — ch.
Simulated Annealing.
Theory of Randomized Search Heuristics
Thomas Jansen
2011 J jnl
Theory of Evolutionary Computation.
Algorithmica
Benjamin Doerr, Thomas Jansen
2011 — conf
Variation in Artificial Immune Systems: Hypermutations with Mutation Potential.
ICARIS
Thomas Jansen, Christine Zarges
2010 A conf
Aging beyond restarts.
GECCO
Thomas Jansen, Christine Zarges
2010 J jnl
Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem.
Algorithmica
Thomas Jansen, Dennis Weyland
2010 J jnl
Analysis of an Asymmetric Mutation Operator.
Evol. Comput.
Thomas Jansen, Dirk Sudholt
2010 — conf
Computational complexity and evolutionary computation.
GECCO (Companion)
Thomas Jansen, Frank Neumann
2010 J jnl
Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization.
Evol. Comput.
Thomas Jansen, Frank Neumann
2010 A conf
Incremental evolution of local search heuristics.
GECCO
Dara Curran, Eugene C. Freuder, Thomas Jansen
2010 — conf
On the Benefits of Aging and the Importance of Details.
ICARIS
Thomas Jansen, Christine Zarges
2010 J jnl
Optimizing Monotone Functions Can Be Difficult
CoRR
Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
2010 — conf
Optimizing Monotone Functions Can Be Difficult.
PPSN (1)
Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
2010 J jnl
Stability in the Self-Organized Evolution of Networks.
Algorithmica
Madeleine Theile, Thomas Jansen
2009 — conf
A Theoretical Analysis of Immune Inspired Somatic Contiguous Hypermutations for Function Optimization.
ICARIS
Thomas Jansen, Christine Zarges
2009 — conf
Comparing Different Aging Operators.
ICARIS
Thomas Jansen, Christine Zarges
2009 — conf
Computational complexity and evolutionary computation.
GECCO (Companion)
Thomas Jansen, Frank Neumann
2009 A ed.
Foundations of Genetic Algorithms, 10th ACM SIGEVO International Workshop, FOGA 2009, Orlando, Forida, USA, January 9-11, 2009, Proceedings
FOGA
Ivan I. Garibay, Thomas Jansen, R. Paul Wiegand, Annie S. Wu
2009 J jnl
Ingo Wegener.
Evol. Comput.
Thomas Jansen, Melanie Schmidt, Dirk Sudholt, Carsten Witt, Christine Zarges
2009 A conf
Maximal age in randomized search heuristics with aging.
GECCO
Christian Horoba, Thomas Jansen, Christine Zarges
2008 A conf
Comparing global and local mutations on bit strings.
GECCO
Benjamin Doerr, Thomas Jansen, Christian Klein
2008 — conf
Computational complexity and evolutionary computation.
GECCO (Companion)
Thomas Jansen, Frank Neumann
2008 A ed.
Parallel Problem Solving from Nature - PPSN X, 10th International Conference Dortmund, Germany, September 13-17, 2008, Proceedings
PPSN
Günter Rudolph, Thomas Jansen, Simon M. Lucas, Carlo Poloni, Nicola Beume
2007 A conf
A building-block royal road where crossover is provably essential.
GECCO
Richard A. Watson, Thomas Jansen
2007 J jnl
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation.
Theor. Comput. Sci.
Thomas Jansen, Ingo Wegener
2007 A conf
Analysis of evolutionary algorithms for the longest common subsequence problem.
GECCO
Thomas Jansen, Dennis Weyland
2007 — conf
Computational complexity and evolutionary computation.
GECCO (Companion)
Thomas Jansen, Frank Neumann
2007 A conf
On the Brittleness of Evolutionary Algorithms.
FOGA
Thomas Jansen
2007 A conf
Stability in the self-organized evolution of networks.
GECCO
Thomas Jansen, Madeleine Theile
2006 — conf
06061 Abstracts Collection -- Theory of Evolutionary Algorithms.
Theory of Evolutionary Algorithms
Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose
2006 — conf
06061 Executive Summary -- Theory of Evolutionary Algoritms.
Theory of Evolutionary Algorithms
Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose
2006 J jnl
On the analysis of a dynamic evolutionary algorithm.
J. Discrete Algorithms
Thomas Jansen, Ingo Wegener
2006 A conf
On the local performance of simulated annealing and the (1+1) evolutionary algorithm.
GECCO
Thomas Jansen, Ingo Wegener
2006 — ed.
Theory of Evolutionary Algorithms, 05.02. - 10.02.2006
Theory of Evolutionary Algorithms
Dirk V. Arnold, Thomas Jansen, Michael D. Vose, Jonathan E. Rowe
2006 — ed.
Theory of Evolutionary Algorithms, 15.-20. February 2004
Theory of Evolutionary Algorithms
Hans-Georg Beyer, Thomas Jansen, Colin R. Reeves, Michael D. Vose
2006 J jnl
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization.
Theory Comput. Syst.
Stefan Droste, Thomas Jansen, Ingo Wegener
2005 A conf
A Comparison of Simulated Annealing with a Simple Evolutionary Algorithm.
FOGA
Thomas Jansen
2005 B conf
Design and analysis of an asymmetric mutation operator.
Congress on Evolutionary Computation
Thomas Jansen, Dirk Sudholt
2005 J jnl
On the Choice of the Offspring Population Size in Evolutionary Algorithms.
Evol. Comput.
Thomas Jansen, Kenneth A. De Jong, Ingo Wegener
2005 J jnl
Real royal road functions--where crossover provably is essential.
Discret. Appl. Math.
Thomas Jansen, Ingo Wegener
2005 A conf
Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice.
GECCO
Thomas Jansen, Ulf Schellbach
2004 — conf
04081 Abstracts Collection - Theory of Evolutionary Algorithms.
Theory of Evolutionary Algorithms
Hans-Georg Beyer, Thomas Jansen, Colin R. Reeves, Michael D. Vose
2004 A conf
Bridging the Gap Between Theory and Practice.
PPSN
Thomas Jansen, R. Paul Wiegand
2004 A conf
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.
PPSN
Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener
2004 J jnl
The Cooperative Coevolutionary (1+1) EA.
Evol. Comput.
Thomas Jansen, R. Paul Wiegand
2004 A conf
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.
PPSN
Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener
2003 A conf
Exploring the Explorative Advantage of the Cooperative Coevolutionary (1+1) EA.
GECCO
Thomas Jansen, R. Paul Wiegand
2003 B conf
Sequential versus parallel cooperative coevolutionary (1+1) EAs.
IEEE Congress on Evolutionary Computation
Thomas Jansen, R. Paul Wiegand
2003 J jnl
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
Electron. Colloquium Comput. Complex.
Stefan Droste, Thomas Jansen, Ingo Wegener
2002 A conf
A New Framework for the Valuation of Algorithms for Black-Box Optimization.
FOGA
Stefan Droste, Thomas Jansen, Karsten Tinnefeld, Ingo Wegener
2002 A conf
An Analysis Of The Role Of Offspring Population Size In EAs.
GECCO
Thomas Jansen, Kenneth A. De Jong
2002 A conf
On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms.
PPSN
Thomas Jansen
2002 J jnl
On the analysis of the (1+1) evolutionary algorithm.
Theor. Comput. Sci.
Stefan Droste, Thomas Jansen, Ingo Wegener
2002 J jnl
Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions.
Theor. Comput. Sci.
Stefan Droste, Thomas Jansen, Ingo Wegener
2002 J jnl
The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help.
Algorithmica
Thomas Jansen, Ingo Wegener
2001 J jnl
Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness.
IEEE Trans. Evol. Comput.
Thomas Jansen, Ingo Wegener
2000 A conf
Dynamic Parameter Control in Simple Evolutionary Algorithms.
FOGA
Stefan Droste, Thomas Jansen, Ingo Wegener
2000 A conf
On the Choice of the Mutation Probability for the (1+1) EA.
PPSN
Thomas Jansen, Ingo Wegener
2000 — —
Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen.
Thomas Jansen
2000 — ch.
Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen.
Ausgezeichnete Informatikdissertationen
Thomas Jansen
1999 A conf
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help.
ESA
Thomas Jansen, Ingo Wegener
1999 A conf
Perhaps Not a Free Lunch But At Least a Free Appetizer.
GECCO
Stefan Droste, Thomas Jansen, Ingo Wegener
1998 J jnl
A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs.
Evol. Comput.
Stefan Droste, Thomas Jansen, Ingo Wegener
1998 A conf
On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm.
PPSN
Stefan Droste, Thomas Jansen, Ingo Wegener
1997 — conf
Introduction to the Theory of Complexity and Approximation Algorithms.
Lectures on Proof Verification and Approximation Algorithms
Thomas Jansen