Timo Kötzing - RankMe

160 papers A* 4A 43B 16C 7Journal 69Unranked 21

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	Algorithm Performance Comparison of the (1+1) EA with Heavy-Tailed Mutators. CEC Xiaoyue Li, Samuel Baguley, Timo Kötzing
2025	J	`jnl`	Analysis of the (1+1) EA on LeadingOnes with Constraints. Algorithmica Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan
2025	B	`conf`	Discrete Evolutionary Algorithms for Optimizing Sphere. CEC Timo Kötzing, Aishwarya Radhakrishnan
2025	—	`conf`	Mixed-Binary Problems Optimized with Fast Discrete Solver. EvoCOP@EvoStar Timo Kötzing, Aishwarya Radhakrishnan
2024	—	`conf`	Algorithm Performance Comparison for Integer-Valued OneMax. GECCO Companion Xiaoyue Li, Timo Kötzing
2024	—	`conf`	Greedy Versus Curious Parent Selection for Multi-objective Evolutionary Algorithms. PPSN (3) Denis Antipov, Timo Kötzing, Aishwarya Radhakrishnan
2024	J	`jnl`	Lower Bounds from Fitness Levels Made Easy. Algorithmica Benjamin Doerr, Timo Kötzing
2024	J	`jnl`	Maps for learning indexable classes. Comput. Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger
2024	A	`conf`	Run Time Bounds for Integer-Valued OneMax Functions. GECCO Jonathan Gadea Harder, Timo Kötzing, Xiaoyue Li, Aishwarya Radhakrishnan, Janosch Ruff
2024	J	`jnl`	Theory of Stochastic Drift. CoRR Timo Kötzing
2023	A	`conf`	Analysis of (1+1) EA on LeadingOnes with Constraints. GECCO Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan
2023	J	`jnl`	Analysis of the (1+1) EA on LeadingOnes with Constraints. CoRR Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan
2023	J	`jnl`	Crossover for Cardinality Constrained Optimization. ACM Trans. Evol. Learn. Optim. Tobias Friedrich, Timo Kötzing, Aishwarya Radhakrishnan, Leon Schiller, Martin Schirneck, Georg Tennigkeit, Simon Wietheger
2023	—	`conf`	ELEA - Build your own Evolutionary Algorithm in your Browser. GECCO Companion Markus Wagner, Erik Kohlros, Gerome Quantmeyer, Timo Kötzing
2023	J	`jnl`	ELEA - Build your own Evolutionary Algorithm in your Browser. CoRR Markus Wagner, Erik Kohlros, Gerome Quantmeyer, Timo Kötzing
2023	—	`conf`	Experimental Analyses of Crossover and Diversity on Jump. GECCO Companion Xiaoyue Li, Timo Kötzing
2023	J	`jnl`	Run Time Bounds for Integer-Valued OneMax Functions. CoRR Jonathan Gadea Harder, Timo Kötzing, Xiaoyue Li, Aishwarya Radhakrishnan
2022	A	`conf`	Analysis of a gray-box operator for vertex cover. GECCO Samuel Baguley, Tobias Friedrich, Timo Kötzing, Xiaoyue Li, Marcus Pappik, Ziena Zeif
2022	A	`conf`	Crossover for cardinality constrained optimization. GECCO Tobias Friedrich, Timo Kötzing, Aishwarya Radhakrishnan, Leon Schiller, Martin Schirneck, Georg Tennigkeit, Simon Wietheger
2022	—	`conf`	Escaping Local Optima with Local Search: A Theory-Driven Discussion. PPSN (2) Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Amirhossein Rajabi
2022	C	`conf`	Maps of Restrictions for Behaviourally Correct Learning. CiE Vanja Doskoc, Timo Kötzing
2022	—	`conf`	Theoretical Study of Optimizing Rugged Landscapes with the cGA. PPSN (2) Tobias Friedrich, Timo Kötzing, Frank Neumann, Aishwarya Radhakrishnan
2022	J	`jnl`	Theoretical Study of Optimizing Rugged Landscapes with the cGA. CoRR Tobias Friedrich, Timo Kötzing, Frank Neumann, Aishwarya Radhakrishnan
2021	C	`conf`	Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes. CiE Timo Kötzing, Karen Seidel
2021	C	`conf`	Learning Languages with Decidable Hypotheses. CiE Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger
2021	J	`jnl`	Lower Bounds from Fitness Levels Made Easy. CoRR Benjamin Doerr, Timo Kötzing
2021	A	`conf`	Lower bounds from fitness levels made easy. GECCO Benjamin Doerr, Timo Kötzing
2021	C	`conf`	Mapping Monotonic Restrictions in Inductive Inference. CiE Vanja Doskoc, Timo Kötzing
2021	J	`jnl`	Multiplicative Up-Drift. Algorithmica Benjamin Doerr, Timo Kötzing
2021	C	`conf`	Normal Forms for Semantically Witness-Based Learners in Inductive Inference. CiE Vanja Doskoc, Timo Kötzing
2021	C	`conf`	Towards a Map for Incremental Learning in the Limit from Positive and Negative Information. CiE Ardalan Khazraei, Timo Kötzing, Karen Seidel
2020	J	`jnl`	Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints. Theor. Comput. Sci. Tobias Friedrich, Timo Kötzing, J. A. Gregor Lagodzinski, Frank Neumann, Martin Schirneck
2020	B	`conf`	Cautious Limit Learning. ALT Vanja Doskoc, Timo Kötzing
2020	J	`jnl`	Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann
2020	J	`jnl`	Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming. Theor. Comput. Sci. Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko
2020	—	`conf`	Improved Fixed-Budget Results via Drift Analysis. PPSN (2) Timo Kötzing, Carsten Witt
2020	J	`jnl`	Improved Fixed-Budget Results via Drift Analysis. CoRR Timo Kötzing, Carsten Witt
2020	J	`jnl`	Learning Half-Spaces and other Concept Classes in the Limit with Iterative Learners. CoRR Ardalan Khazraei, Timo Kötzing, Karen Seidel
2020	J	`jnl`	Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes. CoRR Timo Kötzing, Karen Seidel
2020	J	`jnl`	Learning Languages with Decidable Hypotheses. CoRR Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger
2020	J	`jnl`	Mapping Monotonic Restrictions in Inductive Inference. CoRR Vanja Doskoc, Timo Kötzing
2020	J	`jnl`	Maps for Learning Indexable Classes. CoRR Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger
2020	J	`jnl`	Normal Forms for (Semantically) Witness-Based Learners in Inductive Inference. CoRR Vanja Doskoc, Timo Kötzing
2020	J	`jnl`	The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time. Theor. Comput. Sci. Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler
2019	J	`jnl`	First-hitting times under drift. Theor. Comput. Sci. Timo Kötzing, Martin S. Krejca
2019	J	`jnl`	Island Models Meet Rumor Spreading. Algorithmica Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck
2019	B	`conf`	Limit Learning Equivalence Structures. ALT Ekaterina B. Fokina, Timo Kötzing, Luca San Mauro
2019	A*	`conf`	Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. ICAPS Jannik Peters, Daniel Stephan, Isabel Amon, Hans Gawendowicz, Julius Lischeid, Lennart Salabarria, Jonas Umland, Felix Werner, Martin S. Krejca, Ralf Rothenberger, Timo Kötzing, Tobias Friedrich
2019	J	`jnl`	Multiplicative Up-Drift. CoRR Benjamin Doerr, Timo Kötzing
2019	A	`conf`	Multiplicative up-drift. GECCO Benjamin Doerr, Timo Kötzing
2019	J	`jnl`	Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann
2019	J	`jnl`	Solving Problems with Unknown Solution Length at Almost No Extra Cost. Algorithmica Benjamin Doerr, Carola Doerr, Timo Kötzing
2019	J	`jnl`	Unbiasedness of estimation-of-distribution algorithms. Theor. Comput. Sci. Tobias Friedrich, Timo Kötzing, Martin S. Krejca
2018	J	`jnl`	Bounding Bloat in Genetic Programming. CoRR Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler
2018	—	`conf`	Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming. PPSN (2) Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko
2018	J	`jnl`	Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming. CoRR Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko
2018	J	`jnl`	Escaping Local Optima Using Crossover With Emergent Diversity. IEEE Trans. Evol. Comput. Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2018	—	`conf`	First-Hitting Times Under Additive Drift. PPSN (2) Timo Kötzing, Martin S. Krejca
2018	J	`jnl`	First-Hitting Times Under Additive Drift. CoRR Timo Kötzing, Martin S. Krejca
2018	—	`conf`	First-Hitting Times for Finite State Spaces. PPSN (2) Timo Kötzing, Martin S. Krejca
2018	A	`conf`	Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. GECCO Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
2018	J	`jnl`	Intuitive Analyses via Drift Theory. CoRR Andreas Göbel, Timo Kötzing, Martin S. Krejca
2018	J	`jnl`	Learning Families of Formal Languages from Positive and Negative Information. CoRR Martin Aschenbach, Timo Kötzing, Karen Seidel
2018	J	`jnl`	Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. Algorithmica Timo Kötzing, Dirk Sudholt
2018	—	`conf`	Ring Migration Topology Helps Bypassing Local Optima. PPSN (2) Clemens Frahnow, Timo Kötzing
2018	J	`jnl`	Ring Migration Topology Helps Bypassing Local Optima. CoRR Clemens Frahnow, Timo Kötzing
2018	J	`jnl`	Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables. Algorithmica Benjamin Doerr, Carola Doerr, Timo Kötzing
2017	A*	`conf`	A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. AAAI Tobias Friedrich, Timo Kötzing, Markus Wagner
2017	J	`jnl`	A Solution to Wiehagen's Thesis. Theory Comput. Syst. Timo Kötzing
2017	A	`conf`	Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. FOGA Tobias Friedrich, Timo Kötzing, Gregor Lagodzinski, Frank Neumann, Martin Schirneck
2017	—	`conf`	Analyzing search heuristics with differential equations. GECCO (Companion) Tobias Friedrich, Timo Kötzing, Anna Melnichenko
2017	A	`conf`	Bounding bloat in genetic programming. GECCO Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler
2017	A	`conf`	Island models meet rumor spreading. GECCO Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck
2017	B	`conf`	Normal Forms in Semantic Language Identification. ALT Timo Kötzing, Martin Schirneck, Karen Seidel
2017	A	`conf`	Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. GECCO Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann
2017	A	`conf`	Resampling vs Recombination: a Statistical Run Time Estimation. FOGA Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
2017	—	`conf`	Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. Australasian Conference on Artificial Intelligence Wanru Gao, Tobias Friedrich, Timo Kötzing, Frank Neumann
2017	J	`jnl`	The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise. IEEE Trans. Evol. Comput. Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2017	A	`conf`	Unknown solution length problems with no asymptotically optimal run time. GECCO Benjamin Doerr, Carola Doerr, Timo Kötzing
2016	J	`jnl`	A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover. CoRR Tobias Friedrich, Timo Kötzing, Markus Wagner
2016	J	`jnl`	A map of update constraints in inductive inference. Theor. Comput. Sci. Timo Kötzing, Raphaela Palenta
2016	—	`conf`	Ant Colony Optimization Beats Resampling on Noisy Functions. GECCO (Companion) Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
2016	J	`jnl`	Concentration of First Hitting Times Under Additive Drift. Algorithmica Timo Kötzing
2016	A	`conf`	EDAs cannot be Balanced and Stable. GECCO Tobias Friedrich, Timo Kötzing, Martin S. Krejca
2016	A	`conf`	Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. PPSN Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2016	J	`jnl`	Enlarging learnable classes. Inf. Comput. Sanjay Jain, Timo Kötzing, Frank Stephan
2016	J	`jnl`	Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. CoRR Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2016	A	`conf`	Escaping Local Optima with Diversity Mechanisms and Crossover. GECCO Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2016	A	`conf`	Fast Building Block Assembly by Majority Vote Crossover. GECCO Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Samadhi Nallaperuma, Frank Neumann, Martin Schirneck
2016	A	`conf`	Graceful Scaling on Uniform Versus Steep-Tailed Noise. PPSN Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2016	A	`conf`	On the Robustness of Evolving Populations. PPSN Tobias Friedrich, Timo Kötzing, Andrew M. Sutton
2016	J	`jnl`	On the role of update constraints and text-types in iterative learning. Inf. Comput. Sanjay Jain, Timo Kötzing, Junqi Ma, Frank Stephan
2016	A	`conf`	Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables. PPSN Benjamin Doerr, Carola Doerr, Timo Kötzing
2016	J	`jnl`	Robustness of Ant Colony Optimization to Noise. Evol. Comput. Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2016	J	`jnl`	Robustness of Populations in Stochastic Environments. Algorithmica Christian Gießen, Timo Kötzing
2016	J	`jnl`	Strongly non-U-shaped language learning results by general techniques. Inf. Comput. John Case, Timo Kötzing
2016	—	`conf`	The Benefit of Recombination in Noisy Evolutionary Search. GECCO (Companion) Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2016	A	`conf`	The Right Mutation Strength for Multi-Valued Decision Variables. GECCO Benjamin Doerr, Carola Doerr, Timo Kötzing
2016	J	`jnl`	The Right Mutation Strength for Multi-Valued Decision Variables. CoRR Benjamin Doerr, Carola Doerr, Timo Kötzing
2016	J	`jnl`	Topological separations in inductive inference. Theor. Comput. Sci. John Case, Timo Kötzing
2016	A	`conf`	Towards an Atlas of Computational Learning Theory. STACS Timo Kötzing, Martin Schirneck
2015	A	`conf`	(1+1) EA on Generalized Dynamic OneMax. FOGA Timo Kötzing, Andrei Lissovoi, Carsten Witt
2015	J	`jnl`	Fast Learning of Restricted Regular Expressions and DTDs. Theory Comput. Syst. Dominik D. Freydenberger, Timo Kötzing
2015	A	`conf`	Robustness of Ant Colony Optimization to Noise. GECCO Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2015	A	`conf`	Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. GECCO Benjamin Doerr, Carola Doerr, Timo Kötzing
2015	J	`jnl`	Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. CoRR Benjamin Doerr, Carola Doerr, Timo Kötzing
2015	B	`conf`	The Benefit of Recombination in Noisy Evolutionary Search. ISAAC Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2015	J	`jnl`	The Benefit of Sex in Noisy Evolutionary Search. CoRR Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2015	J	`jnl`	Unbiased Black-Box Complexities of Jump Functions. Evol. Comput. Benjamin Doerr, Carola Doerr, Timo Kötzing
2014	B	`conf`	A Map of Update Constraints in Inductive Inference. ALT Timo Kötzing, Raphaela Palenta
2014	J	`jnl`	A Map of Update Constraints in Inductive Inference. CoRR Timo Kötzing, Raphaela Palenta
2014	A	`conf`	A Solution to Wiehagen's Thesis. STACS Timo Kötzing
2014	A	`conf`	Concentration of first hitting times under additive drift. GECCO Timo Kötzing
2014	J	`jnl`	Iterative learning from positive data and counters. Theor. Comput. Sci. Timo Kötzing
2014	B	`conf`	On the Role of Update Constraints and Text-Types in Iterative Learning. ALT Sanjay Jain, Timo Kötzing, Junqi Ma, Frank Stephan
2014	A	`conf`	Robustness of populations in stochastic environments. GECCO Christian Gießen, Timo Kötzing
2014	J	`jnl`	The Max problem revisited: The importance of mutation in genetic programming. Theor. Comput. Sci. Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly
2014	J	`jnl`	The unbiased black-box complexity of partition is polynomial. Artif. Intell. Benjamin Doerr, Carola Doerr, Timo Kötzing
2014	J	`jnl`	Unbiased Black-Box Complexities of Jump Functions - How to Cross Large Plateaus. CoRR Benjamin Doerr, Carola Doerr, Timo Kötzing
2014	A	`conf`	Unbiased black-box complexities of jump functions: how to cross large plateaus. GECCO Benjamin Doerr, Carola Doerr, Timo Kötzing
2013	—	`conf`	A Normal Form for Argumentation Frameworks. TAFA Cosmina Croitoru, Timo Kötzing
2013	A	`conf`	An effective heuristic for the smallest grammar problem. GECCO Florian Benz, Timo Kötzing
2013	J	`jnl`	Black-box complexities of combinatorial problems. Theor. Comput. Sci. Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen
2013	A	`conf`	Fast learning of restricted regular expressions and DTDs. ICDT Dominik D. Freydenberger, Timo Kötzing
2013	J	`jnl`	Memory-limited non-U-shaped learning with solved open problems. Theor. Comput. Sci. John Case, Timo Kötzing
2013	A*	`conf`	MenuOptimizer: interactive optimization of menu systems. UIST Gilles Bailly, Antti Oulasvirta, Timo Kötzing, Sabrina Hoppe
2013	J	`jnl`	More effective crossover operators for the all-pairs shortest path problem. Theor. Comput. Sci. Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2013	A	`conf`	Optimizing expected path lengths with ant colony optimization using fitness proportional update. FOGA Matthias Feldmann, Timo Kötzing
2013	B	`conf`	Topological Separations in Inductive Inference. ALT John Case, Timo Kötzing
2012	—	`conf`	ACO Beats EA on a Dynamic Pseudo-Boolean Function. PPSN (1) Timo Kötzing, Hendrik Molter
2012	A	`conf`	Ants easily solve stochastic shortest path problems. GECCO Benjamin Doerr, Ashish Ranjan Hota, Timo Kötzing
2012	—	`conf`	Deliberative Acceptability of Arguments. STAIRS Cosmina Croitoru, Timo Kötzing
2012	A	`conf`	Efficient algorithms for extracting biological key pathways with global constraints. GECCO Jan Baumbach, Tobias Friedrich, Timo Kötzing, Anton Krohmer, Joachim Müller, Josch Pauling
2012	B	`conf`	Enlarging Learnable Classes. ALT Sanjay Jain, Timo Kötzing, Frank Stephan
2012	J	`jnl`	Learning in the limit with lattice-structured hypothesis spaces. Theor. Comput. Sci. Jeffrey Heinz, Anna Kasprzik, Timo Kötzing
2012	J	`jnl`	Learning secrets interactively. Dynamic modeling in inductive inference. Inf. Comput. John Case, Timo Kötzing
2012	J	`jnl`	More Effective Crossover Operators for the All-Pairs Shortest Path Problem CoRR Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2012	A	`conf`	The max problem revisited: the importance of mutation in genetic programming. GECCO Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly
2012	J	`jnl`	Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intell. Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
2011	J	`jnl`	Black-Box Complexities of Combinatorial Problems CoRR Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen
2011	A	`conf`	Black-box complexities of combinatorial problems. GECCO Benjamin Doerr, Johannes Lengler, Timo Kötzing, Carola Winzen
2011	A	`conf`	Faster black-box algorithms through higher arity operators. FOGA Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen
2011	A	`conf`	How crossover helps in pseudo-boolean optimization. GECCO Timo Kötzing, Dirk Sudholt, Madeleine Theile
2011	B	`conf`	Iterative Learning from Positive Data and Counters. ALT Timo Kötzing
2011	A	`conf`	Measuring Learning Complexity with Criteria Epitomizers. STACS John Case, Timo Kötzing
2011	A	`conf`	PAC learning and genetic programming. GECCO Timo Kötzing, Frank Neumann, Reto Spöhel
2011	A	`conf`	Simple max-min ant systems and the optimization of linear pseudo-boolean functions. FOGA Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner
2011	A	`conf`	Too fast unbiased black-box algorithms. GECCO Benjamin Doerr, Timo Kötzing, Carola Winzen
2010	A	`conf`	Ant colony optimization and the minimum cut problem. GECCO Timo Kötzing, Per Kristian Lehre, Frank Neumann, Pietro S. Oliveto
2010	J	`jnl`	Faster Black-Box Algorithms Through Higher Arity Operators CoRR Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen
2010	—	`conf`	More Effective Crossover Operators for the All-Pairs Shortest Path Problem. PPSN (1) Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2010	J	`jnl`	Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions CoRR Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner
2010	B	`conf`	Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations. ALT John Case, Timo Kötzing
2010	C	`conf`	String Extension Learning Using Lattices. LATA Anna Kasprzik, Timo Kötzing
2010	A*	`conf`	Strongly Non-U-Shaped Learning Results by General Techniques. COLT John Case, Timo Kötzing
2010	—	`conf`	Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. ANTS Conference Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
2009	B	`conf`	Difficulties in Forcing Fairness of Polynomial Time Inductive Inference. ALT John Case, Timo Kötzing
2008	B	`conf`	Dynamic Modeling in Inductive Inference. ALT John Case, Timo Kötzing
2008	B	`conf`	Dynamically Delayed Postdictive Completeness and Consistency in Learning. ALT John Case, Timo Kötzing
2007	B	`conf`	Feasible Iteration of Feasible Learning Functionals. ALT John Case, Timo Kötzing, Todd Paddock