# Publications of Dr. Timo Kötzing

The following listing contains all publications of Dr. Timo Kötzing. Further publications of the research group can be found on the current list of publications and the complete list of publications. Individual listings are available externally on DBLP and Google Scholar or locally as PDF.

You can view all publications of the current members of the Algorithm Engineering group. For other listings, please see:

- years: 2021, 2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010
- researchers: Prof. Dr. Tobias Friedrich, Dr. Katrin Casel, Dr. Sarel Cohen, Dr. Ágnes Cseh, Dr. Andreas Göbel, Dr. Davis Issac, Dr. Timo Kötzing, Dr. Nikhil Kumar, Dr. Pascal Lenzner
- PhD students: Vanja Doskoč, Ziena Elijazyfer, Philipp Fischbeck, Maximilian Katzmann, Simon Krogmann, Gregor Lagodzinski, Anna Melnichenko, Louise Molitor, Stefan Neubert, Marcus Pappik, Francesco Quinzan, Ralf Rothenberger, Martin Schirneck, Karen Seidel, Christopher Weyand
- theory conferences: ICALP, MFCS, SAGT, STACS, STOC, WINE

algorithm conferences: ALENEX, ESA, GD, ISAAC, SODA, SPAA, SWAT, WAW - artificial intelligence conferences: AAAI, AAMAS, ALT, COLT, ECAI, ICAPS, IJCAI, SAT

evolutionary computation conferences: CEC, EMO, EvoCOP, FOGA, GECCO, PPSN

2021 [ nach oben ]

- Towards a Map for Incremental Learning in the Limit from Positive and Negative Information. Computability in Europe (CiE) 2021
- Normal Forms for Semantically Witness-Based Learners in Inductive Inference. Computability in Europe (CiE) 2021
- Mapping Monotonic Restrictions in Inductive Inference. Computability in Europe (CiE) 2021
- Learning Languages with Decidable Hypotheses. Computability in Europe (CiE) 2021
- Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes. Computability in Europe (CiE) 2021
- Lower Bounds from Fitness Levels Made Easy. Genetic and Evolutionary Computation Conference (GECCO) 2021

2020 [ nach oben ]

- Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 2020: 3117-3123
- Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. Theoretical Computer Science 2020: 3-19
- Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming. Theoretical Computer Science 2020: 96--113
- The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time. Theoretical Computer Science 2020: 144--168
- Cautious Limit Learning. Algorithmic Learning Theory (ALT) 2020: 251-276
- Improved Fixed-Budget Results via Drift Analysis. Parallel Problem Solving From Nature (PPSN) 2020: 648-660

2019 [ nach oben ]

- Solving Problems with Unknown Solution Length at Almost No Extra Cost. Algorithmica 2019: 703-748
- Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 2019: 828-857
- Island Models Meet Rumor Spreading. Algorithmica 2019: 886-915
- Surfing on the seascape: Adaptation in a changing environment. Evolution: International Journal of Organic Evolution 2019: 1356-1374
- Unbiasedness of Estimation-of-Distribution Algorithms. Theoretical Computer Science 2019: 46-59
- First-hitting times under drift. Theoretical Computer Science 2019: 51-69
- Limit Learning Equivalence Structures. Algorithmic Learning Theory (ALT) 2019: 383-403
- Multiplicative Up-Drift. Genetic and Evolutionary Computation Conference (GECCO) 2019
- Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. International Conference on Automated Planning and Scheduling (ICAPS) 2019: 541-554

2018 [ nach oben ]

- Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. Algorithmica 2018: 1575-1578
- Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables. Algorithmica 2018: 1732-1768
- Escaping Local Optima Using Crossover with Emergent Diversity. Transactions on Evolutionary Computation 2018: 484-497
- Improving the Run Time of the (1+1) Evolutionary Algorithm with Luby Sequences. Genetic and Evolutionary Computation Conference (GECCO) 2018: 301-308
- Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming. Parallel Problem Solving From Nature (PPSN) 2018: 42-54
- First-Hitting Times for Finite State Spaces. Parallel Problem Solving From Nature (PPSN) 2018: 79-91
- First-Hitting Times Under Additive Drift. Parallel Problem Solving From Nature (PPSN) 2018: 92-104
- Ring Migration Topology Helps Bypassing Local Optima. Parallel Problem Solving From Nature (PPSN) 2018: 129-140

2017 [ nach oben ]

- The Compact Genetic Algorithm is Efficient under Extreme Gaussian Noise. Transactions on Evolutionary Computation 2017: 477-490
- A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. Conference on Artificial Intelligence (AAAI) 2017: 801-807
- Normal Forms in Semantic Language Identification. Algorithmic Learning Theory (ALT) 2017: 493-516
- Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. Australasian Conference on Artificial Intelligence (AUSAI) 2017: 131-143
- Resampling vs Recombination: a Statistical Run Time Estimation. Foundations of Genetic Algorithms (FOGA) 2017: 25-35
- Analysis of the {(1+1)} EA on Subclasses of Linear Functions under Uniform and Linear Constraints. Foundations of Genetic Algorithms (FOGA) 2017: 45-54
- Analyzing Search Heuristics with Differential Equations. Genetic and Evolutionary Computation Conference (GECCO) 2017: 313-314
- Bounding Bloat in Genetic Programming. Genetic and Evolutionary Computation Conference (GECCO) 2017: 921-928
- Island Models Meet Rumor Spreading. Genetic and Evolutionary Computation Conference (GECCO) 2017: 1359-1366
- Unknown Solution Length Problems With No Asymptotically Optimal Run Time. Genetic and Evolutionary Computation Conference (GECCO) 2017: 1367-1374
- Reoptimization Times of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Genetic and Evolutionary Computation Conference (GECCO) 2017: 1407-1414

2016 [ nach oben ]

- Robustness of Populations in Stochastic Environments. Algorithmica 2016: 462-489
- Concentration of First Hitting Times Under Additive Drift. Algorithmica 2016: 490-506
- Robustness of Ant Colony Optimization to Noise. Evolutionary Computation 2016: 237-254
- Strongly non-U-shaped language learning results by general techniques. Information and Computation 2016: 1-15
- On the Role of Update Constraints and Text-Types in Iterative Learning. Information and Computation 2016: 152-168
- Enlarging learnable classes. Information and Computation 2016: 194-207
- A map of update constraints in inductive inference. Theoretical Computer Science 2016: 4-24
- Topological Separations in Inductive Inference. Theoretical Computer Science 2016: 33-45
- Ant Colony Optimization Beats Resampling on Noisy Functions. Genetic and Evolutionary Computation Conference (GECCO) 2016: 3-4
- The Benefit of Recombination in Noisy Evolutionary Search. Genetic and Evolutionary Computation Conference (GECCO) 2016: 161-162
- Escaping Local Optima with Diversity Mechanisms and Crossover. Genetic and Evolutionary Computation Conference (GECCO) 2016: 645-652
- Fast Building Block Assembly by Majority Vote Crossover. Genetic and Evolutionary Computation Conference (GECCO) 2016: 661-668
- The Right Mutation Strength for Multi-Valued Decision Variables. Genetic and Evolutionary Computation Conference (GECCO) 2016: 1115-1122
- {EDA}s cannot be Balanced and Stable. Genetic and Evolutionary Computation Conference (GECCO) 2016: 1139-1146
- Graceful Scaling on Uniform versus Steep-Tailed Noise. Parallel Problem Solving From Nature (PPSN) 2016: 761-770
- On the Robustness of Evolving Populations. Parallel Problem Solving From Nature (PPSN) 2016: 771-781
- Provably Optimal Self-Adjusting Step Sizes for Multi-Valued Decision Variables. Parallel Problem Solving From Nature (PPSN) 2016: 782-791
- Emergence of Diversity and its Benefits for Crossover in Genetic Algorithms. Parallel Problem Solving From Nature (PPSN) 2016: 890-900
- Towards an Atlas of Computational Learning Theory. Symposium on Theoretical Aspects of Computer Science (STACS) 2016: 47:1-47:13

2015 [ nach oben ]

- Unbiased Black-Box Complexities of Jump Functions. Evolutionary Computation 2015: 641-670
- Fast Learning of Restricted Regular Expressions and DTDs. Theory of Computing Systems 2015: 1114-1158
- (1+1) EA on Generalized Dynamic OneMax. Foundations of Genetic Algorithms (FOGA) 2015: 40-51
- Robustness of Ant Colony Optimization to Noise. Genetic and Evolutionary Computation Conference (GECCO) 2015: 17-24Best-Paper Award (ACO/SI Track)
- Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. Genetic and Evolutionary Computation Conference (GECCO) 2015: 831-838
- The Benefit of Recombination in Noisy Evolutionary Search. International Symposium of Algorithms and Computation (ISAAC) 2015: 140-150

2014 [ nach oben ]

- The unbiased black-box complexity of partition is polynomial. Artificial Intelligence 2014: 275-286
- The Max problem revisited: The importance of mutation in genetic programming. Theoretical Computer Science 2014: 94-107
- Iterative learning from positive data and counters. Theoretical Computer Science 2014: 155-169
- A Map of Update Constraints in Inductive Inference. Algorithmic Learning Theory (ALT) 2014: 40-54
- On the Role of Update Constraints and Text-Types in Iterative Learning. Algorithmic Learning Theory (ALT) 2014: 55-69
- Unbiased black-box complexities of jump functions: how to cross large plateaus. Genetic and Evolutionary Computation Conference (GECCO) 2014: 769-776
- Robustness of populations in stochastic environments. Genetic and Evolutionary Computation Conference (GECCO) 2014: 1383-1390
- Concentration of first hitting times under additive drift. Genetic and Evolutionary Computation Conference (GECCO) 2014: 1391-1398
- A Solution to Wiehagen's Thesis. Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 494-505

2013 [ nach oben ]

- More effective crossover operators for the all-pairs shortest path problem. Theoretical Computer Science 2013: 12-26
- Black-box complexities of combinatorial problems. Theoretical Computer Science 2013: 84-106
- Memory-limited non-U-shaped learning with solved open problems. Theoretical Computer Science 2013: 100-123
- Topological Separations in Inductive Inference. Algorithmic Learning Theory (ALT) 2013: 128-142
- Optimizing expected path lengths with ant colony optimization using fitness proportional update. Foundations of Genetic Algorithms (FOGA) 2013: 65-74
- An effective heuristic for the smallest grammar problem. Genetic and Evolutionary Computation Conference (GECCO) 2013: 487-494
- Fast learning of restricted regular expressions and DTDs. International Conference on Database Theory (ICDT) 2013: 45-56
- A Normal Form for Argumentation Frameworks. Theorie and Applications of Formal Argumentation (TAFA) 2013: 32-45
- MenuOptimizer: interactive optimization of menu systems. User Interface Software and Technology (UIST) 2013: 331-342

2012 [ nach oben ]

- Learning secrets interactively. Dynamic modeling in inductive inference. Information and Computation 2012: 60-73
- Efficient Key Pathway Mining: Combining Networks and OMICS Data. Integrative Biology 2012: 756-764
- Computability-Theoretic Learning Complexity. Philosophical Transactions of the Royal Society A 2012: 3570-3596
- Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intelligence 2012: 1-21
- Learning in the limit with lattice-structured hypothesis spaces. Theoretical Computer Science 2012: 111-127
- Enlarging Learnable Classes. Algorithmic Learning Theory (ALT) 2012: 36-50
- Ants easily solve stochastic shortest path problems. Genetic and Evolutionary Computation Conference (GECCO) 2012: 17-24
- Efficient Algorithms for Extracting Biological Key Pathways with Global Constraints. Genetic and Evolutionary Computation Conference (GECCO) 2012: 169-176
- The max problem revisited: the importance of mutation in genetic programming. Genetic and Evolutionary Computation Conference (GECCO) 2012: 1333-1340
- ACO Beats EA on a Dynamic Pseudo-Boolean Function. Parallel Problem Solving from Nature (PPSN) 2012: 113-122
- Deliberative Acceptability of Arguments. Starting AI Researcher Symposium (STAIRS) 2012: 71-82

2011 [ nach oben ]

- Iterative Learning from Positive Data and Counters. Algorithmic Learning Theory (ALT) 2011: 40-54
- Faster black-box algorithms through higher arity operators. Foundations of Genetic Algorithms (FOGA) 2011: 163-172
- Simple max-min ant systems and the optimization of linear pseudo-boolean functions. Foundations of Genetic Algorithms (FOGA) 2011: 209-218
- Black-box complexities of combinatorial problems. Genetic and Evolutionary Computation Conference (GECCO) 2011: 981-988
- How crossover helps in pseudo-boolean optimization. Genetic and Evolutionary Computation Conference (GECCO) 2011: 989-996
- Too fast unbiased black-box algorithms. Genetic and Evolutionary Computation Conference (GECCO) 2011: 2043-2050
- PAC learning and genetic programming. Genetic and Evolutionary Computation Conference (GECCO) 2011: 2091-2096
- Measuring Learning Complexity with Criteria Epitomizers. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 320-331

2010 [ nach oben ]

- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations. Algorithmic Learning Theory (ALT) 2010: 285-299
- Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. International Conference on Swarm Intelligence (ANTS) 2010: 324-335
- Strongly Non-U-Shaped Learning Results by General Techniques. Conference On Learning Theory (COLT) 2010: 181-193
- Ant colony optimization and the minimum cut problem. Genetic and Evolutionary Computation Conference (GECCO) 2010: 1393-1400
- String Extension Learning Using Lattices. Language and Automata Theory and Applications (LATA) 2010: 380-391
- More Effective Crossover Operators for the All-Pairs Shortest Path Problem. Parallel Problem Solving from Nature (PPSN) 2010: 184-193

2009 [ nach oben ]

- Difficulties in Forcing Fairness of Polynomial Time Inductive Inference. Algorithmic Learning Theory (ALT) 2009: 263-277

2008 [ nach oben ]

- Dynamically Delayed Postdictive Completeness and Consistency in Learning. Algorithmic Learning Theory (ALT) 2008: 389-403
- Dynamic Modeling in Inductive Inference. Algorithmic Learning Theory (ALT) 2008: 404-418

2007 [ nach oben ]

- Feasible Iteration of Feasible Learning Functionals. Algorithmic Learning Theory (ALT) 2007: 34-48