Timo Kötzing

	2012
22		Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt: Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intelligence 6(1): 1-21 (2012)
	2011
21		Timo Kötzing: Iterative Learning from Positive Data and Counters. ALT 2011: 40-54
20		Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen: Faster black-box algorithms through higher arity operators. FOGA 2011: 163-172
19		Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner: Simple max-min ant systems and the optimization of linear pseudo-boolean functions. FOGA 2011: 209-218
18		Benjamin Doerr, Timo Kötzing, Carola Winzen: Too fast unbiased black-box algorithms. GECCO 2011: 2043-2050
17		Timo Kötzing, Frank Neumann, Reto Spöhel: PAC learning and genetic programming. GECCO 2011: 2091-2096
16		Benjamin Doerr, Johannes Lengler, Timo Kötzing, Carola Winzen: Black-box complexities of combinatorial problems. GECCO 2011: 981-988
15		Timo Kötzing, Dirk Sudholt, Madeleine Theile: How crossover helps in pseudo-boolean optimization. GECCO 2011: 989-996
14		John Case, Timo Kötzing: Measuring Learning Complexity with Criteria Epitomizers. STACS 2011: 320-331
13		Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen: Black-Box Complexities of Combinatorial Problems CoRR abs/1108.0342: (2011)
	2010
12		John Case, Timo Kötzing: Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations. ALT 2010: 285-299
11		Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt: Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. ANTS Conference 2010: 324-335
10		John Case, Timo Kötzing: Strongly Non-U-Shaped Learning Results by General Techniques. COLT 2010: 181-193
9		Timo Kötzing, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto: Ant colony optimization and the minimum cut problem. GECCO 2010: 1393-1400
8		Anna Kasprzik, Timo Kötzing: String Extension Learning Using Lattices. LATA 2010: 380-391
7		Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile: More Effective Crossover Operators for the All-Pairs Shortest Path Problem. PPSN (1) 2010: 184-193
6		Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner: Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions CoRR abs/1007.4707: (2010)
5		Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen: Faster Black-Box Algorithms Through Higher Arity Operators CoRR abs/1012.0952: (2010)
	2009
4		John Case, Timo Kötzing: Difficulties in Forcing Fairness of Polynomial Time Inductive Inference. ALT 2009: 263-277
	2008
3		John Case, Timo Kötzing: Dynamically Delayed Postdictive Completeness and Consistency in Learning. ALT 2008: 389-403
2		John Case, Timo Kötzing: Dynamic Modeling in Inductive Inference. ALT 2008: 404-418
	2007
1		John Case, Timo Kötzing, Todd Paddock: Feasible Iteration of Feasible Learning Functionals. ALT 2007: 34-48

Coauthor Index

1	John Case	[1] [2] [3] [4] [10] [12] [14]
2	Benjamin Doerr	[5] [7] [13] [16] [18] [20]
3	Daniel Johannsen	[5] [7] [20]
4	Anna Kasprzik	[8]
5	Per Kristian Lehre	[5] [9] [20]
6	Johannes Lengler	[13] [16]
7	Frank Neumann	[6] [7] [9] [11] [17] [19] [22]
8	Pietro Simone Oliveto	[9]
9	Todd Paddock	[1]
10	Heiko Röglin (Heiko Roeglin)	[11] [22]
11	Reto Spöhel	[17]
12	Dirk Sudholt	[6] [15] [19]
13	Madeleine Theile	[7] [15]
14	Markus Wagner	[5] [6] [19] [20]
15	Carola Winzen	[5] [13] [16] [18] [20]
16	Carsten Witt	[11] [22]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page