Introduction to the Theory of Complexity and Approximation Algorithms. - Thomas Jansen 001 (Lectures on Proof Verification and Approximation Algorithms, 1997)

On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. - Stefan Droste; Thomas Jansen 001; Ingo Wegener (PPSN, 1998)

A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs. - Stefan Droste; Thomas Jansen 001; Ingo Wegener (Evol. Comput., 1998)

On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. - Thomas Jansen 001; Ingo Wegener (ESA, 1999)

Perhaps Not a Free Lunch But At Least a Free Appetizer. - Stefan Droste; Thomas Jansen 001; Ingo Wegener (GECCO, 1999)

Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen. - Thomas Jansen 001 (2000)

Dynamic Parameter Control in Simple Evolutionary Algorithms. - Stefan Droste; Thomas Jansen 001; Ingo Wegener (FOGA, 2000)

Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen. - Thomas Jansen 001 (Ausgezeichnete Informatikdissertationen, 2000)

On the Choice of the Mutation Probability for the (1+1) EA. - Thomas Jansen 001; Ingo Wegener (PPSN, 2000)

Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. - Thomas Jansen 001; Ingo Wegener (IEEE Trans. Evol. Comput., 2001)

A New Framework for the Valuation of Algorithms for Black-Box Optimization. - Stefan Droste; Thomas Jansen 001; Karsten Tinnefeld; Ingo Wegener (FOGA, 2002)

An Analysis Of The Role Of Offspring Population Size In EAs. - Thomas Jansen 001; Kenneth A. De Jong (GECCO, 2002)

On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms. - Thomas Jansen 001 (PPSN, 2002)

On the analysis of the (1+1) evolutionary algorithm. - Stefan Droste; Thomas Jansen 001; Ingo Wegener (Theor. Comput. Sci., 2002)

Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions. - Stefan Droste; Thomas Jansen 001; Ingo Wegener (Theor. Comput. Sci., 2002)

Sequential versus parallel cooperative coevolutionary (1+1) EAs. - Thomas Jansen 001; R. Paul Wiegand (IEEE Congress on Evolutionary Computation, 2003)

Exploring the Explorative Advantage of the Cooperative Coevolutionary (1+1) EA. - Thomas Jansen 001; R. Paul Wiegand (GECCO, 2003)

04081 Abstracts Collection - Theory of Evolutionary Algorithms. - Hans-Georg Beyer; Thomas Jansen 001; Colin R. Reeves; Michael D. Vose (Theory of Evolutionary Algorithms, 2004)

Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. - Patrick Briest; Dimo Brockhoff; Bastian Degener; Matthias Englert; Christian Gunia; Oliver Heering; Thomas Jansen 001; Michael Leifhelm; Kai Plociennik; Heiko Röglin; Andrea Schweer; Dirk Sudholt; et al. (PPSN, 2004)

The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. - Patrick Briest; Dimo Brockhoff; Bastian Degener; Matthias Englert; Christian Gunia; Oliver Heering; Thomas Jansen 001; Michael Leifhelm; Kai Plociennik; Heiko Röglin; Andrea Schweer; Dirk Sudholt; et al. (PPSN, 2004)

Bridging the Gap Between Theory and Practice. - Thomas Jansen 001; R. Paul Wiegand (PPSN, 2004)

The Cooperative Coevolutionary (1+1) EA. - Thomas Jansen 001; R. Paul Wiegand (Evol. Comput., 2004)

Design and analysis of an asymmetric mutation operator. - Thomas Jansen 001; Dirk Sudholt (Congress on Evolutionary Computation, 2005)

A Comparison of Simulated Annealing with a Simple Evolutionary Algorithm. - Thomas Jansen 001 (FOGA, 2005)

Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice. - Thomas Jansen 001; Ulf Schellbach (GECCO, 2005)

Real royal road functions–where crossover provably is essential. - Thomas Jansen 001; Ingo Wegener (Discret. Appl. Math., 2005)

On the Choice of the Offspring Population Size in Evolutionary Algorithms. - Thomas Jansen 001; Kenneth A. De Jong; Ingo Wegener (Evol. Comput., 2005)

06061 Executive Summary – Theory of Evolutionary Algoritms. - Dirk V. Arnold; Thomas Jansen 001; Jonathan E. Rowe; Michael D. Vose (Theory of Evolutionary Algorithms, 2006)

06061 Abstracts Collection – Theory of Evolutionary Algorithms. - Dirk V. Arnold; Thomas Jansen 001; Jonathan E. Rowe; Michael D. Vose (Theory of Evolutionary Algorithms, 2006)

On the local performance of simulated annealing and the (1+1) evolutionary algorithm. - Thomas Jansen 001; Ingo Wegener (GECCO, 2006)

On the analysis of a dynamic evolutionary algorithm. - Thomas Jansen 001; Ingo Wegener (J. Discrete Algorithms, 2006)

Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. - Stefan Droste; Thomas Jansen 001; Ingo Wegener (Theory Comput. Syst., 2006)

On the Brittleness of Evolutionary Algorithms. - Thomas Jansen 001 (FOGA, 2007)

Stability in the self-organized evolution of networks. - Thomas Jansen 001; Madeleine Theile (GECCO, 2007)

Analysis of evolutionary algorithms for the longest common subsequence problem. - Thomas Jansen 001; Dennis Weyland (GECCO, 2007)

A building-block royal road where crossover is provably essential. - Richard A. Watson; Thomas Jansen 001 (GECCO, 2007)

A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation. - Thomas Jansen 001; Ingo Wegener (Theor. Comput. Sci., 2007)

Comparing global and local mutations on bit strings. - Benjamin Doerr; Thomas Jansen 001; Christian Klein 001 (GECCO, 2008)

Computational complexity and evolutionary computation. - Thomas Jansen 001; Frank Neumann 001 (GECCO (Companion), 2008)

Maximal age in randomized search heuristics with aging. - Christian Horoba; Thomas Jansen 001; Christine Zarges (GECCO, 2009)

A Theoretical Analysis of Immune Inspired Somatic Contiguous Hypermutations for Function Optimization. - Thomas Jansen 001; Christine Zarges (ICARIS, 2009)

Comparing Different Aging Operators. - Thomas Jansen 001; Christine Zarges (ICARIS, 2009)

Ingo Wegener. - Thomas Jansen 001; Melanie Schmidt 001; Dirk Sudholt; Carsten Witt; Christine Zarges (Evol. Comput., 2009)

Incremental evolution of local search heuristics. - Dara Curran; Eugene C. Freuder; Thomas Jansen 001 (GECCO, 2010)

Aging beyond restarts. - Thomas Jansen 001; Christine Zarges (GECCO, 2010)

On the Benefits of Aging and the Importance of Details. - Thomas Jansen 001; Christine Zarges (ICARIS, 2010)

Optimizing Monotone Functions Can Be Difficult. - Benjamin Doerr; Thomas Jansen 001; Dirk Sudholt; Carola Winzen; Christine Zarges (PPSN (1), 2010)

Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization. - Thomas Jansen 001; Frank Neumann 001 (Evol. Comput., 2010)

Analysis of an Asymmetric Mutation Operator. - Thomas Jansen 001; Dirk Sudholt (Evol. Comput., 2010)

Simulated Annealing. - Thomas Jansen 001 (Theory of Randomized Search Heuristics, 2011)

Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. - Thomas Jansen 001; Christine Zarges (FOGA, 2011)

On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem. - Thomas Jansen 001; Pietro S. Oliveto; Christine Zarges (ICARIS, 2011)

Variation in Artificial Immune Systems: Hypermutations with Mutation Potential. - Thomas Jansen 001; Christine Zarges (ICARIS, 2011)

Theory of Evolutionary Computation. - Benjamin Doerr; Thomas Jansen 001 (Algorithmica, 2011)

Artificial Immune Systems (Dagstuhl Seminar 11172). - Emma Hart; Thomas Jansen 001; Jon Timmis (Dagstuhl Reports, 2011)

On the role of age diversity for effective aging operators. - Thomas Jansen 001; Christine Zarges (Evol. Intell., 2011)

Analyzing different variants of immune inspired somatic contiguous hypermutations. - Thomas Jansen 001; Christine Zarges (Theor. Comput. Sci., 2011)

On benefits and drawbacks of aging strategies for randomized search heuristics. - Thomas Jansen 001; Christine Zarges (Theor. Comput. Sci., 2011)

Fixed budget computations: a different perspective on run time analysis. - Thomas Jansen 001; Christine Zarges (GECCO, 2012)

Computing Longest Common Subsequences with the B-Cell Algorithm. - Thomas Jansen 001; Christine Zarges (ICARIS, 2012)

Computational Complexity of Evolutionary Algorithms. - Thomas Jansen 001 (Handbook of Natural Computing, 2012)

Approximating vertex cover using edge-based representations. - Thomas Jansen 001; Pietro S. Oliveto; Christine Zarges (FOGA, 2013)

A method to derive fixed budget results from expected optimisation times. - Benjamin Doerr; Thomas Jansen 001; Carsten Witt; Christine Zarges (GECCO, 2013)

Mutation Rate Matters Even When Optimizing Monotonic Functions. - Benjamin Doerr; Thomas Jansen 001; Dirk Sudholt; Carola Winzen; Christine Zarges (Evol. Comput., 2013)

Analyzing Evolutionary Algorithms - The Computer Science Perspective - Thomas Jansen 001 (Springer, 2013)

Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem. - Thomas Jansen 001; Christine Zarges (GECCO, 2014)

Artificial immune systems for optimisation. - Thomas Jansen 001; Christine Zarges (GECCO (Companion), 2014)

Performance analysis of randomised search heuristics operating with a fixed budget. - Thomas Jansen 001; Christine Zarges (Theor. Comput. Sci., 2014)

Reevaluating Immune-Inspired Hypermutations Using the Fixed Budget Perspective. - Thomas Jansen 001; Christine Zarges (IEEE Trans. Evol. Comput., 2014)

Transforming Evolutionary Search into Higher-Level Evolutionary Search by Capturing Problem Structure. - Rob Mills; Thomas Jansen 001; Richard A. Watson (IEEE Trans. Evol. Comput., 2014)

Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics. - Thomas Jansen 001 (Theory and Principled Methods for the Design of Metaheuristics, 2014)

On the Black-Box Complexity of Example Functions: The Real Jump Function. - Thomas Jansen 001 (FOGA, 2015)

On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations. - Dogan Corus; Jun He 004; Thomas Jansen 001; Pietro S. Oliveto; Dirk Sudholt; Christine Zarges (GECCO, 2015)

Populations can be Essential in Dynamic Optimisation. - Duc-Cuong Dang; Thomas Jansen 001; Per Kristian Lehre (GECCO, 2015)

Analysis of Randomised Search Heuristics for Dynamic Optimisation. - Thomas Jansen 001; Christine Zarges (Evol. Comput., 2015)

Genetic and Evolutionary Computation. - Tobias Friedrich 001; Jun He 004; Thomas Jansen 001; Alberto Moraglio (Theor. Comput. Sci., 2015)

Example Landscapes to Support Analysis of Multimodal Optimisation. - Thomas Jansen 001; Christine Zarges (PPSN, 2016)

On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. - Dogan Corus; Jun He 004; Thomas Jansen 001; Pietro S. Oliveto; Dirk Sudholt; Christine Zarges (Algorithmica, 2017)

Populations Can Be Essential in Tracking Dynamic Optima. - Duc-Cuong Dang; Thomas Jansen 001; Per Kristian Lehre (Algorithmica, 2017)

Theoretical Analysis of Lexicase Selection in Multi-objective Optimization. - Thomas Jansen 001; Christine Zarges (PPSN (2), 2018)

Workshops at PPSN 2018. - Robin C. Purshouse; Christine Zarges; Sylvain Cussat-Blanc; Michael G. Epitropakis; Marcus Gallagher; Thomas Jansen 001; Pascal Kerschke; Xiaodong Li 001; Fernando G. Lobo; Julian F. Miller; Pietro S. Oliveto; Mike Preuss; et al. (PPSN (2), 2018)

Unlimited budget analysis. - Jun He 004; Thomas Jansen 001; Christine Zarges (GECCO (Companion), 2019)

Unlimited Budget Analysis of Randomised Search Heuristics. - Jun He 004; Thomas Jansen 001; Christine Zarges (CoRR, 2019)

Analysing Stochastic Search Heuristics Operating on a Fixed Budget. - Thomas Jansen 001 (Theory of Evolutionary Computation, 2020)

Experimental and Theoretical Analysis of Local Search Optimising OBDD Variable Orderings. - Thomas Jansen 001; Christine Zarges (EvoStar, 2024)