default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Jansen 0001
Person information
- affiliation: Aberystwyth University, UK
- affiliation (2009 - 2012): University College Cork, Ireland
- affiliation (PhD 2000): University of Dortmund, Germany
Other persons with the same name
- Thomas Jansen 0002 — Technical University of Braunschweig, Germany
- Thomas Jansen 0003 — RWTH Aachen, Germany
- Thomas Jansen 0004 — Saarland University, Germany
- Thomas Jansen 0005 — Surgical Systems Lab, Bonn, Germany
- Thomas Jansen 0006 — University of Cologne, Germany
- Thomas Jansen 0007 — duisport - Duisburger Hafen AG, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c54]Thomas Jansen
, Christine Zarges:
Experimental and Theoretical Analysis of Local Search Optimising OBDD Variable Orderings. EvoStar 2024: 177-192- 2022
- [e6]Thomas Jansen, Richard Jensen, Neil Mac Parthaláin, Chih-Min Lin:
Advances in Computational Intelligence Systems - Contributions Presented at the 20th UK Workshop on Computational Intelligence, September 8-10, 2021, Aberystwyth, Wales, UK. Advances in Intelligent Systems and Computing 1409, Springer 2022, ISBN 978-3-030-87093-5 [contents] - 2020
- [p5]Thomas Jansen:
Analysing Stochastic Search Heuristics Operating on a Fixed Budget. Theory of Evolutionary Computation 2020: 249-270
2010 – 2019
- 2019
- [c53]Jun He, Thomas Jansen, Christine Zarges:
Unlimited budget analysis. GECCO (Companion) 2019: 427-428 - [i8]Jun He, Thomas Jansen, Christine Zarges:
Unlimited Budget Analysis of Randomised Search Heuristics. CoRR abs/1909.03342 (2019) - 2018
- [c52]Thomas Jansen, Christine Zarges:
Theoretical Analysis of Lexicase Selection in Multi-objective Optimization. PPSN (2) 2018: 153-164 - [c51]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: 490-497 - 2017
- [j28]Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre:
Populations Can Be Essential in Tracking Dynamic Optima. Algorithmica 78(2): 660-680 (2017) - [j27]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): 714-740 (2017) - 2016
- [c50]Thomas Jansen, Christine Zarges:
Example Landscapes to Support Analysis of Multimodal Optimisation. PPSN 2016: 792-802 - [i7]Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre:
Populations can be essential in tracking dynamic optima. CoRR abs/1607.03317 (2016) - 2015
- [j26]Thomas Jansen, Christine Zarges:
Analysis of Randomised Search Heuristics for Dynamic Optimisation. Evol. Comput. 23(4): 513-541 (2015) - [j25]Tobias Friedrich, Jun He, Thomas Jansen, Alberto Moraglio:
Genetic and Evolutionary Computation. Theor. Comput. Sci. 561: 1-2 (2015) - [c49]Thomas Jansen:
On the Black-Box Complexity of Example Functions: The Real Jump Function. FOGA 2015: 16-24 - [c48]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: 1399-1406 - [c47]Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre:
Populations can be Essential in Dynamic Optimisation. GECCO 2015: 1407-1414 - [e5]Jun He, Thomas Jansen, Gabriela Ochoa, Christine Zarges:
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17 - 20, 2015. ACM 2015, ISBN 978-1-4503-3434-1 [contents] - 2014
- [j24]Thomas Jansen, Christine Zarges:
Performance analysis of randomised search heuristics operating with a fixed budget. Theor. Comput. Sci. 545: 39-58 (2014) - [j23]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): 628-642 (2014) - [j22]Thomas Jansen, Christine Zarges:
Reevaluating Immune-Inspired Hypermutations Using the Fixed Budget Perspective. IEEE Trans. Evol. Comput. 18(5): 674-688 (2014) - [c46]Thomas Jansen, Christine Zarges:
Artificial immune systems for optimisation. GECCO (Companion) 2014: 749-764 - [c45]Thomas Jansen, Christine Zarges:
Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem. GECCO 2014: 975-982 - [p4]Thomas Jansen:
Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics. Theory and Principled Methods for the Design of Metaheuristics 2014: 85-110 - 2013
- [b2]Thomas Jansen:
Analyzing Evolutionary Algorithms - The Computer Science Perspective. Natural Computing Series, Springer 2013, ISBN 978-3-642-17338-7, pp. 1-236 - [j21]Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges:
Mutation Rate Matters Even When Optimizing Monotonic Functions. Evol. Comput. 21(1): 1-27 (2013) - [c44]Thomas Jansen, Pietro S. Oliveto, Christine Zarges:
Approximating vertex cover using edge-based representations. FOGA 2013: 87-96 - [c43]Thomas Jansen, Christine Zarges:
Artificial immune systems for optimisation. GECCO (Companion) 2013: 779-796 - [c42]Benjamin Doerr, Thomas Jansen, Carsten Witt, Christine Zarges:
A method to derive fixed budget results from expected optimisation times. GECCO 2013: 1581-1588 - 2012
- [c41]Thomas Jansen, Christine Zarges:
Artificial immune systems for optimisation. GECCO (Companion) 2012: 1059-1078 - [c40]Thomas Jansen, Christine Zarges:
Fixed budget computations: a different perspective on run time analysis. GECCO 2012: 1325-1332 - [c39]Thomas Jansen, Christine Zarges:
Computing Longest Common Subsequences with the B-Cell Algorithm. ICARIS 2012: 111-124 - [p3]Thomas Jansen:
Computational Complexity of Evolutionary Algorithms. Handbook of Natural Computing 2012: 815-845 - 2011
- [j20]Benjamin Doerr, Thomas Jansen:
Theory of Evolutionary Computation. Algorithmica 59(3): 299-300 (2011) - [j19]Thomas Jansen, Christine Zarges:
On the role of age diversity for effective aging operators. Evol. Intell. 4(2): 99-125 (2011) - [j18]Thomas Jansen, Christine Zarges:
Analyzing different variants of immune inspired somatic contiguous hypermutations. Theor. Comput. Sci. 412(6): 517-533 (2011) - [j17]Thomas Jansen, Christine Zarges:
On benefits and drawbacks of aging strategies for randomized search heuristics. Theor. Comput. Sci. 412(6): 543-559 (2011) - [c38]Thomas Jansen, Christine Zarges:
Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. FOGA 2011: 1-14 - [c37]Thomas Jansen, Frank Neumann:
Computational complexity and evolutionary computation. GECCO (Companion) 2011: 1053-1080 - [c36]Thomas Jansen, Pietro S. Oliveto, Christine Zarges:
On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem. ICARIS 2011: 117-131 - [c35]Thomas Jansen, Christine Zarges:
Variation in Artificial Immune Systems: Hypermutations with Mutation Potential. ICARIS 2011: 132-145 - [p2]Thomas Jansen:
Simulated Annealing. Theory of Randomized Search Heuristics 2011: 171-195 - [i6]Emma Hart, Thomas Jansen, Jon Timmis:
Artificial Immune Systems (Dagstuhl Seminar 11172). Dagstuhl Reports 1(4): 100-111 (2011) - 2010
- [j16]Madeleine Theile, Thomas Jansen:
Stability in the Self-Organized Evolution of Networks. Algorithmica 57(1): 147-169 (2010) - [j15]Thomas Jansen, Dennis Weyland:
Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem. Algorithmica 57(1): 170-186 (2010) - [j14]Thomas Jansen, Dirk Sudholt:
Analysis of an Asymmetric Mutation Operator. Evol. Comput. 18(1): 1-26 (2010) - [j13]Thomas Jansen, Frank Neumann:
Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization. Evol. Comput. 18(3): 333-334 (2010) - [c34]Thomas Jansen, Christine Zarges:
Aging beyond restarts. GECCO 2010: 705-712 - [c33]Dara Curran, Eugene C. Freuder, Thomas Jansen:
Incremental evolution of local search heuristics. GECCO 2010: 981-982 - [c32]Thomas Jansen, Frank Neumann:
Computational complexity and evolutionary computation. GECCO (Companion) 2010: 2683-2710 - [c31]Thomas Jansen, Christine Zarges:
On the Benefits of Aging and the Importance of Details. ICARIS 2010: 61-74 - [c30]Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges:
Optimizing Monotone Functions Can Be Difficult. PPSN (1) 2010: 42-51 - [i5]Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges:
Optimizing Monotone Functions Can Be Difficult. CoRR abs/1010.1429 (2010)
2000 – 2009
- 2009
- [j12]Thomas Jansen, Melanie Schmidt, Dirk Sudholt, Carsten Witt, Christine Zarges:
Ingo Wegener. Evol. Comput. 17(1): 1-2 (2009) - [c29]Christian Horoba, Thomas Jansen, Christine Zarges:
Maximal age in randomized search heuristics with aging. GECCO 2009: 803-810 - [c28]Thomas Jansen, Frank Neumann:
Computational complexity and evolutionary computation. GECCO (Companion) 2009: 3157-3184 - [c27]Thomas Jansen, Christine Zarges:
A Theoretical Analysis of Immune Inspired Somatic Contiguous Hypermutations for Function Optimization. ICARIS 2009: 80-94 - [c26]Thomas Jansen, Christine Zarges:
Comparing Different Aging Operators. ICARIS 2009: 95-108 - [e4]Ivan I. Garibay, Thomas Jansen, R. Paul Wiegand, Annie S. Wu:
Foundations of Genetic Algorithms, 10th ACM SIGEVO International Workshop, FOGA 2009, Orlando, Forida, USA, January 9-11, 2009, Proceedings. ACM 2009, ISBN 978-1-60558-414-0 [contents] - 2008
- [c25]Benjamin Doerr, Thomas Jansen, Christian Klein:
Comparing global and local mutations on bit strings. GECCO 2008: 929-936 - [c24]Thomas Jansen, Frank Neumann:
Computational complexity and evolutionary computation. GECCO (Companion) 2008: 2417-2444 - [e3]Günter Rudolph, Thomas Jansen, Simon M. Lucas, Carlo Poloni, Nicola Beume:
Parallel Problem Solving from Nature - PPSN X, 10th International Conference Dortmund, Germany, September 13-17, 2008, Proceedings. Lecture Notes in Computer Science 5199, Springer 2008, ISBN 978-3-540-87699-1 [contents] - 2007
- [j11]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): 73-93 (2007) - [c23]Thomas Jansen:
On the Brittleness of Evolutionary Algorithms. FOGA 2007: 54-69 - [c22]Thomas Jansen, Madeleine Theile:
Stability in the self-organized evolution of networks. GECCO 2007: 931-938 - [c21]Thomas Jansen, Dennis Weyland:
Analysis of evolutionary algorithms for the longest common subsequence problem. GECCO 2007: 939-946 - [c20]Richard A. Watson, Thomas Jansen:
A building-block royal road where crossover is provably essential. GECCO 2007: 1452-1459 - [c19]Thomas Jansen, Frank Neumann:
Computational complexity and evolutionary computation. GECCO (Companion) 2007: 3225-3250 - 2006
- [j10]Thomas Jansen, Ingo Wegener:
On the analysis of a dynamic evolutionary algorithm. J. Discrete Algorithms 4(1): 181-199 (2006) - [j9]Stefan Droste, Thomas Jansen, Ingo Wegener:
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Theory Comput. Syst. 39(4): 525-544 (2006) - [c18]Thomas Jansen, Ingo Wegener:
On the local performance of simulated annealing and the (1+1) evolutionary algorithm. GECCO 2006: 469-476 - [e2]Hans-Georg Beyer, Thomas Jansen, Colin R. Reeves, Michael D. Vose:
Theory of Evolutionary Algorithms, 15.-20. February 2004. Dagstuhl Seminar Proceedings 04081, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [e1]Dirk V. Arnold, Thomas Jansen, Michael D. Vose, Jonathan E. Rowe:
Theory of Evolutionary Algorithms, 05.02. - 10.02.2006. Dagstuhl Seminar Proceedings 06061, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i4]Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose:
06061 Executive Summary -- Theory of Evolutionary Algoritms. Theory of Evolutionary Algorithms 2006 - [i3]Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose:
06061 Abstracts Collection -- Theory of Evolutionary Algorithms. Theory of Evolutionary Algorithms 2006 - 2005
- [j8]Thomas Jansen, Ingo Wegener:
Real royal road functions--where crossover provably is essential. Discret. Appl. Math. 149(1-3): 111-125 (2005) - [j7]Thomas Jansen, Kenneth A. De Jong, Ingo Wegener:
On the Choice of the Offspring Population Size in Evolutionary Algorithms. Evol. Comput. 13(4): 413-440 (2005) - [c17]Thomas Jansen, Dirk Sudholt:
Design and analysis of an asymmetric mutation operator. Congress on Evolutionary Computation 2005: 190-197 - [c16]Thomas Jansen:
A Comparison of Simulated Annealing with a Simple Evolutionary Algorithm. FOGA 2005: 37-57 - [c15]Thomas Jansen, Ulf Schellbach:
Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice. GECCO 2005: 841-848 - 2004
- [j6]Thomas Jansen, R. Paul Wiegand:
The Cooperative Coevolutionary (1+1) EA. Evol. Comput. 12(4): 405-434 (2004) - [c14]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: 21-30 - [c13]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: 31-40 - [c12]Thomas Jansen, R. Paul Wiegand:
Bridging the Gap Between Theory and Practice. PPSN 2004: 61-71 - [i2]Hans-Georg Beyer, Thomas Jansen, Colin R. Reeves, Michael D. Vose:
04081 Abstracts Collection - Theory of Evolutionary Algorithms. Theory of Evolutionary Algorithms 2004 - 2003
- [c11]Thomas Jansen, R. Paul Wiegand:
Sequential versus parallel cooperative coevolutionary (1+1) EAs. IEEE Congress on Evolutionary Computation 2003: 30-37 - [c10]Thomas Jansen, R. Paul Wiegand:
Exploring the Explorative Advantage of the Cooperative Coevolutionary (1+1) EA. GECCO 2003: 310-321 - [i1]Stefan Droste, Thomas Jansen, Ingo Wegener:
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j5]Thomas Jansen, Ingo Wegener:
The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. Algorithmica 34(1): 47-66 (2002) - [j4]Stefan Droste, Thomas Jansen, Ingo Wegener:
On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1-2): 51-81 (2002) - [j3]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): 131-144 (2002) - [c9]Stefan Droste, Thomas Jansen, Karsten Tinnefeld, Ingo Wegener:
A New Framework for the Valuation of Algorithms for Black-Box Optimization. FOGA 2002: 253-270 - [c8]Thomas Jansen, Kenneth A. De Jong:
An Analysis Of The Role Of Offspring Population Size In EAs. GECCO 2002: 238-246 - [c7]Thomas Jansen:
On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms. PPSN 2002: 33-43 - 2001
- [j2]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): 589-599 (2001) - 2000
- [b1]Thomas Jansen:
Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen. University of Dortmund, Germany, 2000, pp. 1-232 - [c6]Stefan Droste, Thomas Jansen, Ingo Wegener:
Dynamic Parameter Control in Simple Evolutionary Algorithms. FOGA 2000: 275-294 - [c5]Thomas Jansen, Ingo Wegener:
On the Choice of the Mutation Probability for the (1+1) EA. PPSN 2000: 89-98 - [p1]Thomas Jansen:
Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen. Ausgezeichnete Informatikdissertationen 2000: 75-84
1990 – 1999
- 1999
- [c4]Thomas Jansen, Ingo Wegener:
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. ESA 1999: 184-193 - [c3]Stefan Droste, Thomas Jansen, Ingo Wegener:
Perhaps Not a Free Lunch But At Least a Free Appetizer. GECCO 1999: 833-839 - 1998
- [j1]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): 185-196 (1998) - [c2]Stefan Droste, Thomas Jansen, Ingo Wegener:
On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. PPSN 1998: 13-22 - 1997
- [c1]Thomas Jansen:
Introduction to the Theory of Complexity and Approximation Algorithms. Lectures on Proof Verification and Approximation Algorithms 1997: 5-28
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 20:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
