| 2009 |
|---|
| 76 | EE | Benjamin Doerr,
Tobias Friedrich,
Marvin Künnemann,
Thomas Sauerwald:
Quasirandom Rumor Spreading: An Experimental Analysis.
ALENEX 2009: 145-153 |
| 75 | EE | Benjamin Doerr,
Magnus Wahlström:
Randomized Rounding in the Presence of a Cardinality Constraint.
ALENEX 2009: 162-174 |
| 74 | EE | Benjamin Doerr,
Tobias Friedrich:
Deterministic Random Walks on the Two-Dimensional Grid.
Combinatorics, Probability & Computing 18(1-2): 123-144 (2009) |
| 2008 |
|---|
| 73 | EE | Benjamin Doerr,
Edda Happ,
Christian Klein:
Crossover can provably be useful in evolutionary computation.
GECCO 2008: 539-546 |
| 72 | EE | Benjamin Doerr,
Thomas Jansen,
Christian Klein:
Comparing global and local mutations on bit strings.
GECCO 2008: 929-936 |
| 71 | EE | Benjamin Doerr,
Edda Happ:
Directed trees: A powerful representation for sorting and ordering problems.
IEEE Congress on Evolutionary Computation 2008: 3606-3613 |
| 70 | EE | Benjamin Doerr,
Daniel Johannsen,
Ching Hoo Tang:
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions.
PPSN 2008: 378-388 |
| 69 | EE | Joshua N. Cooper,
Benjamin Doerr,
Tobias Friedrich,
Joel Spencer:
Deterministic random walks on regular trees.
SODA 2008: 766-772 |
| 68 | EE | Benjamin Doerr,
Tobias Friedrich,
Thomas Sauerwald:
Quasirandom rumor spreading.
SODA 2008: 773-781 |
| 2007 |
|---|
| 67 | EE | Benjamin Doerr,
Christian Klein,
Tobias Storch:
Faster Evolutionary Algorithms by Superior Graph Representation.
FOCI 2007: 245-250 |
| 66 | EE | Benjamin Doerr,
Daniel Johannsen:
Adjacency list matchings: an ideal genotype for cycle covers.
GECCO 2007: 1203-1210 |
| 65 | EE | Benjamin Doerr,
Frank Neumann,
Dirk Sudholt,
Carsten Witt:
On the runtime analysis of the 1-ANT ACO algorithm.
GECCO 2007: 33-40 |
| 64 | EE | 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 |
| 63 | EE | Benjamin Doerr,
Michael Gnewuch,
Nils Hebbinghaus,
Frank Neumann:
A rigorous view on neutrality.
IEEE Congress on Evolutionary Computation 2007: 2591-2597 |
| 62 | EE | Benjamin Doerr,
Daniel Johannsen:
Refined runtime analysis of a basic ant colony optimization algorithm.
IEEE Congress on Evolutionary Computation 2007: 501-507 |
| 61 | EE | Benjamin Doerr:
Randomly Rounding Rationals with Cardinality Constraints and Derandomizations.
STACS 2007: 441-452 |
| 60 | EE | Tobias Friedrich,
Benjamin Doerr,
Christian Klein,
Ralf Osbild:
Unbiased Matrix Rounding.
Electronic Notes in Discrete Mathematics 28: 41-46 (2007) |
| 59 | EE | Benjamin Doerr,
Johannes Lengler,
David Steurer:
The Interval Liar Game.
Electronic Notes in Discrete Mathematics 28: 425-432 (2007) |
| 58 | EE | Benjamin Doerr:
Partial Colorings of Unimodular Hypergraphs.
Electronic Notes in Discrete Mathematics 29: 359-363 (2007) |
| 57 | EE | Joshua N. Cooper,
Benjamin Doerr,
Tobias Friedrich,
Joel Spencer:
Deterministic Random Walks on Regular Trees.
Electronic Notes in Discrete Mathematics 29: 509-513 (2007) |
| 56 | EE | Benjamin Doerr:
Matrix approximation and Tusnády's problem.
Eur. J. Comb. 28(3): 990-995 (2007) |
| 55 | EE | 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) |
| 54 | EE | Benjamin Doerr,
Nils Hebbinghaus,
Frank Neumann:
Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators.
Evolutionary Computation 15(4): 401-410 (2007) |
| 53 | EE | 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) |
| 52 | EE | Benjamin Doerr:
Roundings Respecting Hard Constraints.
Theory Comput. Syst. 40(4): 467-483 (2007) |
| 2006 |
|---|
| 51 | EE | Benjamin Doerr,
Christian Klein:
Unbiased Rounding of Rational Matrices.
FSTTCS 2006: 200-211 |
| 50 | EE | Benjamin Doerr,
Johannes Lengler,
David Steurer:
The Interval Liar Game.
ISAAC 2006: 318-327 |
| 49 | EE | Benjamin Doerr,
Tobias Friedrich:
Deterministic Random Walks on the Two-Dimensional Grid.
ISAAC 2006: 474-483 |
| 48 | EE | Benjamin Doerr,
Nils Hebbinghaus,
Frank Neumann:
Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators.
PPSN 2006: 978-987 |
| 47 | EE | Benjamin Doerr:
Generating Randomized Roundings with Cardinality Constraints and Derandomizations.
STACS 2006: 571-583 |
| 46 | EE | Benjamin Doerr,
Tobias Friedrich,
Christian Klein,
Ralf Osbild:
Unbiased Matrix Rounding.
SWAT 2006: 102-112 |
| 45 | EE | Benjamin Doerr,
Nils Hebbinghaus,
Sören Werth:
Improved Bounds and Schemes for the Declustering Problem
CoRR abs/cs/0603012: (2006) |
| 44 | EE | Benjamin Doerr,
Tobias Friedrich,
Christian Klein,
Ralf Osbild:
Unbiased Matrix Rounding
CoRR abs/cs/0604068: (2006) |
| 43 | EE | Benjamin Doerr,
Mahmoud Fouz:
Hereditary Discrepancies in Different Numbers of Colors II
CoRR abs/cs/0611126: (2006) |
| 42 | EE | Benjamin Doerr:
Non-independent randomized rounding and coloring.
Discrete Applied Mathematics 154(4): 650-659 (2006) |
| 41 | EE | Benjamin Doerr,
Michael Gnewuch,
Nils Hebbinghaus:
Discrepancy of Symmetric Products of Hypergraphs.
Electr. J. Comb. 13(1): (2006) |
| 40 | EE | Nils Hebbinghaus,
Benjamin Doerr,
Frank Neumann:
Speeding up Evolutionary Algorithms by Restricted Mutation Operators.
Electronic Colloquium on Computational Complexity (ECCC) 13(083): (2006) |
| 39 | EE | Benjamin Doerr,
Christian Klein:
Controlled Randomized Rounding.
Electronic Notes in Discrete Mathematics 25: 39-40 (2006) |
| 38 | EE | Benjamin Doerr,
Tobias Friedrich:
Quasirandomness in Graphs.
Electronic Notes in Discrete Mathematics 25: 61-64 (2006) |
| 37 | EE | Sachio Teramoto,
Tetsuo Asano,
Naoki Katoh,
Benjamin Doerr:
Inserting Points Uniformly at Every Instance.
IEICE Transactions 89-D(8): 2348-2356 (2006) |
| 36 | EE | Benjamin Doerr:
Matrix rounding with respect to small submatrices.
Random Struct. Algorithms 28(1): 107-112 (2006) |
| 35 | EE | 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 |
|---|
| 34 | EE | Benjamin Doerr:
Matrix rounding with low error in small submatrices.
SODA 2005: 1067-1068 |
| 33 | EE | Benjamin Doerr:
Roundings Respecting Hard Constraints.
STACS 2005: 617-628 |
| 32 | EE | Nitin Ahuja,
Andreas Baltz,
Benjamin Doerr,
Ales Prívetivý,
Anand Srivastav:
On the Minimum Load Coloring Problem.
WAOA 2005: 15-26 |
| 31 | EE | Benjamin Doerr,
Tobias Friedrich,
Christian Klein,
Ralf Osbild:
Rounding of Sequences and Matrices, with Applications.
WAOA 2005: 96-109 |
| 30 | EE | Benjamin Doerr,
Michael Gnewuch,
Anand Srivastav:
Bounds and constructions for the star-discrepancy via ?-covers.
J. Complexity 21(5): 691-709 (2005) |
| 2004 |
|---|
| 29 | EE | Benjamin Doerr,
Nils Hebbinghaus,
Sören Werth:
Improved Bounds and Schemes for the Declustering Problem.
MFCS 2004: 760-771 |
| 28 | EE | Benjamin Doerr:
Matrix rounding and approximation.
SODA 2004: 575-576 |
| 27 | EE | Benjamin Doerr:
Linear Discrepancy of Totally Unimodular Matrices.
Combinatorica 24(1): 117-125 (2004) |
| 26 | EE | Benjamin Doerr,
Anand Srivastav,
Petra Wehr:
Discrepancy of Cartesian Products of Arithmetic Progressions.
Electr. J. Comb. 11(1): (2004) |
| 25 | EE | Benjamin Doerr,
Nils Hebbinghaus,
Sören Werth:
An Improved Discrepancy Approach to Declustering.
Electronic Notes in Discrete Mathematics 17: 129-133 (2004) |
| 24 | EE | Nitin Ahuja,
Andreas Baltz,
Benjamin Doerr,
Anand Srivastav:
Coloring Graphs with Minimal Edge Load.
Electronic Notes in Discrete Mathematics 17: 9-13 (2004) |
| 23 | EE | Benjamin Doerr:
Global roundings of sequences.
Inf. Process. Lett. 92(3): 113-116 (2004) |
| 22 | EE | Benjamin Doerr:
Nonindependent Randomized Rounding and an Application to Digital Halftoning.
SIAM J. Comput. 34(2): 299-317 (2004) |
| 21 | EE | Benjamin Doerr:
European tenure games.
Theor. Comput. Sci. 303(3): 339-351 (2004) |
| 20 | EE | Benjamin Doerr:
Typical rounding problems.
Theor. Comput. Sci. 312(2-3): 463-477 (2004) |
| 2003 |
|---|
| 19 | EE | 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 | EE | Benjamin Doerr:
Typical Rounding Problems.
APPROX 2002: 81-93 |
| 16 | EE | Benjamin Doerr,
Henning Schnieder:
Non-independent Randomized Rounding and an Application to Digital Halftoning.
ESA 2002: 399-410 |
| 15 | EE | Benjamin Doerr:
Antirandomizing the Wrong Game.
ICALP 2002: 876-887 |
| 14 | EE | Benjamin Doerr:
Balanced Coloring: Equally Easy for All Numbers of Colors?
STACS 2002: 112-120 |
| 13 | EE | Benjamin Doerr:
Discrepancy in different numbers of colors.
Discrete Mathematics 250(1-3): 63-70 (2002) |
| 12 | EE | 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 | EE | Benjamin Doerr:
Structured Randomized Rounding and Coloring.
FCT 2001: 461-471 |
| 10 | EE | Benjamin Doerr:
Lattice approximation and linear discrepency of totally unimodular matrices.
SODA 2001: 119-125 |
| 9 | EE | Benjamin Doerr,
Anand Srivastav:
Recursive Randomized Coloring Beats Fair Dice Random Colorings.
STACS 2001: 183-194 |
| 8 | EE | Geir Agnarsson,
Benjamin Doerr,
Tomasz Schoen:
Coloring t-dimensional m-Boxes.
Discrete Mathematics 226(1-3): 21-33 (2001) |
| 7 | EE | Benjamin Doerr:
Vector Balancing Games with Aging.
Electronic Notes in Discrete Mathematics 10: 90-92 (2001) |
| 6 | EE | Benjamin Doerr,
Anand Srivastav:
Multi-Color Discrepancies - Extended Abstract -.
Electronic Notes in Discrete Mathematics 7: 78-81 (2001) |
| 5 | EE | Benjamin Doerr,
Anand Srivastav:
Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract.
Electronic Notes in Discrete Mathematics 8: 27-30 (2001) |
| 4 | EE | 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): (2000) |
| 2 | EE | 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 |
