dblp.uni-trier.dewww.uni-trier.de

Tobias Friedrich

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

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

Coauthor Index

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

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)