Benjamin Doerr

	2012
145		Benjamin Doerr, Carola Winzen: Playing Mastermind With Constant-Size Memory. STACS 2012: 441-452
144		Benjamin Doerr, Carola Winzen: Reducing the Arity in Unbiased Black-Box Complexity CoRR abs/1203.4111: (2012)
143		Benjamin Doerr, Carola Winzen: Memory-restricted black-box complexity of OneMax. Inf. Process. Lett. 112(1-2): 32-34 (2012)
142		Benjamin Doerr, Edda Happ, Christian Klein: Crossover can provably be useful in evolutionary computation. Theor. Comput. Sci. 425: 17-33 (2012)
	2011
141		Benjamin Doerr, Marvin Künnemann, Magnus Wahlström: Dependent Randomized Rounding: The Bipartite Case. ALENEX 2011: 96-106
140		Tetsuo Asano, Benjamin Doerr: Memory-Constrained Algorithms for Shortest Path Problem. CCCG 2011
139		Benjamin Doerr, Carola Winzen: Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity. CSR 2011: 15-28
138		Benjamin Doerr, Daniel Johannsen, Martin Schmidt: Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. FOGA 2011: 119-126
137		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
136		Benjamin Doerr, Timo Kötzing, Carola Winzen: Too fast unbiased black-box algorithms. GECCO 2011: 2043-2050
135		Benjamin Doerr, Mahmoud Fouz, Carsten Witt: Sharp bounds by probability-generating functions and variable drift. GECCO 2011: 2083-2090
134		Benjamin Doerr, Johannes Lengler, Timo Kötzing, Carola Winzen: Black-box complexities of combinatorial problems. GECCO 2011: 981-988
133		Benjamin Doerr: Drift analysis. GECCO (Companion) 2011: 1311-1320
132		Benjamin Doerr, Mahmoud Fouz: Asymptotically Optimal Randomized Rumor Spreading. ICALP (2) 2011: 502-513
131		Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler: Stabilizing consensus with the power of two choices. SPAA 2011: 149-158
130		Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, Benjamin Doerr: Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting. SSVM 2011: 26-37
129		Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich: Social networks spread rumors in sublogarithmic time. STOC 2011: 21-30
128		Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald: Quasirandom rumor spreading: An experimental analysis. ACM Journal of Experimental Algorithmics 16: (2011)
127		Benjamin Doerr, Thomas Jansen: Theory of Evolutionary Computation. Algorithmica 59(3): 299-300 (2011)
126		Benjamin Doerr, Daniel Johannsen, Carola Winzen: Multiplicative Drift Analysis CoRR abs/1101.0776: (2011)
125		Benjamin Doerr, Carola Winzen: Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity CoRR abs/1102.1140: (2011)
124		Benjamin Doerr, Leslie Ann Goldberg: Adaptive Drift Analysis CoRR abs/1108.0295: (2011)
123		Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen: Black-Box Complexities of Combinatorial Problems CoRR abs/1108.0342: (2011)
122		Benjamin Doerr, Carola Winzen: Playing Mastermind With Constant-Size Memory CoRR abs/1110.3619: (2011)
121		Benjamin Doerr, Carola Winzen: Memory-Restricted Black-Box Complexity. Electronic Colloquium on Computational Complexity (ECCC) 18: 92 (2011)
120		Benjamin Doerr, Mahmoud Fouz: Asymptotically Optimal Randomized Rumor Spreading. Electronic Notes in Discrete Mathematics 38: 297-302 (2011)
119		Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich: Social Networks Spread Rumors in Sublogarithmic Time. Electronic Notes in Discrete Mathematics 38: 303-308 (2011)
118		Benjamin Doerr, Edda Happ, Christian Klein: Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem. Evolutionary Computation 19(4): 673-691 (2011)
117		Benjamin Doerr, Mahmoud Fouz: Quasi-random rumor spreading: Reducing randomness can be costly. Inf. Process. Lett. 111(5): 227-230 (2011)
116		Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt: Runtime analysis of the 1-ANT ant colony optimizer. Theor. Comput. Sci. 412(17): 1629-1644 (2011)
115		Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen: Evolutionary algorithms and dynamic programming. Theor. Comput. Sci. 412(43): 6020-6035 (2011)
	2010
114		Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler: Brief Announcement: Stabilizing Consensus with the Power of Two Choices. DISC 2010: 528-530
113		Benjamin Doerr, Daniel Johannsen, Carola Winzen: Multiplicative drift analysis. GECCO 2010: 1449-1456
112		Benjamin Doerr, Mahmoud Fouz, Carsten Witt: Quasirandom evolutionary algorithms. GECCO 2010: 1457-1464
111		Benjamin Doerr, Daniel Johannsen: Edge-based representation beats vertex-based representation in shortest path problems. GECCO 2010: 759-766
110		Benjamin Doerr, Daniel Johannsen, Carola Winzen: Drift analysis and linear functions revisited. IEEE Congress on Evolutionary Computation 2010: 1-8
109		Süntje Böttcher, Benjamin Doerr, Frank Neumann: Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. PPSN (1) 2010: 1-10
108		Benjamin Doerr, Leslie Ann Goldberg: Drift Analysis with Tail Bounds. PPSN (1) 2010: 174-183
107		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
106		Benjamin Doerr, Leslie Ann Goldberg: Adaptive Drift Analysis. PPSN (1) 2010: 32-41
105		Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges: Optimizing Monotone Functions Can Be Difficult. PPSN (1) 2010: 42-51
104		Benjamin Doerr, Marvin Künnemann, Magnus Wahlström: Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. SEA 2010: 190-201
103		Benjamin Doerr, Frank Neumann, Ingo Wegener: Editorial. Algorithmica 57(1): 119-120 (2010)
102		Benjamin Doerr, Frank Neumann: In Memoriam: Ingo Wegener. Algorithmica 58(3): 541-542 (2010)
101		Benjamin Doerr, Anna Huber, Ariel Levavi: Strong Robustness of Randomized Rumor Spreading Protocols CoRR abs/1001.3056: (2010)
100		Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic Random Walks on Regular Trees CoRR abs/1006.1441: (2010)
99		Benjamin Doerr, Marvin Künnemann, Magnus Wahlström: Randomized Rounding for Routing and Covering Problems: Experiments and Improvements CoRR abs/1007.0372: (2010)
98		Benjamin Doerr, Mahmoud Fouz: Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly CoRR abs/1008.0501: (2010)
97		Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges: Optimizing Monotone Functions Can Be Difficult CoRR abs/1010.1429: (2010)
96		Benjamin Doerr, Mahmoud Fouz: Asymptotically Optimal Randomized Rumor Spreading CoRR abs/1011.1868: (2010)
95		Benjamin Doerr, Daniel Johannsen, Carola Winzen: Non-Existence of Linear Universal Drift Functions CoRR abs/1011.3466: (2010)
94		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)
93		Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald: Quasirandom Rumor Spreading CoRR abs/1012.5351: (2010)
92		Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald: Quasirandom Rumor Spreading: An Experimental Analysis CoRR abs/1012.5357: (2010)
91		Benjamin Doerr, Michael Gnewuch, Magnus Wahlström: Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. J. Complexity 26(5): 490-507 (2010)
90		Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic random walks on regular trees. Random Struct. Algorithms 37(3): 353-366 (2010)
89		Benjamin Doerr, Mahmoud Fouz: Hereditary Discrepancies in Different Numbers of Colors II. SIAM J. Discrete Math. 24(3): 1205-1213 (2010)
	2009
88		Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald: Quasirandom Rumor Spreading: An Experimental Analysis. ALENEX 2009: 145-153
87		Benjamin Doerr, Magnus Wahlström: Randomized Rounding in the Presence of a Cardinality Constraint. ALENEX 2009: 162-174
86		Benjamin Doerr: Introducing Quasirandomness to Computer Science. Efficient Algorithms 2009: 99-111
85		Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann: Computing single source shortest paths using single-objective fitness. FOGA 2009: 59-66
84		Benjamin Doerr, Madeleine Theile: Improved analysis methods for crossover-based algorithms. GECCO 2009: 247-254
83		Benjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile: Evolutionary algorithms and dynamic programming. GECCO 2009: 771-778
82		Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, Magnus Wahlström: BBOB: Nelder-Mead with resize and halfruns. GECCO (Companion) 2009: 2239-2246
81		Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald: Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. ICALP (1) 2009: 366-377
80		Benjamin Doerr, Anna Huber, Ariel Levavi: Strong Robustness of Randomized Rumor Spreading Protocols. ISAAC 2009: 812-821
79		Benjamin Doerr, Tobias Friedrich: Deterministic Random Walks on the Two-Dimensional Grid. Combinatorics, Probability & Computing 18(1-2): 123-144 (2009)
78		Spyros Angelopoulos, Benjamin Doerr, Anna Huber, Konstantinos Panagiotou: Tight Bounds for Quasirandom Rumor Spreading. Electr. J. Comb. 16(1): (2009)
77		Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald: Quasirandom Rumor Spreading on Expanders. Electronic Notes in Discrete Mathematics 34: 243-247 (2009)
76		Benjamin Doerr, Mahmoud Fouz: A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading. Electronic Notes in Discrete Mathematics 34: 335-339 (2009)
	2008
75		Benjamin Doerr, Edda Happ, Christian Klein: Crossover can provably be useful in evolutionary computation. GECCO 2008: 539-546
74		Benjamin Doerr, Thomas Jansen, Christian Klein: Comparing global and local mutations on bit strings. GECCO 2008: 929-936
73		Benjamin Doerr, Edda Happ: Directed trees: A powerful representation for sorting and ordering problems. IEEE Congress on Evolutionary Computation 2008: 3606-3613
72		Benjamin Doerr, Daniel Johannsen, Ching Hoo Tang: How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. PPSN 2008: 378-388
71		Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic random walks on regular trees. SODA 2008: 766-772
70		Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald: Quasirandom rumor spreading. SODA 2008: 773-781
	2007
69		Benjamin Doerr, Christian Klein, Tobias Storch: Faster Evolutionary Algorithms by Superior Graph Representation. FOCI 2007: 245-250
68		Benjamin Doerr, Daniel Johannsen: Adjacency list matchings: an ideal genotype for cycle covers. GECCO 2007: 1203-1210
67		Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt: On the runtime analysis of the 1-ANT ACO algorithm. GECCO 2007: 33-40
66		Benjamin Doerr, Edda Happ, Christian Klein: A tight analysis of the (1 + 1)-EA for the single source shortest path problem. IEEE Congress on Evolutionary Computation 2007: 1890-1895
65		Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann: A rigorous view on neutrality. IEEE Congress on Evolutionary Computation 2007: 2591-2597
64		Benjamin Doerr, Daniel Johannsen: Refined runtime analysis of a basic ant colony optimization algorithm. IEEE Congress on Evolutionary Computation 2007: 501-507
63		Benjamin Doerr: Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. STACS 2007: 441-452
62		Tobias Friedrich, Benjamin Doerr, Christian Klein, Ralf Osbild: Unbiased Matrix Rounding. Electronic Notes in Discrete Mathematics 28: 41-46 (2007)
61		Benjamin Doerr, Johannes Lengler, David Steurer: The Interval Liar Game. Electronic Notes in Discrete Mathematics 28: 425-432 (2007)
60		Benjamin Doerr: Partial Colorings of Unimodular Hypergraphs. Electronic Notes in Discrete Mathematics 29: 359-363 (2007)
59		Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic Random Walks on Regular Trees. Electronic Notes in Discrete Mathematics 29: 509-513 (2007)
58		Benjamin Doerr: Matrix approximation and Tusnády's problem. Eur. J. Comb. 28(3): 990-995 (2007)
57		Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer, Gábor Tardos: Deterministic random walks on the integers. Eur. J. Comb. 28(8): 2072-2090 (2007)
56		Benjamin Doerr, Nils Hebbinghaus, Frank Neumann: Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. Evolutionary Computation 15(4): 401-410 (2007)
55		Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav: On the minimum load coloring problem. J. Discrete Algorithms 5(3): 533-545 (2007)
54		Benjamin Doerr: Roundings Respecting Hard Constraints. Theory Comput. Syst. 40(4): 467-483 (2007)
	2006
53		Benjamin Doerr, Christian Klein: Unbiased Rounding of Rational Matrices. FSTTCS 2006: 200-211
52		Benjamin Doerr, Johannes Lengler, David Steurer: The Interval Liar Game. ISAAC 2006: 318-327
51		Benjamin Doerr, Tobias Friedrich: Deterministic Random Walks on the Two-Dimensional Grid. ISAAC 2006: 474-483
50		Benjamin Doerr, Nils Hebbinghaus, Frank Neumann: Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. PPSN 2006: 978-987
49		Benjamin Doerr: Generating Randomized Roundings with Cardinality Constraints and Derandomizations. STACS 2006: 571-583
48		Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild: Unbiased Matrix Rounding. SWAT 2006: 102-112
47		Benjamin Doerr, Nils Hebbinghaus, Sören Werth: Improved Bounds and Schemes for the Declustering Problem CoRR abs/cs/0603012: (2006)
46		Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild: Unbiased Matrix Rounding CoRR abs/cs/0604068: (2006)
45		Benjamin Doerr, Mahmoud Fouz: Hereditary Discrepancies in Different Numbers of Colors II CoRR abs/cs/0611126: (2006)
44		Benjamin Doerr: Non-independent randomized rounding and coloring. Discrete Applied Mathematics 154(4): 650-659 (2006)
43		Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus: Discrepancy of Symmetric Products of Hypergraphs. Electr. J. Comb. 13(1): (2006)
42		Nils Hebbinghaus, Benjamin Doerr, Frank Neumann: Speeding up Evolutionary Algorithms by Restricted Mutation Operators. Electronic Colloquium on Computational Complexity (ECCC) 13(083): (2006)
41		Benjamin Doerr, Christian Klein: Controlled Randomized Rounding. Electronic Notes in Discrete Mathematics 25: 39-40 (2006)
40		Benjamin Doerr, Tobias Friedrich: Quasirandomness in Graphs. Electronic Notes in Discrete Mathematics 25: 61-64 (2006)
39		Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr: Inserting Points Uniformly at Every Instance. IEICE Transactions 89-D(8): 2348-2356 (2006)
38		Benjamin Doerr: Matrix rounding with respect to small submatrices. Random Struct. Algorithms 28(1): 107-112 (2006)
37		Benjamin Doerr, Nils Hebbinghaus, Sören Werth: Improved bounds and schemes for the declustering problem. Theor. Comput. Sci. 359(1-3): 123-132 (2006)
	2005
36		Benjamin Doerr: Matrix rounding with low error in small submatrices. SODA 2005: 1067-1068
35		Benjamin Doerr: Roundings Respecting Hard Constraints. STACS 2005: 617-628
34		Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav: On the Minimum Load Coloring Problem. WAOA 2005: 15-26
33		Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild: Rounding of Sequences and Matrices, with Applications. WAOA 2005: 96-109
32		Benjamin Doerr, Michael Gnewuch, Anand Srivastav: Bounds and constructions for the star-discrepancy via ?-covers. J. Complexity 21(5): 691-709 (2005)
	2004
31		Benjamin Doerr, Nils Hebbinghaus, Sören Werth: An Improved Discrepancy Approach to Declustering. CTW 2004: 114-118
30		Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav: Coloring Graphs with Minimal Edge Load. CTW 2004: 16-20
29		Benjamin Doerr, Nils Hebbinghaus, Sören Werth: Improved Bounds and Schemes for the Declustering Problem. MFCS 2004: 760-771
28		Benjamin Doerr: Matrix rounding and approximation. SODA 2004: 575-576
27		Benjamin Doerr: Linear Discrepancy of Totally Unimodular Matrices. Combinatorica 24(1): 117-125 (2004)
26		Benjamin Doerr, Anand Srivastav, Petra Wehr: Discrepancy of Cartesian Products of Arithmetic Progressions. Electr. J. Comb. 11(1): (2004)
25		Benjamin Doerr, Nils Hebbinghaus, Sören Werth: An Improved Discrepancy Approach to Declustering. Electronic Notes in Discrete Mathematics 17: 129-133 (2004)
24		Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav: Coloring Graphs with Minimal Edge Load. Electronic Notes in Discrete Mathematics 17: 9-13 (2004)
23		Benjamin Doerr: Global roundings of sequences. Inf. Process. Lett. 92(3): 113-116 (2004)
22		Benjamin Doerr: Nonindependent Randomized Rounding and an Application to Digital Halftoning. SIAM J. Comput. 34(2): 299-317 (2004)
21		Benjamin Doerr: European tenure games. Theor. Comput. Sci. 303(3): 339-351 (2004)
20		Benjamin Doerr: Typical rounding problems. Theor. Comput. Sci. 312(2-3): 463-477 (2004)
	2003
19		Benjamin Doerr: Non-independent randomized rounding. SODA 2003: 506-507
18		Benjamin Doerr, Anand Srivastav: Multicolour Discrepancies. Combinatorics, Probability & Computing 12(4): 365-399 (2003)
	2002
17		Benjamin Doerr: Typical Rounding Problems. APPROX 2002: 81-93
16		Benjamin Doerr, Henning Schnieder: Non-independent Randomized Rounding and an Application to Digital Halftoning. ESA 2002: 399-410
15		Benjamin Doerr: Antirandomizing the Wrong Game. ICALP 2002: 876-887
14		Benjamin Doerr: Balanced Coloring: Equally Easy for All Numbers of Colors? STACS 2002: 112-120
13		Benjamin Doerr: Discrepancy in different numbers of colors. Discrete Mathematics 250(1-3): 63-70 (2002)
12		Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz Schoen: On the discrepancy of combinatorial rectangles. Random Struct. Algorithms 21(3-4): 205-215 (2002)
	2001
11		Benjamin Doerr: Structured Randomized Rounding and Coloring. FCT 2001: 461-471
10		Benjamin Doerr: Lattice approximation and linear discrepency of totally unimodular matrices. SODA 2001: 119-125
9		Benjamin Doerr, Anand Srivastav: Recursive Randomized Coloring Beats Fair Dice Random Colorings. STACS 2001: 183-194
8		Geir Agnarsson, Benjamin Doerr, Tomasz Schoen: Coloring t-dimensional m-Boxes. Discrete Mathematics 226(1-3): 21-33 (2001)
7		Benjamin Doerr: Vector Balancing Games with Aging. Electronic Notes in Discrete Mathematics 10: 90-92 (2001)
6		Benjamin Doerr, Anand Srivastav: Multi-Color Discrepancies - Extended Abstract -. Electronic Notes in Discrete Mathematics 7: 78-81 (2001)
5		Benjamin Doerr, Anand Srivastav: Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract. Electronic Notes in Discrete Mathematics 8: 27-30 (2001)
4		Benjamin Doerr: Vector Balancing Games with Aging. J. Comb. Theory, Ser. A 95(2): 219-233 (2001)
	2000
3		Benjamin Doerr: Linear And Hereditary Discrepancy. Combinatorics, Probability & Computing 9(4): 349-354 (2000)
2		Benjamin Doerr: Linear Discrepancy of Basic Totally Unimodular Matrices. Electr. J. Comb. 7: (2000)
	1999
1		Benjamin Doerr, Anand Srivastav: Approximation of Multi-color Discrepancy. RANDOM-APPROX 1999: 39-50

Coauthor Index

1	Geir Agnarsson	[8]
2	Nitin Ahuja	[24] [30] [34] [55]
3	Noga Alon	[12]
4	Spyros Angelopoulos	[78]
5	Tetsuo Asano	[39] [140]
6	Andreas Baltz	[24] [30] [34] [55]
7	Surender Baswana	[85]
8	Somenath Biswas	[85]
9	Süntje Böttcher	[109]
10	Joshua N. Cooper	[57] [59] [71] [90] [100]
11	Anton V. Eremeev	[83] [115]
12	Mahmoud Fouz	[45] [76] [82] [89] [96] [98] [112] [117] [119] [120] [129] [132] [135]
13	Tobias Friedrich	[33] [40] [46] [48] [51] [59] [62] [70] [71] [77] [79] [81] [85] [88] [90] [92] [93] [100] [119] [128] [129]
14	Michael Gnewuch	[32] [43] [65] [91]
15	Leslie Ann Goldberg	[106] [108] [114] [124] [131]
16	Edda Happ	[66] [73] [75] [118] [142]
17	Nils Hebbinghaus	[25] [29] [31] [37] [42] [43] [47] [50] [56] [65]
18	Sebastian Hoffmann	[130]
19	Christian Horoba	[83]
20	Anna Huber	[78] [80] [101]
21	Thomas Jansen	[74] [97] [105] [127]
22	Daniel Johannsen	[64] [68] [72] [94] [95] [107] [110] [111] [113] [126] [130] [137] [138]
23	Naoki Katoh	[39]
24	Christian Klein	[33] [41] [46] [48] [53] [62] [66] [69] [74] [75] [118] [142]
25	Timo Kötzing	[94] [107] [123] [134] [136] [137]
26	Marvin Künnemann	[88] [92] [99] [104] [128] [141]
27	Piyush P. Kurur	[85]
28	Per Kristian Lehre	[94] [137]
29	Johannes Lengler	[52] [61] [123] [134]
30	Ariel Levavi	[80] [101]
31	Tomasz Luczak	[12]
32	Markus Mainberger	[130]
33	Lorenz Minder	[114] [131]
34	Frank Neumann	[42] [50] [56] [65] [67] [83] [85] [102] [103] [107] [109] [115] [116] [130]
35	Ralf Osbild	[33] [46] [48] [62]
36	Konstantinos Panagiotou	[78]
37	Ales Prívetivý	[34] [55]
38	Thomas Sauerwald	[70] [77] [81] [88] [92] [93] [114] [128] [131]
39	Christian Scheideler	[114] [131]
40	Martin Schmidt	[82] [138]
41	Henning Schnieder	[16]
42	Tomasz Schoen	[8] [12]
43	Joel H. Spencer (Joel Spencer)	[57] [59] [71] [90] [100]
44	Anand Srivastav	[1] [5] [6] [9] [18] [24] [26] [30] [32] [34] [55]
45	David Steurer	[52] [61]
46	Tobias Storch	[69]
47	Dirk Sudholt	[67] [97] [105] [116]
48	Ching Hoo Tang	[72] [130]
49	Gábor Tardos	[57]
50	Sachio Teramoto	[39]
51	Madeleine Theile	[83] [84] [107] [115]
52	Christian Thyssen	[115]
53	Markus Wagner	[94] [137]
54	Magnus Wahlström	[82] [87] [91] [99] [104] [141]
55	Ingo Wegener	[103]
56	Petra Wehr	[26]
57	Joachim Weickert	[130]
58	Sören Werth	[25] [29] [31] [37] [47]
59	Carola Winzen	[94] [95] [97] [105] [110] [113] [121] [122] [123] [125] [126] [134] [136] [137] [139] [143] [144] [145]
60	Carsten Witt	[67] [112] [116] [135]
61	Christine Zarges	[97] [105]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page