Edit Profile Jansen, Thomas Compute Distance To: Compute Author ID: jansen.thomas Published as: Jansen, T.; Jansen, Thomas Documents Indexed: 33 Publications since 1998, including 3 Books Reviewing Activity: 12 Reviews all top 5 Co-Authors 8 single-authored 10 Wegener, Ingo 6 Zarges, Christine 5 Droste, Stefan 2 He, Jun 2 Oliveto, Pietro S. 2 Rudolph, Günter 1 Beume, Nicola 1 Çörüş, Doğan 1 Dang, Duc-Cuong 1 Doerr, Benjamin 1 Friedrich, Tobias 1 Keeve, Erwin 1 Krol, Zdzislaw 1 Lehre, Per Kristian 1 Lucas, Simon M. 1 Moraglio, Alberto 1 Poloni, Carlo 1 Ritter, Lutz 1 Sader, Robert 1 Schwefel, Hans-Paul 1 Sudholt, Dirk 1 Theile, Madeleine 1 Tinnefeld, Karsten 1 von Rymon-Lipinski, Bartosz 1 Weyland, Dennis 1 Wiegand, R. Paul 1 Zeilhofer, Hans-Florian 1 Zerfass, Peter all top 5 Serials 7 Theoretical Computer Science 6 Algorithmica 1 Discrete Applied Mathematics 1 Theory of Computing Systems 1 Journal of Discrete Algorithms 1 Lecture Notes in Computer Science 1 Natural Computing Series Fields 30 Computer science (68-XX) 11 Operations research, mathematical programming (90-XX) 3 General and overarching topics; collections (00-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Biology and other natural sciences (92-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH 26 Publications have been cited 298 times in 180 Documents Cited by ▼ Year ▼ On the analysis of the \((1+1)\) evolutionary algorithm. Zbl 1002.68037Droste, Stefan; Jansen, Thomas; Wegener, Ingo 119 2002 Upper and lower bounds for randomized search heuristics in black-box optimization. Zbl 1103.68115Droste, Stefan; Jansen, Thomas; Wegener, Ingo 37 2006 Analyzing evolutionary algorithms. The computer science perspective. Zbl 1282.68008Jansen, Thomas 28 2013 Real royal road functions – where crossover provably is essential. Zbl 1101.68079Jansen, Thomas; Wegener, Ingo 20 2005 The analysis of evolutionary algorithms – A proof that crossover really can help. Zbl 1016.68030Jansen, T.; Wegener, I. 18 2002 Optimization with randomized search heuristics – the (A)NFL theorem, realistic scenarios, and difficult functions. Zbl 1061.68145Droste, Stefan; Jansen, Thomas; Wegener, Ingo 12 2002 Performance analysis of randomised search heuristics operating with a fixed budget. Zbl 1360.68781Jansen, Thomas; Zarges, Christine 8 2014 On the analysis of a dynamic evolutionary algorithm. Zbl 1128.68118Jansen, Thomas; Wegener, Ingo 8 2006 On the analysis of evolutionary algorithms. – A proof that crossover really can help. Zbl 0943.68139Jansen, Thomas; Wegener, Ingo 7 1999 Analyzing different variants of immune inspired somatic contiguous hypermutations. Zbl 1209.90358Jansen, Thomas; Zarges, Christine 5 2011 A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation. Zbl 1137.68049Jansen, Thomas; Wegener, Ingo 5 2007 On the brittleness of evolutionary algorithms. Zbl 1196.68193Jansen, Thomas 4 2007 On easiest functions for mutation operators in bio-inspired optimisation. Zbl 1366.68257Corus, Dogan; He, Jun; Jansen, Thomas; Oliveto, Pietro S.; Sudholt, Dirk; Zarges, Christine 3 2017 Approximating vertex cover using edge-based representations. Zbl 1369.68312Jansen, Thomas; Oliveto, Pietro S.; Zarges, Christine 3 2013 Finite elements in space and time for dynamic contact problems. Zbl 1195.74161Blum, H.; Jansen, T.; Rademacher, A.; Weinert, K. 3 2008 Dynamic parameter control in simple evolutionary algorithms. Zbl 0987.68098Droste, Stefan; Jansen, Thomas; Wegener, Ingo 3 2002 On classification of fitness functions. Zbl 1001.68195Jansen, T. 3 2001 Populations can be essential in tracking dynamic optima. Zbl 1366.68258Dang, Duc-Cuong; Jansen, Thomas; Lehre, Per Kristian 2 2017 On benefits and drawbacks of aging strategies for randomized search heuristics. Zbl 1208.68201Jansen, Thomas; Zarges, Christine 2 2011 Stability in the self-organized evolution of networks. Zbl 1181.90054Theile, Madeleine; Jansen, Thomas 2 2010 On the black-box complexity of example functions: the real jump function. Zbl 1361.68200Jansen, Thomas 1 2015 Black-box complexity for bounding the performance of randomized search heuristics. Zbl 1328.68197Jansen, Thomas 1 2014 Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. Zbl 1369.68313Jansen, Thomas; Zarges, Christine 1 2011 Theory of evolutionary algorithms and genetic programming. Zbl 1102.68547Droste, Stefan; Jansen, Thomas; Rudolph, Günter; Schwefel, Hans-Paul; Tinnefeld, Karsten; Wegener, Ingo 1 2003 Exploring the explorative advantage of the cooperative coevolutionary \((1+1)\) EA. Zbl 1028.68791Jansen, Thomas; Wiegand, R. Paul 1 2003 Introduction to the theory of complexity and approximation algorithms. Zbl 1401.68077Jansen, Thomas 1 1998 On easiest functions for mutation operators in bio-inspired optimisation. Zbl 1366.68257Corus, Dogan; He, Jun; Jansen, Thomas; Oliveto, Pietro S.; Sudholt, Dirk; Zarges, Christine 3 2017 Populations can be essential in tracking dynamic optima. Zbl 1366.68258Dang, Duc-Cuong; Jansen, Thomas; Lehre, Per Kristian 2 2017 On the black-box complexity of example functions: the real jump function. Zbl 1361.68200Jansen, Thomas 1 2015 Performance analysis of randomised search heuristics operating with a fixed budget. Zbl 1360.68781Jansen, Thomas; Zarges, Christine 8 2014 Black-box complexity for bounding the performance of randomized search heuristics. Zbl 1328.68197Jansen, Thomas 1 2014 Analyzing evolutionary algorithms. The computer science perspective. Zbl 1282.68008Jansen, Thomas 28 2013 Approximating vertex cover using edge-based representations. Zbl 1369.68312Jansen, Thomas; Oliveto, Pietro S.; Zarges, Christine 3 2013 Analyzing different variants of immune inspired somatic contiguous hypermutations. Zbl 1209.90358Jansen, Thomas; Zarges, Christine 5 2011 On benefits and drawbacks of aging strategies for randomized search heuristics. Zbl 1208.68201Jansen, Thomas; Zarges, Christine 2 2011 Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. Zbl 1369.68313Jansen, Thomas; Zarges, Christine 1 2011 Stability in the self-organized evolution of networks. Zbl 1181.90054Theile, Madeleine; Jansen, Thomas 2 2010 Finite elements in space and time for dynamic contact problems. Zbl 1195.74161Blum, H.; Jansen, T.; Rademacher, A.; Weinert, K. 3 2008 A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation. Zbl 1137.68049Jansen, Thomas; Wegener, Ingo 5 2007 On the brittleness of evolutionary algorithms. Zbl 1196.68193Jansen, Thomas 4 2007 Upper and lower bounds for randomized search heuristics in black-box optimization. Zbl 1103.68115Droste, Stefan; Jansen, Thomas; Wegener, Ingo 37 2006 On the analysis of a dynamic evolutionary algorithm. Zbl 1128.68118Jansen, Thomas; Wegener, Ingo 8 2006 Real royal road functions – where crossover provably is essential. Zbl 1101.68079Jansen, Thomas; Wegener, Ingo 20 2005 Theory of evolutionary algorithms and genetic programming. Zbl 1102.68547Droste, Stefan; Jansen, Thomas; Rudolph, Günter; Schwefel, Hans-Paul; Tinnefeld, Karsten; Wegener, Ingo 1 2003 Exploring the explorative advantage of the cooperative coevolutionary \((1+1)\) EA. Zbl 1028.68791Jansen, Thomas; Wiegand, R. Paul 1 2003 On the analysis of the \((1+1)\) evolutionary algorithm. Zbl 1002.68037Droste, Stefan; Jansen, Thomas; Wegener, Ingo 119 2002 The analysis of evolutionary algorithms – A proof that crossover really can help. Zbl 1016.68030Jansen, T.; Wegener, I. 18 2002 Optimization with randomized search heuristics – the (A)NFL theorem, realistic scenarios, and difficult functions. Zbl 1061.68145Droste, Stefan; Jansen, Thomas; Wegener, Ingo 12 2002 Dynamic parameter control in simple evolutionary algorithms. Zbl 0987.68098Droste, Stefan; Jansen, Thomas; Wegener, Ingo 3 2002 On classification of fitness functions. Zbl 1001.68195Jansen, T. 3 2001 On the analysis of evolutionary algorithms. – A proof that crossover really can help. Zbl 0943.68139Jansen, Thomas; Wegener, Ingo 7 1999 Introduction to the theory of complexity and approximation algorithms. Zbl 1401.68077Jansen, Thomas 1 1998 all cited Publications top 5 cited Publications all top 5 Cited by 213 Authors 27 Doerr, Benjamin 20 Witt, Carsten 17 Neumann, Frank 17 Sudholt, Dirk 11 Wegener, Ingo 10 Jansen, Thomas 10 Yao, Xin 9 Doerr, Carola 9 Friedrich, Tobias 7 He, Jun 7 Kötzing, Timo 7 Winzen, Carola 6 Lehre, Per Kristian 6 Oliveto, Pietro S. 5 Çörüş, Doğan 5 Lengler, Johannes 5 Zarges, Christine 5 Zhou, Yuren 4 Jägersküpper, Jens 4 Qian, Chao 4 Sutton, Andrew M. 4 Tang, Ke 4 Yu, Yang 3 Agapie, Alexandru 3 Dang, Duc-Cuong 3 Gießen, Christian 3 Gutjahr, Walter J. 3 Igel, Christian 3 Johannsen, Daniel 3 Oliveto, Pietro Simone 3 Paixão, Tiago 3 Rowe, Jonathan E. 3 Schirneck, Martin 3 Skutella, Martin 3 Storch, Tobias 3 Thyssen, Christian 3 Trubenová, Barbora 3 Xia, Xiaoyun 3 Yang, Jing 3 Zhou, Zhihua 2 Agapie, Mircea 2 Bian, Chao 2 Chen, Guoliang 2 Chen, Huiling 2 Chen, Tianshi 2 Coello Coello, Carlos A. 2 Hebbinghaus, Nils 2 Krejca, Martin S. 2 Lai, Xinsheng 2 Leon, Coromoto 2 Lissovoi, Andrei 2 Miranda, Gara 2 Pérez Heredia, Jorge 2 Prügel-Bennett, Adam 2 Reichel, Joachim 2 Sebastiani, Giovanni 2 Segura, Carlos 2 Semenov, Aleksandr Anatol’evich 2 Shi, Feng 2 Teytaud, Olivier 2 Toussaint, Marc 2 Yazdani, Donya 2 Yu, Kaiping 2 Zhao, Rui 1 Ab Aziz, Nor Azlina 1 Abdul Aziz, Nor Hidayati 1 Afshani, Peyman 1 Agrawal, Manindra 1 Akimoto, Youhei 1 Alharbi, Abir 1 Allmendinger, Richard W. 1 Antipov, Denis 1 Arcuri, Andrea 1 Astete-Morales, Sandra 1 Aston, Elizabeth 1 Aston, John A. D. 1 Auger, Anne 1 Aytug, Haldun 1 Badkobeh, Golnaz 1 Banerjee, Nilanjan 1 Barton, Nick H. 1 Belavkin, Roman V. 1 Benfold, W. 1 Beyer, Hans-Georg 1 Bischl, Bernd 1 Blum, Heribert 1 Bossek, Jakob 1 Channon, Alastair 1 Chen, Ying-Ping 1 Chen, Yu 1 Chen, Yu 1 Derrac, Joaquín 1 Dietzfelbinger, Martin 1 Diochnos, Dimitrios I. 1 Dörner, Karl F. 1 Drexl, Andreas 1 Droste, Stefan 1 Du, Xin 1 Ebel, Franziska 1 Fei, Minrui ...and 113 more Authors all top 5 Cited in 40 Serials 53 Theoretical Computer Science 42 Algorithmica 11 Artificial Intelligence 7 Information Processing Letters 5 Soft Computing 4 European Journal of Operational Research 3 Discrete Applied Mathematics 3 Information Sciences 3 Combinatorics, Probability and Computing 3 Natural Computing 3 JMMA. Journal of Mathematical Modelling and Algorithms 3 Journal of Discrete Algorithms 2 Computers & Operations Research 2 International Journal of Computer Mathematics 2 Methodology and Computing in Applied Probability 1 International Journal of Systems Science 1 Journal of Mathematical Biology 1 Applied Mathematics and Computation 1 International Journal for Numerical Methods in Engineering 1 Journal of Applied Probability 1 Mathematics and Computers in Simulation 1 Meccanica 1 Operations Research Letters 1 International Journal of Production Research 1 Journal of Computer Science and Technology 1 Information and Computation 1 Computational Mechanics 1 SIAM Journal on Discrete Mathematics 1 Annals of Operations Research 1 Machine Learning 1 Journal of Global Optimization 1 Pattern Recognition 1 Annals of Mathematics and Artificial Intelligence 1 Mathematical Problems in Engineering 1 Theory of Computing Systems 1 CEJOR. Central European Journal of Operations Research 1 Sādhanā 1 4OR 1 International Journal of Computational Intelligence and Applications 1 Journal of Theoretical Biology all top 5 Cited in 14 Fields 143 Computer science (68-XX) 88 Operations research, mathematical programming (90-XX) 11 Combinatorics (05-XX) 8 Probability theory and stochastic processes (60-XX) 7 Biology and other natural sciences (92-XX) 5 Numerical analysis (65-XX) 3 Statistics (62-XX) 3 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 2 Mechanics of particles and systems (70-XX) 2 Systems theory; control (93-XX) 1 Real functions (26-XX) 1 Convex and discrete geometry (52-XX) 1 Mechanics of deformable solids (74-XX) 1 Statistical mechanics, structure of matter (82-XX) Citations by Year