Feasible Iteration of Feasible Learning Functionals. - John Case; Timo Kötzing; Todd Paddock (ALT, 2007)

Dynamically Delayed Postdictive Completeness and Consistency in Learning. - John Case; Timo Kötzing (ALT, 2008)

Dynamic Modeling in Inductive Inference. - John Case; Timo Kötzing (ALT, 2008)

Difficulties in Forcing Fairness of Polynomial Time Inductive Inference. - John Case; Timo Kötzing (ALT, 2009)

Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations. - John Case; Timo Kötzing (ALT, 2010)

Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. - Timo Kötzing; Frank Neumann 001; Heiko Röglin; Carsten Witt (ANTS Conference, 2010)

Strongly Non-U-Shaped Learning Results by General Techniques. - John Case; Timo Kötzing (COLT, 2010)

Ant colony optimization and the minimum cut problem. - Timo Kötzing; Per Kristian Lehre; Frank Neumann 001; Pietro S. Oliveto (GECCO, 2010)

String Extension Learning Using Lattices. - Anna Kasprzik; Timo Kötzing (LATA, 2010)

More Effective Crossover Operators for the All-Pairs Shortest Path Problem. - Benjamin Doerr; Daniel Johannsen; Timo Kötzing; Frank Neumann 001; Madeleine Theile (PPSN (1), 2010)

Iterative Learning from Positive Data and Counters. - Timo Kötzing (ALT, 2011)

Faster black-box algorithms through higher arity operators. - Benjamin Doerr; Daniel Johannsen; Timo Kötzing; Per Kristian Lehre; Markus Wagner 007; Carola Winzen (FOGA, 2011)

Simple max-min ant systems and the optimization of linear pseudo-boolean functions. - Timo Kötzing; Frank Neumann 001; Dirk Sudholt; Markus Wagner 007 (FOGA, 2011)

Too fast unbiased black-box algorithms. - Benjamin Doerr; Timo Kötzing; Carola Winzen (GECCO, 2011)

Black-box complexities of combinatorial problems. - Benjamin Doerr; Johannes Lengler; Timo Kötzing; Carola Winzen (GECCO, 2011)

PAC learning and genetic programming. - Timo Kötzing; Frank Neumann 001; Reto Spöhel (GECCO, 2011)

How crossover helps in pseudo-boolean optimization. - Timo Kötzing; Dirk Sudholt; Madeleine Theile (GECCO, 2011)

Measuring Learning Complexity with Criteria Epitomizers. - John Case; Timo Kötzing (STACS, 2011)

Enlarging Learnable Classes. - Sanjay Jain 001; Timo Kötzing; Frank Stephan 001 (ALT, 2012)

Efficient algorithms for extracting biological key pathways with global constraints. - Jan Baumbach; Tobias Friedrich 001; Timo Kötzing; Anton Krohmer; Joachim Müller; Josch Pauling (GECCO, 2012)

Ants easily solve stochastic shortest path problems. - Benjamin Doerr; Ashish Ranjan Hota; Timo Kötzing (GECCO, 2012)

The max problem revisited: the importance of mutation in genetic programming. - Timo Kötzing; Andrew M. Sutton; Frank Neumann 001; Una-May O'Reilly (GECCO, 2012)

ACO Beats EA on a Dynamic Pseudo-Boolean Function. - Timo Kötzing; Hendrik Molter (PPSN (1), 2012)

Deliberative Acceptability of Arguments. - Cosmina Croitoru; Timo Kötzing (STAIRS, 2012)

Learning secrets interactively. Dynamic modeling in inductive inference. - John Case; Timo Kötzing (Inf. Comput., 2012)

Theoretical analysis of two ACO approaches for the traveling salesman problem. - Timo Kötzing; Frank Neumann 001; Heiko Röglin; Carsten Witt (Swarm Intell., 2012)

Learning in the limit with lattice-structured hypothesis spaces. - Jeffrey Heinz; Anna Kasprzik; Timo Kötzing (Theor. Comput. Sci., 2012)

Topological Separations in Inductive Inference. - John Case; Timo Kötzing (ALT, 2013)

Optimizing expected path lengths with ant colony optimization using fitness proportional update. - Matthias Feldmann; Timo Kötzing (FOGA, 2013)

An effective heuristic for the smallest grammar problem. - Florian Benz; Timo Kötzing (GECCO, 2013)

Fast learning of restricted regular expressions and DTDs. - Dominik D. Freydenberger; Timo Kötzing (ICDT, 2013)

A Normal Form for Argumentation Frameworks. - Cosmina Croitoru; Timo Kötzing (TAFA, 2013)

MenuOptimizer: interactive optimization of menu systems. - Gilles Bailly; Antti Oulasvirta; Timo Kötzing; Sabrina Hoppe (UIST, 2013)

Memory-limited non-U-shaped learning with solved open problems. - John Case; Timo Kötzing (Theor. Comput. Sci., 2013)

On the Role of Update Constraints and Text-Types in Iterative Learning. - Sanjay Jain 001; Timo Kötzing; Junqi Ma 001; Frank Stephan 001 (ALT, 2014)

A Map of Update Constraints in Inductive Inference. - Timo Kötzing; Raphaela Palenta (ALT, 2014)

Unbiased black-box complexities of jump functions: how to cross large plateaus. - Benjamin Doerr; Carola Doerr; Timo Kötzing (GECCO, 2014)

Robustness of populations in stochastic environments. - Christian Gießen; Timo Kötzing (GECCO, 2014)

Concentration of first hitting times under additive drift. - Timo Kötzing (GECCO, 2014)

A Solution to Wiehagen's Thesis. - Timo Kötzing (STACS, 2014)

The unbiased black-box complexity of partition is polynomial. - Benjamin Doerr; Carola Doerr; Timo Kötzing (Artif. Intell., 2014)

(1+1) EA on Generalized Dynamic OneMax. - Timo Kötzing; Andrei Lissovoi; Carsten Witt (FOGA, 2015)

Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. - Benjamin Doerr; Carola Doerr; Timo Kötzing (GECCO, 2015)

Robustness of Ant Colony Optimization to Noise. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Andrew M. Sutton (GECCO, 2015)

The Benefit of Recombination in Noisy Evolutionary Search. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Andrew M. Sutton (ISAAC, 2015)

The Benefit of Sex in Noisy Evolutionary Search. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Andrew M. Sutton (CoRR, 2015)

Unbiased Black-Box Complexities of Jump Functions. - Benjamin Doerr; Carola Doerr; Timo Kötzing (Evol. Comput., 2015)

Escaping Local Optima with Diversity Mechanisms and Crossover. - Duc-Cuong Dang; Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Per Kristian Lehre; Pietro S. Oliveto; Dirk Sudholt; Andrew M. Sutton (GECCO, 2016)

The Right Mutation Strength for Multi-Valued Decision Variables. - Benjamin Doerr; Carola Doerr; Timo Kötzing (GECCO, 2016)

EDAs cannot be Balanced and Stable. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca (GECCO, 2016)

Fast Building Block Assembly by Majority Vote Crossover. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Samadhi Nallaperuma; Frank Neumann 001; Martin Schirneck (GECCO, 2016)

Ant Colony Optimization Beats Resampling on Noisy Functions. - Tobias Friedrich 001; Timo Kötzing; Francesco Quinzan; Andrew M. Sutton (GECCO (Companion), 2016)

Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. - Duc-Cuong Dang; Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Per Kristian Lehre; Pietro S. Oliveto; Dirk Sudholt; Andrew M. Sutton (PPSN, 2016)

Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables. - Benjamin Doerr; Carola Doerr; Timo Kötzing (PPSN, 2016)

Graceful Scaling on Uniform Versus Steep-Tailed Noise. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Andrew M. Sutton (PPSN, 2016)

On the Robustness of Evolving Populations. - Tobias Friedrich 001; Timo Kötzing; Andrew M. Sutton (PPSN, 2016)

Towards an Atlas of Computational Learning Theory. - Timo Kötzing; Martin Schirneck (STACS, 2016)

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. - Duc-Cuong Dang; Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Per Kristian Lehre; Pietro S. Oliveto; Dirk Sudholt; Andrew M. Sutton (CoRR, 2016)

A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover. - Tobias Friedrich 001; Timo Kötzing; Markus Wagner 007 (CoRR, 2016)

Strongly non-U-shaped language learning results by general techniques. - John Case; Timo Kötzing (Inf. Comput., 2016)

A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. - Tobias Friedrich 001; Timo Kötzing; Markus Wagner 007 (AAAI, 2017)

Normal Forms in Semantic Language Identification. - Timo Kötzing; Martin Schirneck; Karen Seidel 001 (ALT, 2017)

Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. - Wanru Gao; Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001 (Australasian Conference on Artificial Intelligence, 2017)

Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. - Tobias Friedrich 001; Timo Kötzing; Gregor Lagodzinski; Frank Neumann 001; Martin Schirneck (FOGA, 2017)

Resampling vs Recombination: a Statistical Run Time Estimation. - Tobias Friedrich 001; Timo Kötzing; Francesco Quinzan; Andrew M. Sutton (FOGA, 2017)

Analyzing search heuristics with differential equations. - Tobias Friedrich 001; Timo Kötzing; Anna Melnichenko (GECCO (Companion), 2017)

Unknown solution length problems with no asymptotically optimal run time. - Benjamin Doerr; Carola Doerr; Timo Kötzing (GECCO, 2017)

Island models meet rumor spreading. - Benjamin Doerr; Philipp Fischbeck; Clemens Frahnow; Tobias Friedrich 001; Timo Kötzing; Martin Schirneck (GECCO, 2017)

Bounding bloat in genetic programming. - Benjamin Doerr; Timo Kötzing; J. A. Gregor Lagodzinski; Johannes Lengler (GECCO, 2017)

Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. - Feng Shi 003; Martin Schirneck; Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001 (GECCO, 2017)

The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Andrew M. Sutton (IEEE Trans. Evol. Comput., 2017)

Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. - Tobias Friedrich 001; Timo Kötzing; Francesco Quinzan; Andrew M. Sutton (GECCO, 2018)

Ring Migration Topology Helps Bypassing Local Optima. - Clemens Frahnow; Timo Kötzing (PPSN (2), 2018)

First-Hitting Times for Finite State Spaces. - Timo Kötzing; Martin S. Krejca (PPSN (2), 2018)

First-Hitting Times Under Additive Drift. - Timo Kötzing; Martin S. Krejca (PPSN (2), 2018)

Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming. - Timo Kötzing; J. A. Gregor Lagodzinski; Johannes Lengler; Anna Melnichenko (PPSN (2), 2018)

Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables. - Benjamin Doerr; Carola Doerr; Timo Kötzing (Algorithmica, 2018)

Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. - Timo Kötzing; Dirk Sudholt (Algorithmica, 2018)

Learning Families of Formal Languages from Positive and Negative Information. - Martin Aschenbach; Timo Kötzing; Karen Seidel 001 (CoRR, 2018)

Intuitive Analyses via Drift Theory. - Andreas Göbel 001; Timo Kötzing; Martin S. Krejca (CoRR, 2018)

Escaping Local Optima Using Crossover With Emergent Diversity. - Duc-Cuong Dang; Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Per Kristian Lehre; Pietro S. Oliveto; Dirk Sudholt; Andrew M. Sutton (IEEE Trans. Evol. Comput., 2018)

Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. - Jannik Peters 001; Daniel Stephan; Isabel Amon; Hans Gawendowicz; Julius Lischeid; Lennart Salabarria; Jonas Umland; Felix Werner; Martin S. Krejca; Ralf Rothenberger; Timo Kötzing; Tobias Friedrich 001 (ICAPS, 2019)

Limit Learning Equivalence Structures. - Ekaterina B. Fokina; Timo Kötzing; Luca San Mauro (ALT, 2019)

Multiplicative up-drift. - Benjamin Doerr; Timo Kötzing (GECCO, 2019)

Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. - Feng Shi 003; Martin Schirneck; Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001 (Algorithmica, 2019)

Unbiasedness of estimation-of-distribution algorithms. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca (Theor. Comput. Sci., 2019)

First-hitting times under drift. - Timo Kötzing; Martin S. Krejca (Theor. Comput. Sci., 2019)

Cautious Limit Learning. - Vanja Doskoc; Timo Kötzing (ALT, 2020)

Improved Fixed-Budget Results via Drift Analysis. - Timo Kötzing; Carsten Witt (PPSN (2), 2020)

Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. - Feng Shi 003; Martin Schirneck; Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001 (Algorithmica, 2020)

Learning Half-Spaces and other Concept Classes in the Limit with Iterative Learners. - Ardalan Khazraei; Timo Kötzing; Karen Seidel 001 (CoRR, 2020)

The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time. - Benjamin Doerr; Timo Kötzing; J. A. Gregor Lagodzinski; Johannes Lengler (Theor. Comput. Sci., 2020)

Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints. - Tobias Friedrich 001; Timo Kötzing; J. A. Gregor Lagodzinski; Frank Neumann 001; Martin Schirneck (Theor. Comput. Sci., 2020)

Learning Languages with Decidable Hypotheses. - Julian Berger; Maximilian Böther; Vanja Doskoc; Jonathan Gadea Harder; Nicolas Klodt; Timo Kötzing; Winfried Lötzsch; Jannik Peters 001; Leon Schiller; Lars Seifert; Armin Wells; Simon Wietheger (CiE, 2021)

Mapping Monotonic Restrictions in Inductive Inference. - Vanja Doskoc; Timo Kötzing (CiE, 2021)

Normal Forms for Semantically Witness-Based Learners in Inductive Inference. - Vanja Doskoc; Timo Kötzing (CiE, 2021)

Towards a Map for Incremental Learning in the Limit from Positive and Negative Information. - Ardalan Khazraei; Timo Kötzing; Karen Seidel 001 (CiE, 2021)

Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes. - Timo Kötzing; Karen Seidel 001 (CiE, 2021)

Lower bounds from fitness levels made easy. - Benjamin Doerr; Timo Kötzing (GECCO, 2021)

Maps of Restrictions for Behaviourally Correct Learning. - Vanja Doskoc; Timo Kötzing (CiE, 2022)

Crossover for cardinality constrained optimization. - Tobias Friedrich 001; Timo Kötzing; Aishwarya Radhakrishnan; Leon Schiller; Martin Schirneck; Georg Tennigkeit; Simon Wietheger (GECCO, 2022)

Analysis of a gray-box operator for vertex cover. - Samuel Baguley; Tobias Friedrich 001; Timo Kötzing; Xiaoyue Li 001; Marcus Pappik; Ziena Zeif (GECCO, 2022)

Escaping Local Optima with Local Search: A Theory-Driven Discussion. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Amirhossein Rajabi (PPSN (2), 2022)

Theoretical Study of Optimizing Rugged Landscapes with the cGA. - Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001; Aishwarya Radhakrishnan (PPSN (2), 2022)

Analysis of (1+1) EA on LeadingOnes with Constraints. - Tobias Friedrich 001; Timo Kötzing; Aneta Neumann; Frank Neumann 001; Aishwarya Radhakrishnan (GECCO, 2023)

ELEA - Build your own Evolutionary Algorithm in your Browser. - Markus Wagner 007; Erik Kohlros; Gerome Quantmeyer; Timo Kötzing (GECCO Companion, 2023)

Experimental Analyses of Crossover and Diversity on Jump. - Xiaoyue Li 001; Timo Kötzing (GECCO Companion, 2023)

Run Time Bounds for Integer-Valued OneMax Functions. - Jonathan Gadea Harder; Timo Kötzing; Xiaoyue Li 001; Aishwarya Radhakrishnan (CoRR, 2023)

Run Time Bounds for Integer-Valued OneMax Functions. - Jonathan Gadea Harder; Timo Kötzing; Xiaoyue Li 001; Aishwarya Radhakrishnan; Janosch Ruff (GECCO, 2024)

Algorithm Performance Comparison for Integer-Valued OneMax. - Xiaoyue Li 001; Timo Kötzing (GECCO Companion, 2024)

Greedy Versus Curious Parent Selection for Multi-objective Evolutionary Algorithms. - Denis Antipov; Timo Kötzing; Aishwarya Radhakrishnan (PPSN (3), 2024)

Maps for learning indexable classes. - Julian Berger; Maximilian Böther; Vanja Doskoc; Jonathan Gadea Harder; Nicolas Klodt; Timo Kötzing; Winfried Lötzsch; Jannik Peters 001; Leon Schiller; Lars Seifert; Armin Wells; Simon Wietheger (Comput., 2024)

Theory of Stochastic Drift. - Timo Kötzing (CoRR, 2024)

Algorithm Performance Comparison of the (1+1) EA with Heavy-Tailed Mutators. - Xiaoyue Li 001; Samuel Baguley; Timo Kötzing (CEC, 2025)

Discrete Evolutionary Algorithms for Optimizing Sphere. - Timo Kötzing; Aishwarya Radhakrishnan (CEC, 2025)

Mixed-Binary Problems Optimized with Fast Discrete Solver. - Timo Kötzing; Aishwarya Radhakrishnan (EvoCOP@EvoStar, 2025)