Thomas Jansen: List of Publications

    (Edited) Books and Book Chapters

  1. Thomas Jansen (1998): Introduction to the theory of complexity and approximation algorithms. In E.W. Mayer, H.J. Prömel, A. Steger (Eds.): Lectures on Proof Verification and Approximation Algorithms. Springer, Berlin, Germany, pages 5-28.
  2. Thomas Jansen (2001): On classifications of fitness functions. In L. Kallel, B. Naudts and A. Rogers (Eds:): Theoretical Aspects of Evolutionary Computing. Springer, Berlin, Germany, pages 371-386.
  3. Thomas Jansen (2001): Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen. In D. Wagner (Ed.): Ausgezeichnete Informatikdissertationen 2000. Gesellschaft für Informatik, Bonn, Germany, pages 75-84.
  4. Stefan Droste, Thomas Jansen, Günter Rudolph, Hans-Paul Schwefel, Karsten Tinnefeld, and Ingo Wegener (2002): Theory of evolutionary algorithms and genetic programming. In H.-P. Schwefel, I. Wegener, and K. Weinert (Eds.): Advances in Computational Intelligence Theory and Practice. Springer, Berlin, Germany, pages 107-144.
  5. Günter Rudolph, Thomas Jansen, Simon Lucas, Carlo Poloni, Nicola Beume (Eds.): Parallel Problem Solving from Nature - PPSN X. Springer, Berlin, Germany, 2008. LNCS 5199.
  6. Ivan Garibay, Thomas Jansen, R. Paul Wiegand, and Annie S. Wu (Eds.): Proceedings of the Tenth ACM SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA). ACM, 2009.
  7. Thomas Jansen (2011): Simulated annealing. In A. Auger, B. Doerr (Eds.): Theory of Randomized Search Heuristics. World Scientific, pages 171-196.
  8. Thomas Jansen (2012): Computational complexity of evolutionary algorithms. In Grzegorz Rozenberg, Thomas Bäck, Joost N. Kok (Eds.): Handbook of Natural Computing. Springer, Berlin. Part 3, pages 815-845.
  9. Thomas Jansen (2013): Analyzing Evolutionary Algorithms. The Computer Science Perspective. Springer.
  10. Thomas Jansen (2014): Black-Box complexity for bounding the performance of randomized search heuristics. In Y. Borenstein, A. Moraglio (Eds.): Theory and Principled Methods for the Design of Metaheuristics. Springer. Pages 85-110.
  11. Jun He, Thomas Jansen, Gabriela Ochoa, Christine Zarges (Eds.): Proceedings of the Thirteenth ACM SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA 2015). ACM, 2015.
  12. Thomas Jansen, Richard Jensen, Neil Mac Parthalain, Chih-Min Lin (Eds.): Advances in Computational Intelligence Systems. Contributions Presented at the 20th UK Workshop on Computational Intelligence (UKCI 2021). Springer, 2022.

    Journal Articles

  13. Stefan Droste, Thomas Jansen, and Ingo Wegener (1998): A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs. Evolutionary Computation 6(2):185-196.
  14. Stefan Droste, Thomas Jansen, and Ingo Wegener (2002): On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276:51-81.
  15. Stefan Droste, Thomas Jansen, and Ingo Wegener (2002): Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions. Theoretical Computer Science 287(1):131-144.
  16. Thomas Jansen and Ingo Wegener (2002): Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation 5(6):589-599.
  17. Thomas Jansen and Ingo Wegener (2002): On the analysis of evolutionary algorithms - a proof that crossover really can help. Algorithmica 34(1):47-66.
  18. Thomas Jansen and R. Paul Wiegand (2004): The cooperative coevolutionary (1+1) EA. Evolutionary Computation 12(4):405-434.
  19. Thomas Jansen and Ingo Wegener (2005): Real royal road functions - where crossover provably is essential. Discrete Applied Mathematics 149:111-125.
  20. Thomas Jansen and Ingo Wegener (2006): On the analysis of a dynamic evolutionary algorithm. Journal of Discrete Algorithms 4(1):181-199.
  21. Thomas Jansen, Kenneth A. De Jong, and Ingo Wegener (2005): On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation 13(4):413-440.
  22. Stefan Droste, Thomas Jansen, and Ingo Wegener (2006): Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems 39(4):525-544.
  23. Thomas Jansen and Ingo Wegener (2007): A comparison of simulated annealing with simple evolutionary algorithms on pseudo-boolean functions of unitation. Theoretical Computer Science 386:73-93.
  24. Thomas Jansen and Madeleine Theile (2010): Stability in the self-organized evolution of networks. Algorithmica 57(1):147-169.
  25. Thomas Jansen and Dennis Weyland (2010): Analysis of evolutionary algorithms for the longest common subsequence problem. Algorithmica 57(1):170-186.
  26. Thomas Jansen and Dirk Sudholt (2010): Analysis of an asymmetric mutation operator. Evolutionary Computation 18(1):1-26.
  27. Thomas Jansen and Christine Zarges (2011): Analyzing different variants of immune inspired somatic contiguous hypermutations. Theoretical Computer Science 412(6):517-533.
  28. Thomas Jansen and Christine Zarges (2011): On Benefits and Drawbacks of Aging Strategies for Randomized Search Heuristics. Theoretical Computer Science 412(6):543-559.
  29. Thomas Jansen and Christine Zarges (2011): On the role of age diversity for effective aging operators. Evolutionary Intelligence 4(2):99-125.
  30. Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen and Christine Zarges (2013): Mutation rate matters even when optimizing monotonic functions. Evolutionary Computation 21(1):1-27.
  31. Thomas Jansen and Christine Zarges (2014): Performance analysis of randomised search heuristics operating with a fixed budget. Theoretical Computer Science 545:39-58.
  32. Rob Mills, Thomas Jansen and Richard A. Watson (2014): Transforming Evolutionary Search Into Higher-Level Evolutionary Search by Capturing Problem Structure. IEEE Transactions on Evolutionary Computation 18(5):628-642.
  33. Thomas Jansen and Christine Zarges (2014): Reevaluating Immune-Inspired Hypermutations Using the Fixed Budget Perspective. IEEE Transactions on Evolutionary Computation 18(5):674-688.
  34. Thomas Jansen and Christine Zarges (2015): Analysis of Randomised Search Heuristics for Dynamic Optimisation. Evolutionary Computation 23(4):513-541.
  35. Dogan Corus, Jun He, Thomas Jansen, Pietro S. Oliveto, Dirk Sudholt and Christine Zarges (2017): On easiest functions for mutation operators in bio-inspired optimisation. Algorithmica 78(2):714-740.
  36. Duc-Cuong Dang, Thomas Jansen and Per Kristian Lehre (2017): Populations can be essential in tracking dynamic optima. Algorithmica 78(2):660-680.

    Conference Articles

  37. Stefan Droste, Thomas Jansen, and Ingo Wegener (1998): A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with Boolean inputs. In D.B. Fogel, H.-P. Schwefel, T. Bäck, and X. Yao (Eds.): Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC '98). IEEE Press, Piscataway, NJ, pages 499-504.
  38. Stefan Droste, Thomas Jansen, and Ingo Wegener (1998): On the optimization of unimodal functions with the (1+1) evolutionary algorithm. In A.E. Eiben, T. Bäck, M. Schoenauer, and H.-P. Schwefel (Eds.): Proceedings of the 5th International Conference on Parallel Problem Solving From Nature (PPSN V). LNCS 1498, Springer, Berlin, Germany, pages 13-22.
  39. Stefan Droste, Thomas Jansen, and Ingo Wegener (1999): Perhaps not a free lunch but at least a free appetizer. In W. Banzhaf, J. Daida, A.E. Eiben M.H. Garzon, V. Honovar, M. Jakiela, and R.E. Smith (Eds.): Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '99). Morgan Kaufmann, San Francisco, CA, pages 833-839.
  40. Thomas Jansen and Ingo Wegener (1999): On the analysis of evolutionary algorithms - a proof that crossover really can help. In J. Nesetril (Ed.): Proceedings of the 7th Annual European Symposium on Algorithms (ESA '99). LNCS 1643, Springer, Berlin, Germany, pages 184-193.
  41. Thomas Jansen and Ingo Wegener (2000): On the choice of the mutation probability for the (1+1) EA. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J.J. Merelo-Guervos, and H.-P. Schwefel (Eds.): Proceedings of the 6th International Conference on Parallel Problem Solving From Nature (PPSN VI). LNCS 1917, Springer, Berlin, Germany, pages 89-98.
  42. Stefan Droste, Thomas Jansen, and Ingo Wegener (2000): A natural and simple function which is hard for all evolutionary algorithms. In IEEE International Conference on Industrial Electronics, Control, and Instrumentation (IECON 2000). IEEE Press, Piscataway, NJ, pages 2704-2709.
  43. Stefan Droste, Thomas Jansen, and Ingo Wegener (2001): Dynamic parameter control in simple evolutionary algorithms. In W.N. Martin and W.M. Spears (Eds.): Foundation of Genetic Algorithms 6 (FOGA 2000). Morgan Kaufmann, San Francisco, CA, pages 275-294.
  44. Thomas Jansen and Ingo Wegener (2001): Real royal road functions - where crossover provably is essential. In L. Spector, E.D. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M.H. Garzon, and E. Burke (Eds.): Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001). Morgan Kaufmann, San Francisco, CA, pages 1034-1041.
  45. Thomas Jansen and Ingo Wegener (2001): On the utility of populations. In L. Spector, E.D. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M.H. Garzon, and E. Burke (Eds.): Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001). Morgan Kaufmann, San Francisco, CA, pages 375-382.
  46. Thomas Jansen and Kenneth De Jong (2002): An analysis of the role of offspring population size in EAs. In W.B. Langdon, E. Cantu-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honovar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska (Eds.): Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002). Morgan Kaufmann, San Francisco, CA, pages 238-246. Best Paper Award.
  47. Thomas Jansen (2002): On the analysis of dynamic restart strategies for evolutionary algorithms. In J.J. Merelo-Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernandez-Villacanas, and H.-P. Schwefel (Eds.): Proceedings of the 7th International Conference on Parallel Problem Solving From Nature (PPSN VII). LNCS 2439, Springer, Berlin, Germany, pages 33-43.
  48. Stefan Droste, Thomas Jansen, Karsten Tinnefeld, and Ingo Wegener (2003): A new framework for the valuation of algorithms for black-box optimization. In K.A. De Jong, R. Poli, and J.E. Rowe (Eds.): Foundations of Genetic Algorithms 7 (FOGA). Morgan Kaufmann, San Francisco, CA, pages 253-270.
  49. Thomas Jansen and R. Paul Wiegand (2003): Exploring the explorative advantage of the cooperative coevolutionary (1+1) EA. In E. Cantu-Paz, J.A. Foster, K. Deb, L.D. Davis, R. Roy, U.-M. O'Reilly, H.-G. Beyer, R. Standish, G. Kendall, S. Wilson, M. Harman, J. Wegener, D. Dasgupta, M.A. Potter, A.C. Schultz, K. A. Dowsland, N. Jonoska, and J. Miller (Eds.): Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2003). LNCS 2723, Springer, Berlin, Germany, 310-321.
  50. Thomas Jansen and R. Paul Wiegand (2003): Sequential versus parallel cooperative coevolutionary (1+1) EAs. In Proceedings of the IEEE International Congress on Evolutionary Computation (CEC 2003). IEEE Press, Piscataway, NJ, pages 30-37.
  51. Thomas Jansen and R. Paul Wiegand (2004): Bridging the gap between theory and practice. In Xin Yao, E. Burke, J. A. Lozano, J. Smith, J.J. Merelo-Guervos, J. A. Bullinaria, J. Rowe, P. Tino, A. Kaban, and H.-P. Schwefel(Eds.): Proceedings of the 8th International Conference on Parallel Problem Solving From Nature (PPSN VIII). LNCS 3242, Springer, Berlin, Germany, pages 61-71.
  52. 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, and Ingo Wegener (2004): Experimental supplements to the theoretical analysis of EAs on problems from combinatorial optimization. In Xin Yao, E. Burke, J. A. Lozano, J. Smith, J.J. Merelo-Guervos, J. A. Bullinaria, J. Rowe, P. Tino, A. Kaban, and H.-P. Schwefel (Eds.): Proceedings of the 8th International Conference on Parallel Problem Solving From Nature (PPSN VIII). LNCS 3242, Springer, Berlin, Germany, pages 21-30.
  53. 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, and Ingo Wegener (2004): The Ising model: Simple evolutionary algorithms as adaptation schemes. In X. Yao, E. Burke, J. A. Lozano, J. Smith, J.J. Merelo-Guervos, J. A. Bullinaria, J. Rowe, P. Tino, A. Kaban, and H.-P. Schwefel (Eds.): Proceedings of the 8th International Conference on Parallel Problem Solving From Nature (PPSN VIII). LNCS 3242, Springer, Berlin, Germany, pages 31-40.
  54. Thomas Jansen (2005): A comparison of simulated annealing with a simple evolutionary algorithm. In A.H. Wright, M.D. Vose, K.A. De Jong (Eds.): Foundation of Genetic Algorithms 8 (FOGA 2005). LNCS 3469, Springer, Berlin, Germany, pages 37-57.
  55. Thomas Jansen and Ulf Schellbach (2005): Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice. H.-G. Beyer, U.-M. O'Reilly, D.V. Arnold, W. Banzhaf, C. Blum, E.W. Bonabeau, E. Cant� Paz, D. Dasgupta, K. Deb, J.A. Foster, E.D. de~Jong, H. Lipson, X. Llora, S. Mancoridis, M. Pelikan, G.R. Raidl, T. Soule, A. Tyrrell, J.-P. Watson, E. Zitzler (Eds.): Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2005). ACM Press, New York, NY, pages 841-848.
  56. Thomas Jansen and Dirk Sudholt (2005): Design and analysis of an asymmetric mutation operator. Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2005). IEEE Press, Piscataway, NJ, pages 497-504.
  57. Thomas Jansen and Ingo Wegener (2006): On the local performance of simulated annealing and the (1+1) evolutionary algorithm. M. Keijzer (Ed:): Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2006). ACM Press, New York, NY, pages 469-475. Best Paper Award.
  58. Thomas Jansen (2007): On the brittleness of evolutionary algorithms. In C.R. Stephens, C.R., M. Toussaint, D. Whitley, P.F. Stadler, P.F. (Eds.): Foundation of Genetic Algorithms 9 (FOGA 2007). LNCS 4436, Springer, Berlin, Germany, pages 54-69.
  59. Thomas Jansen and Madeleine Theile (2007): Stability in the self-organized evolution of networks. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2007). ACM Press, New York, NY, pages 931-938.
  60. Thomas Jansen and Richard Watson (2007): A building-block royal road where crossover is provably essential. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2007). ACM Press, New York, NY, pages 1452-1459.
  61. Thomas Jansen and Dennis Weyland (2007): Analysis of evolutionary algorithms for the longest common subsequence problem. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2007). ACM Press, New York, NY, pages 939-946.
  62. Benjamin Doerr, Thomas Jansen, and Christian Klein (2008): Comparing global and local mutations on bit strings. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2008). ACM Press, New York, NY, pages 929-936.
  63. Christian Horoba, Thomas Jansen, and Christine Zarges (2009): Maximal Age in Randomized Search Heuristics with Aging. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2009). ACM Press, New York, NY, pages 803-810.
  64. Thomas Jansen and Christine Zarges (2009): Comparing different aging operators. Proceedings of the 8th International Conference on Artificial Immune Systems (ICARIS 2009). LNCS 5666, Springer, Berlin, pages 95-108.
  65. Thomas Jansen and Christine Zarges (2009): A theoretical analysis of immune inspired somatic contiguous hypermutations for function optimization. Proceedings of the 8th International Conference on Artificial Immune Systems (ICARIS 2009). LNCS 5666, Springer, Berlin, pages 80-94.
  66. Dara Curran, Eugene Freuder, and Thomas Jansen (2010): Incremental evolution of local search heuristics. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2010). ACM Press, New York, pages 981-982.
  67. Thomas Jansen and Christine Zarges (2010): Aging beyond restarts. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2010). ACM Press, New York, pages 705-712.
  68. Thomas Jansen and Christine Zarges (2010): On the benefits of aging and the importance of details. Proceedings of the 9th International Conference on Artificial Immune Systems (ICARIS 2010). LNCS 6209, Springer, Berlin, pages 61-74.
  69. Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, and Christine Zarges (2010): Optimizing monotone functions can be difficult. In Proceedings of the 11h International Conference on Parallel Problem Solving From Nature (PPSN XI). LNCS 6328, Springer, Berlin, pages 42-51.
  70. Thomas Jansen and Christine Zarges (2011): Analysis of evolutionary algorithms: From computational complexity analysis to algorithm engineering. 11th ACM SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA 2011). ACM Press, New York, pages 1-14.
  71. Thomas Jansen, Pietro S. Oliveto, and Christine Zarges (2011): On the analysis of the immune-inspired B-cell algorithm for the vertex cover problem. Proceedings of the 10th International Conference on Artificial Immune Systems (ICARIS 2011). LNCS 6825, Springer, Berlin, pages 117-131. Best Paper Award.
  72. Thomas Jansen and Christine Zarges (2011): Variation in artificial immune systems: Hypermutations with mutation potential. Proceedings of the 10th International Conference on Artificial Immune Systems (ICARIS 2011). LNCS 6825, Springer, Berlin, pages 132-145.
  73. Thomas Jansen and Christine Zarges (2012): Fixed budget computations: A different perspective on run time analysis. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2012). ACM Press, New York, pages 1325-1332.
  74. Thomas Jansen and Christine Zarges (2012): Computing longest common subsequences with the B-Cell algorithm. Proceedings of the 11th International Conference on Artificial Immune Systems (ICARIS 2012). Springer, Berlin. LNCS 7597. Pages 111-124.
  75. Thomas Jansen, Pietro S. Oliveto, and Christine Zarges (2013): Approximating vertex cover using edge-based representations. 12th ACM SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA 2013). ACM Press, New York, pages 87-96.
  76. Benjamin Doerr, Thomas Jansen, Carsten Witt, and Christine Zarges (2013): A method to derive fixed budget results from expected optimisation times. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2013). Pages 1581-1588.
  77. Thomas Jansen and Christine Zarges (2014): Understanding randomised search heuristics. Lessons from the evolution of theory: a case study. M. Radek (Ed.): Proceedings of the 20th International Conference on Soft Computing MENDEL 2014. Pages 293-298.
  78. Thomas Jansen and Christine Zarges (2014): Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2014). Pages 975-982.
  79. Thomas Jansen (2015): On the black-box complexity of example functions: The Real Jump function. 13th ACM SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA 2015). ACM Press. Pages 16-24.
  80. Dogan Corus, Jun He, Thomas Jansen, Pietro S. Oliveto, Dirk Sudholt, and Christine Zarges (2015): On easiest functions for somatic contiguous hypermutations and standard bit mutations. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015). Pages 1399-1406.
  81. Duc-Cuong Dang, Thomas Jansen, and Per Kristian Lehre (2015): Populations can be essential in dynamic optimisation. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015). Pages 1407-1414.
  82. Thomas Jansen and Christine Zarges (2016): Example landscapes to support analysis of multimodal optimisation. In Proceedings of the 14th International Conference on Parallel Problem Solving From Nature (PPSN XIV). Springer, Berlin. LNCS 9921. Pages 792-802.
  83. Thomas Jansen and Christine Zarges (2024): Experimental and theoretical analysis of local search optimising OBDD variable orderings. In Proceedings of the 24th European Conference, EvoCOP 2024, Held as Part of EvoStar 2024. Springer, Berlin. LNCS 14632. Pages 177-192.

author profile at Google scholar
cited articles according to DBLP
(Note that lists that are automatically compiled may be incorrect since there is more than one Thomas Jansen with scientific publications. The list on this web page is the correct list of my publications.)

[back]

last change: 07.04.2024

The information provided on this page by me, Thomas Jansen (t.jansen@aber.ac.uk), is under my own personal responsibility and not that of Aberystwyth University.