Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Thomas Jansen
2010 – today
- 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- [j22]Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges: Mutation Rate Matters Even When Optimizing Monotonic Functions. Evolutionary Computation 21(1): 1-27 (2013)
- [c64]Thomas Jansen, Christine Zarges: Artificial immune systems for optimisation. GECCO (Companion) 2013: 779-796
- [c63]Benjamin Doerr, Thomas Jansen, Carsten Witt, Christine Zarges: A method to derive fixed budget results from expected optimisation times. GECCO 2013: 1581-1588
- 2012
- [c62]Thomas Jansen, Christine Zarges: Artificial immune systems for optimisation. GECCO (Companion) 2012: 1059-1078
- [c61]Thomas Jansen, Christine Zarges: Fixed budget computations: a different perspective on run time analysis. GECCO 2012: 1325-1332
- [c60]Thomas Jansen, Christine Zarges: Computing Longest Common Subsequences with the B-Cell Algorithm. ICARIS 2012: 111-124
- [c59]Bile Peng, Michaela Eden, Sebastian Priebe, Thomas Jansen, Joern von Hafen, Thomas Kürner: Feasibility studies of LTE for the broadband service delivery in Professional Mobile Radio. ISWCS 2012: 904-908
- [p1]Thomas Jansen: Computational Complexity of Evolutionary Algorithms. Handbook of Natural Computing 2012: 815-845
- 2011
- [j21]Benjamin Doerr, Thomas Jansen: Theory of Evolutionary Computation. Algorithmica 59(3): 299-300 (2011)
- [j20]Irina Balan, Bart Sas, Thomas Jansen, Ingrid Moerman, Kathleen Spaey, Piet Demeester: An enhanced weighted performance-based handover parameter optimization algorithm for LTE networks. EURASIP J. Wireless Comm. and Networking 2011: 98 (2011)
- [j19]Thomas Jansen, Christine Zarges: On the role of age diversity for effective aging operators. Evolutionary Intelligence 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)
- [c58]Thomas Jansen, Christine Zarges: Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. FOGA 2011: 1-14
- [c57]Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2011: 1053-1080
- [c56]Dennis M. Rose, Thomas Jansen, Thomas Kürner: Indoor to outdoor propagation - Measuring and modeling of femto cells in LTE networks at 800 and 2600 MHz. GLOBECOM Workshops 2011: 203-207
- [c55]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
- [c54]Thomas Jansen, Christine Zarges: Variation in Artificial Immune Systems: Hypermutations with Mutation Potential. ICARIS 2011: 132-145
- [c53]Thomas Jansen, Irina Balan, Szymon Stefanski, Ingrid Moerman, Thomas Kürner: Weighted Performance Based Handover Parameter Optimization in LTE. VTC Spring 2011: 1-5
- [c52]Andreas Lobinger, Szymon Stefanski, Thomas Jansen, Irina Balan: Coordinating Handover Parameter Optimization and Load Balancing in LTE Self-Optimizing Networks. VTC Spring 2011: 1-5
- [c51]Dennis M. Rose, Thomas Jansen, Thomas Kürner: Modeling of Femto Cells - Simulation of Interference and Handovers in LTE Networks. VTC Spring 2011: 1-5
- [i4]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. Evolutionary Computation 18(1): 1-26 (2010)
- [j13]Thomas Jansen, Frank Neumann: Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization. Evolutionary Computation 18(3): 333-334 (2010)
- [c50]
- [c49]Dara Curran, Eugene C. Freuder, Thomas Jansen: Incremental evolution of local search heuristics. GECCO 2010: 981-982
- [c48]Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2010: 2683-2710
- [c47]Thomas Jansen, Christine Zarges: On the Benefits of Aging and the Importance of Details. ICARIS 2010: 61-74
- [c46]Tobias Heer, Thomas Jansen, René Hummen, Stefan Götz, Hanno Wirtz, Elias Weingärtner, Klaus Wehrle: PiSA-SA: Municipal Wi-Fi Based on Wi-Fi Sharing. ICCCN 2010: 1-8
- [c45]Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges: Optimizing Monotone Functions Can Be Difficult. PPSN (1) 2010: 42-51
- [c44]Thomas Jansen, Irina Balan, John Turk, Ingrid Moerman, Thomas Kürner: Handover Parameter Optimization in LTE Self-Organizing Networks. VTC Fall 2010: 1-5
- [c43]Andreas Lobinger, Szymon Stefanski, Thomas Jansen, Irina Balan: Load Balancing in Downlink LTE Self-Optimizing Networks. VTC Spring 2010: 1-5
- [i3]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. Evolutionary Computation 17(1): 1-2 (2009)
- [c42]Christian Horoba, Thomas Jansen, Christine Zarges: Maximal age in randomized search heuristics with aging. GECCO 2009: 803-810
- [c41]Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2009: 3157-3184
- [c40]Thomas Jansen, Christine Zarges: A Theoretical Analysis of Immune Inspired Somatic Contiguous Hypermutations for Function Optimization. ICARIS 2009: 80-94
- [c39]
- [c38]Thomas Jansen, Mehdi Amirijoo, Ulrich Türke, Ljupco Jorguseski, Kristina Zetterberg, R. Nascimento, Lars-Christoph Schmelz, John Turk, Irina Balan: Embedding Multiple Self-Organisation Functionalities in Future Radio Access Networks. VTC Spring 2009
- [e4]Ivan I. Garibay, Thomas Jansen, R. Paul Wiegand, Annie S. Wu (Eds.): 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
- 2008
- [c37]Benjamin Doerr, Thomas Jansen, Christian Klein: Comparing global and local mutations on bit strings. GECCO 2008: 929-936
- [c36]Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2008: 2417-2444
- [c35]Lyublena Antova, Thomas Jansen, Christoph Koch, Dan Olteanu: Fast and Simple Relational Processing of Uncertain Data. ICDE 2008: 983-992
- [c34]Mehdi Amirijoo, Remco Litjens, Kathleen Spaey, Martin Döttling, Thomas Jansen, Neil Scully, Ulrich Türke: Use Cases, Requirements and Assessment Criteria for Future Self-Organising Radio Access Networks. IWSOS 2008: 275-280
- [e3]Günter Rudolph, Thomas Jansen, Simon M. Lucas, Carlo Poloni, Nicola Beume (Eds.): 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
- 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)
- [c33]
- [c32]Thomas Jansen, Madeleine Theile: Stability in the self-organized evolution of networks. GECCO 2007: 931-938
- [c31]Thomas Jansen, Dennis Weyland: Analysis of evolutionary algorithms for the longest common subsequence problem. GECCO 2007: 939-946
- [c30]Richard A. Watson, Thomas Jansen: A building-block royal road where crossover is provably essential. GECCO 2007: 1452-1459
- [c29]Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2007: 3225-3250
- [i2]Lyublena Antova, Thomas Jansen, Christoph Koch, Dan Olteanu: Fast and Simple Relational Processing of Uncertain Data. CoRR abs/0707.1644 (2007)
- 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)
- [c28]Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose: 06061 Executive Summary -- Theory of Evolutionary Algoritms. Theory of Evolutionary Algorithms 2006
- [c27]Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose: 06061 Abstracts Collection -- Theory of Evolutionary Algorithms. Theory of Evolutionary Algorithms 2006
- [c26]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 (Eds.): Theory of Evolutionary Algorithms, 15.-20. February 2004. Dagstuhl Seminar Proceedings 04081, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- [e1]Dirk V. Arnold, Thomas Jansen, Michael D. Vose, Jonathan E. Rowe (Eds.): Theory of Evolutionary Algorithms, 05.02. - 10.02.2006. Dagstuhl Seminar Proceedings 06061, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- 2005
- [j8]Thomas Jansen, Ingo Wegener: Real royal road functions--where crossover provably is essential. Discrete Applied Mathematics 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. Evolutionary Computation 13(4): 413-440 (2005)
- [c25]Thomas Jansen, Dirk Sudholt: Design and analysis of an asymmetric mutation operator. Congress on Evolutionary Computation 2005: 190-197
- [c24]Thomas Jansen: A Comparison of Simulated Annealing with a Simple Evolutionary Algorithm. FOGA 2005: 37-57
- [c23]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. Evolutionary Computation 12(4): 405-434 (2004)
- [c22]Hans-Georg Beyer, Thomas Jansen, Colin R. Reeves, Michael D. Vose: 04081 Abstracts Collection - Theory of Evolutionary Algorithms. Theory of Evolutionary Algorithms 2004
- [c21]Nils Hanssen, Zbigniew Burgielski, Thomas Jansen, Marc Liévin, Lutz Ritter, Bartosz von Rymon-Lipinski, Erwin Keeve: NERVES - Level Sets for Interactive 3D Segmentation of Nerve Channels. ISBI 2004: 201-204
- [c20]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
- [c19]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
- [c18]
- [c17]Bartosz von Rymon-Lipinski, Nils Hanssen, Thomas Jansen, Lutz Ritter, Erwin Keeve: Efficient Point-Based Isosurface Exploration Using the Span-Triangle. IEEE Visualization 2004: 441-448
- [c16]Thomas Jansen, Bartosz von Rymon-Lipinski, Nils Hanssen, Erwin Keeve: Fourier Volume Rendering on the GPU Using a Split-Stream-FFT. VMV 2004: 395-403
- 2003
- [c15]Thomas Jansen, R. Paul Wiegand: Sequential versus parallel cooperative coevolutionary (1+1) EAs. IEEE Congress on Evolutionary Computation (1) 2003: 30-37
- [c14]Thomas Jansen, R. Paul Wiegand: Exploring the Explorative Advantage of the Cooperative Coevolutionary (1+1) EA. GECCO 2003: 310-321
- [c13]Erwin Keeve, Thomas Jansen, Bartosz von Rymon-Lipinski, Zbigniew Burgielski, Nils Hanssen, Lutz Ritter, Marc Liévin: An Open Software Framework for Medical Applications. IS4TH 2003: 302-310
- [i1]Stefan Droste, Thomas Jansen, Ingo Wegener: Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Electronic Colloquium on Computational Complexity (ECCC)(048) (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)
- [c12]Stefan Droste, Thomas Jansen, Karsten Tinnefeld, Ingo Wegener: A New Framework for the Valuation of Algorithms for Black-Box Optimization. FOGA 2002: 253-270
- [c11]Thomas Jansen, Kenneth A. De Jong: An Analysis Of The Role Of Offspring Population Size In EAs. GECCO 2002: 238-246
- [c10]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. Evolutionary Computation 5(6): 589-599 (2001)
- [c9]Zdzislaw Król, Peter Zerfass, Bartosz von Rymon-Lipinski, Thomas Jansen, W. Hauck, Robert Sader, Hans-Florian Zeilhofer, Erwin Keeve: Computer assisted osteotomy design for autografts in craniofacial reconstructive surgery. CARS 2001: 44-50
- [c8]Bartosz von Rymon-Lipinski, Thomas Jansen, Zdzislaw Król, Lutz Ritter, Erwin Keeve: JULIUS - an extendable application framework for medical visualization and surgical planning. CARS 2001: 184-189
- [c7]Erwin Keeve, Thomas Jansen, Zdzislaw Król, Lutz Ritter, Bartosz von Rymon-Lipinski, Robert Sader, Hans-Florian Zeilhofer, Peter Zerfass: JULIUS - An Extendable Software Framework for Surgical Planning and Image-Guided Navigation. MICCAI 2001: 1336-1337
- 2000
- [b1]Thomas Jansen: Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen. Universität Dortmund 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
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. Evolutionary Computation 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:12 CEST by the dblp team