Tobias Friedrich

2009
32	EE	Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald: Quasirandom Rumor Spreading: An Experimental Analysis. ALENEX 2009: 145-153
31	EE	Karl Bringmann, Tobias Friedrich: Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice. EMO 2009: 6-20
30	EE	Benjamin Doerr, Tobias Friedrich: Deterministic Random Walks on the Two-Dimensional Grid. Combinatorics, Probability & Computing 18(1-2): 123-144 (2009)
2008
29	EE	Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudholt, Carsten Witt: Theoretical analysis of diversity mechanisms for global exploration. GECCO 2008: 945-952
28	EE	Tobias Friedrich, Frank Neumann: When to use bit-wise neutrality. IEEE Congress on Evolutionary Computation 2008: 997-1003
27	EE	Karl Bringmann, Tobias Friedrich: Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. ISAAC 2008: 436-447
26	EE	Tobias Friedrich, Nils Hebbinghaus: Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. ISAAC 2008: 692-703
25	EE	Dimo Brockhoff, Tobias Friedrich, Frank Neumann: Analyzing Hypervolume Indicator Based Algorithms. PPSN 2008: 651-660
24	EE	Tobias Friedrich, Christian Horoba, Frank Neumann: Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. PPSN 2008: 671-680
23	EE	Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic random walks on regular trees. SODA 2008: 766-772
22	EE	Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald: Quasirandom rumor spreading. SODA 2008: 773-781
21	EE	Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n2.75) algorithm for incremental topological ordering. ACM Transactions on Algorithms 4(4): (2008)
20	EE	Deepak Ajwani, Tobias Friedrich: Average-Case Analysis of Online Topological Ordering CoRR abs/0802.1059: (2008)
19	EE	Karl Bringmann, Tobias Friedrich: Approximating the volume of unions and intersections of high-dimensional geometric objects CoRR abs/0809.0835: (2008)
18	EE	Karl Bringmann, Tobias Friedrich: Approximating the least hypervolume contributor: NP-hard in general, but fast in practice CoRR abs/0812.2636: (2008)
2007
17	EE	Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Rigorous analyses of simple diversity mechanisms. GECCO 2007: 1219-1225
16	EE	Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler: Do additional objectives make a problem harder? GECCO 2007: 765-772
15	EE	Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt: Approximating covering problems by randomized search heuristics using multi-objective models. GECCO 2007: 797-804
14	EE	Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: On improving approximate solutions by evolutionary algorithms. IEEE Congress on Evolutionary Computation 2007: 2614-2621
13	EE	Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Plateaus can be harder in multi-objective optimization. IEEE Congress on Evolutionary Computation 2007: 2622-2629
12	EE	Deepak Ajwani, Tobias Friedrich: Average-Case Analysis of Online Topological Ordering. ISAAC 2007: 464-475
11	EE	Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Electronic Colloquium on Computational Complexity (ECCC) 14(027): (2007)
10	EE	Tobias Friedrich, Benjamin Doerr, Christian Klein, Ralf Osbild: Unbiased Matrix Rounding. Electronic Notes in Discrete Mathematics 28: 41-46 (2007)
9	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)
2006
8	EE	Benjamin Doerr, Tobias Friedrich: Deterministic Random Walks on the Two-Dimensional Grid. ISAAC 2006: 474-483
7	EE	Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild: Unbiased Matrix Rounding. SWAT 2006: 102-112
6	EE	Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n2.75) Algorithm for Online Topological Ordering. SWAT 2006: 53-64
5	EE	Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n2.75) algorithm for online topological ordering CoRR abs/cs/0602073: (2006)
4	EE	Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild: Unbiased Matrix Rounding CoRR abs/cs/0604068: (2006)
3	EE	Benjamin Doerr, Tobias Friedrich: Quasirandomness in Graphs. Electronic Notes in Discrete Mathematics 25: 61-64 (2006)
2	EE	Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n2.75) algorithm for online topological ordering. Electronic Notes in Discrete Mathematics 25: 7-12 (2006)
2005
1	EE	Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild: Rounding of Sequences and Matrices, with Applications. WAOA 2005: 96-109

Coauthor Index

1	Deepak Ajwani	[2] [5] [6] [12] [20] [21]
2	Karl Bringmann	[18] [19] [27] [31]
3	Dimo Brockhoff	[16] [25]
4	Joshua N. Cooper	[9] [23]
5	Benjamin Doerr	[1] [3] [4] [7] [8] [9] [10] [22] [23] [30] [32]
6	Jun He	[11] [14] [15]
7	Nils Hebbinghaus	[11] [13] [14] [15] [16] [17] [26]
8	Christian Horoba	[24]
9	Christian Klein	[1] [4] [7] [10] [16]
10	Marvin Künnemann	[32]
11	Ulrich Meyer	[2] [5] [6] [21]
12	Frank Neumann	[11] [13] [14] [15] [16] [17] [24] [25] [28]
13	Pietro Simone Oliveto	[29]
14	Ralf Osbild	[1] [4] [7] [10]
15	Thomas Sauerwald	[22] [32]
16	Joel H. Spencer (Joel Spencer)	[9] [23]
17	Dirk Sudholt	[29]
18	Carsten Witt	[11] [14] [15] [29]
19	Eckart Zitzler	[16]

Colors in the list of coauthors