Thomas Jansen

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 9

Top Venues

GECCO

GECCO (Companion)

IEEE Trans. Evol. Comput.

CoRR

University of Dortmund, Germany (PHD)

Education History

University of Dortmund, Germany

PHD

Publications

Thomas Jansen, Christine Zarges
Experimental and Theoretical Analysis of Local Search Optimising OBDD Variable Orderings. EvoStar (2024)
Jun He, Thomas Jansen, Christine Zarges
Unlimited Budget Analysis of Randomised Search Heuristics. CoRR (2019)
Jun He, Thomas Jansen, Christine Zarges
Unlimited budget analysis. GECCO (Companion) (2019)
Thomas Jansen, Christine Zarges
Theoretical Analysis of Lexicase Selection in Multi-objective Optimization. PPSN (2) (2018)
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
Workshops at PPSN 2018. PPSN (2) (2018)
Dogan Corus, Jun He, Thomas Jansen, Pietro S. Oliveto, Dirk Sudholt, Christine Zarges
On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. Algorithmica 78 (2) (2017)
Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre
Populations Can Be Essential in Tracking Dynamic Optima. Algorithmica 78 (2) (2017)
Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre
Populations can be essential in tracking dynamic optima. CoRR (2016)
Thomas Jansen, Christine Zarges
Example Landscapes to Support Analysis of Multimodal Optimisation. PPSN (2016)
Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre
Populations can be Essential in Dynamic Optimisation. GECCO (2015)
Tobias Friedrich, Jun He, Thomas Jansen, Alberto Moraglio
Genetic and Evolutionary Computation. Theor. Comput. Sci. 561 (2015)
Thomas Jansen
On the Black-Box Complexity of Example Functions: The Real Jump Function. FOGA (2015)
Thomas Jansen, Christine Zarges
Analysis of Randomised Search Heuristics for Dynamic Optimisation. Evol. Comput. 23 (4) (2015)
Dogan Corus, Jun He, Thomas Jansen, Pietro S. Oliveto, Dirk Sudholt, Christine Zarges
On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations. GECCO (2015)
Thomas Jansen, Christine Zarges
Performance analysis of randomised search heuristics operating with a fixed budget. Theor. Comput. Sci. 545 (2014)
Thomas Jansen, Christine Zarges
Artificial immune systems for optimisation. GECCO (Companion) (2014)
Thomas Jansen, Christine Zarges
Reevaluating Immune-Inspired Hypermutations Using the Fixed Budget Perspective. IEEE Trans. Evol. Comput. 18 (5) (2014)
Thomas Jansen, Christine Zarges
Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem. GECCO (2014)
Rob Mills, Thomas Jansen, Richard A. Watson
Transforming Evolutionary Search into Higher-Level Evolutionary Search by Capturing Problem Structure. IEEE Trans. Evol. Comput. 18 (5) (2014)
Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
Mutation Rate Matters Even When Optimizing Monotonic Functions. Evol. Comput. 21 (1) (2013)
Benjamin Doerr, Thomas Jansen, Carsten Witt, Christine Zarges
A method to derive fixed budget results from expected optimisation times. GECCO (2013)
Thomas Jansen, Pietro S. Oliveto, Christine Zarges
Approximating vertex cover using edge-based representations. FOGA (2013)
Thomas Jansen, Christine Zarges
Artificial immune systems for optimisation. GECCO (Companion) (2013)
Thomas Jansen, Christine Zarges
Artificial immune systems for optimisation. GECCO (Companion) (2012)
Thomas Jansen, Christine Zarges
Computing Longest Common Subsequences with the B-Cell Algorithm. ICARIS (2012)
Thomas Jansen, Christine Zarges
Fixed budget computations: a different perspective on run time analysis. GECCO (2012)
Thomas Jansen, Christine Zarges
On benefits and drawbacks of aging strategies for randomized search heuristics. Theor. Comput. Sci. 412 (6) (2011)
Benjamin Doerr, Thomas Jansen
Theory of Evolutionary Computation. Algorithmica 59 (3) (2011)
Thomas Jansen, Pietro S. Oliveto, Christine Zarges
On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem. ICARIS (2011)
Thomas Jansen, Christine Zarges
Analyzing different variants of immune inspired somatic contiguous hypermutations. Theor. Comput. Sci. 412 (6) (2011)
Thomas Jansen, Christine Zarges
Variation in Artificial Immune Systems: Hypermutations with Mutation Potential. ICARIS (2011)
Thomas Jansen, Frank Neumann
Computational complexity and evolutionary computation. GECCO (Companion) (2011)
Thomas Jansen, Christine Zarges
On the role of age diversity for effective aging operators. Evol. Intell. 4 (2) (2011)
Thomas Jansen, Christine Zarges
Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. FOGA (2011)
Emma Hart, Thomas Jansen, Jon Timmis
Artificial Immune Systems (Dagstuhl Seminar 11172). Dagstuhl Reports 1 (4) (2011)
Thomas Jansen, Christine Zarges
On the Benefits of Aging and the Importance of Details. ICARIS (2010)
Thomas Jansen, Christine Zarges
Aging beyond restarts. GECCO (2010)
Thomas Jansen, Frank Neumann
Computational complexity and evolutionary computation. GECCO (Companion) (2010)
Thomas Jansen, Frank Neumann
Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization. Evol. Comput. 18 (3) (2010)
Thomas Jansen, Dirk Sudholt
Analysis of an Asymmetric Mutation Operator. Evol. Comput. 18 (1) (2010)
Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
Optimizing Monotone Functions Can Be Difficult CoRR (2010)
Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
Optimizing Monotone Functions Can Be Difficult. PPSN (1) (2010)
Dara Curran, Eugene C. Freuder, Thomas Jansen
Incremental evolution of local search heuristics. GECCO (2010)
Madeleine Theile, Thomas Jansen
Stability in the Self-Organized Evolution of Networks. Algorithmica 57 (1) (2010)
Thomas Jansen, Dennis Weyland
Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem. Algorithmica 57 (1) (2010)
Thomas Jansen, Christine Zarges
Comparing Different Aging Operators. ICARIS (2009)
Thomas Jansen, Melanie Schmidt, Dirk Sudholt, Carsten Witt, Christine Zarges
Ingo Wegener. Evol. Comput. 17 (1) (2009)
Thomas Jansen, Christine Zarges
A Theoretical Analysis of Immune Inspired Somatic Contiguous Hypermutations for Function Optimization. ICARIS (2009)
Christian Horoba, Thomas Jansen, Christine Zarges
Maximal age in randomized search heuristics with aging. GECCO (2009)
Thomas Jansen, Frank Neumann
Computational complexity and evolutionary computation. GECCO (Companion) (2009)
Thomas Jansen, Frank Neumann
Computational complexity and evolutionary computation. GECCO (Companion) (2008)
Benjamin Doerr, Thomas Jansen, Christian Klein
Comparing global and local mutations on bit strings. GECCO (2008)
Richard A. Watson, Thomas Jansen
A building-block royal road where crossover is provably essential. GECCO (2007)
Thomas Jansen, Dennis Weyland
Analysis of evolutionary algorithms for the longest common subsequence problem. GECCO (2007)
Thomas Jansen, Frank Neumann
Computational complexity and evolutionary computation. GECCO (Companion) (2007)
Thomas Jansen, Ingo Wegener
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation. Theor. Comput. Sci. 386 (1-2) (2007)
Thomas Jansen
On the Brittleness of Evolutionary Algorithms. FOGA (2007)
Thomas Jansen, Madeleine Theile
Stability in the self-organized evolution of networks. GECCO (2007)
Stefan Droste, Thomas Jansen, Ingo Wegener
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Theory Comput. Syst. 39 (4) (2006)
Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose
06061 Executive Summary -- Theory of Evolutionary Algoritms. Theory of Evolutionary Algorithms (2006)
Thomas Jansen, Ingo Wegener
On the analysis of a dynamic evolutionary algorithm. J. Discrete Algorithms 4 (1) (2006)
Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose
06061 Abstracts Collection -- Theory of Evolutionary Algorithms. Theory of Evolutionary Algorithms (2006)
Thomas Jansen, Ingo Wegener
On the local performance of simulated annealing and the (1+1) evolutionary algorithm. GECCO (2006)
Thomas Jansen, Dirk Sudholt
Design and analysis of an asymmetric mutation operator. Congress on Evolutionary Computation (2005)
Thomas Jansen, Ulf Schellbach
Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice. GECCO (2005)
Thomas Jansen
A Comparison of Simulated Annealing with a Simple Evolutionary Algorithm. FOGA (2005)
Thomas Jansen, Ingo Wegener
Real royal road functions--where crossover provably is essential. Discret. Appl. Math. 149 (1-3) (2005)
Thomas Jansen, Kenneth A. De Jong, Ingo Wegener
On the Choice of the Offspring Population Size in Evolutionary Algorithms. Evol. Comput. 13 (4) (2005)
Thomas Jansen, R. Paul Wiegand
The Cooperative Coevolutionary (1+1) EA. Evol. Comput. 12 (4) (2004)
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
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN (2004)
Thomas Jansen, R. Paul Wiegand
Bridging the Gap Between Theory and Practice. PPSN (2004)
Hans-Georg Beyer, Thomas Jansen, Colin R. Reeves, Michael D. Vose
04081 Abstracts Collection - Theory of Evolutionary Algorithms. Theory of Evolutionary Algorithms (2004)
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
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN (2004)
Thomas Jansen, R. Paul Wiegand
Sequential versus parallel cooperative coevolutionary (1+1) EAs. IEEE Congress on Evolutionary Computation (2003)
Thomas Jansen, R. Paul Wiegand
Exploring the Explorative Advantage of the Cooperative Coevolutionary (1+1) EA. GECCO (2003)
Stefan Droste, Thomas Jansen, Ingo Wegener
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization Electron. Colloquium Comput. Complex. (048) (2003)
Thomas Jansen
On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms. PPSN (2002)
Stefan Droste, Thomas Jansen, Ingo Wegener
Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions. Theor. Comput. Sci. 287 (1) (2002)
Thomas Jansen, Kenneth A. De Jong
An Analysis Of The Role Of Offspring Population Size In EAs. GECCO (2002)
Stefan Droste, Thomas Jansen, Karsten Tinnefeld, Ingo Wegener
A New Framework for the Valuation of Algorithms for Black-Box Optimization. FOGA (2002)
Stefan Droste, Thomas Jansen, Ingo Wegener
On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276 (1-2) (2002)
Thomas Jansen, Ingo Wegener
The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. Algorithmica 34 (1) (2002)
Thomas Jansen, Ingo Wegener
Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evol. Comput. 5 (6) (2001)
Stefan Droste, Thomas Jansen, Ingo Wegener
Dynamic Parameter Control in Simple Evolutionary Algorithms. FOGA (2000)
Thomas Jansen, Ingo Wegener
On the Choice of the Mutation Probability for the (1+1) EA. PPSN (2000)
Thomas Jansen
Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen. Ausgezeichnete Informatikdissertationen (2000)
Stefan Droste, Thomas Jansen, Ingo Wegener
Perhaps Not a Free Lunch But At Least a Free Appetizer. GECCO (1999)
Thomas Jansen, Ingo Wegener
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. ESA (1999)
Stefan Droste, Thomas Jansen, Ingo Wegener
A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs. Evol. Comput. 6 (2) (1998)
Stefan Droste, Thomas Jansen, Ingo Wegener
On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. PPSN (1998)
Thomas Jansen
Introduction to the Theory of Complexity and Approximation Algorithms. Lectures on Proof Verification and Approximation Algorithms (1997)

Thomas Jansen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Jansen