Search the dblp DataBase

Publications of Author

1. Benjamin Doerr, Tobias Friedrich
   Deterministic Random Walks on the Two-Dimensional Grid. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2006, pp:474-483 [Conf]
   
2. Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
   An O(n^2.75) Algorithm for Online Topological Ordering. [Citation Graph (0, 0)][DBLP]
   SWAT, 2006, pp:53-64 [Conf]
   
3. Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
   Unbiased Matrix Rounding. [Citation Graph (0, 0)][DBLP]
   SWAT, 2006, pp:102-112 [Conf]
   
4. Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
   Rounding of Sequences and Matrices, with Applications. [Citation Graph (0, 0)][DBLP]
   WAOA, 2005, pp:96-109 [Conf]
   
5. Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
   Rigorous analyses of simple diversity mechanisms. [Citation Graph (0, 0)][DBLP]
   GECCO, 2007, pp:1219-1225 [Conf]
   
6. Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler
   Do additional objectives make a problem harder? [Citation Graph (0, 0)][DBLP]
   GECCO, 2007, pp:765-772 [Conf]
   
7. Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt
   Approximating covering problems by randomized search heuristics using multi-objective models. [Citation Graph (0, 0)][DBLP]
   GECCO, 2007, pp:797-804 [Conf]
   
8. Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
   An O(n^2.75) algorithm for online topological ordering [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
9. Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
   Unbiased Matrix Rounding [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
10. 
    Quasirandom Rumor Spreading: An Experimental Analysis. [Citation Graph (, )][DBLP]
    
    
11. 
    The Cover Time of Deterministic Random Walks. [Citation Graph (, )][DBLP]
    
    
12. 
    Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice. [Citation Graph (, )][DBLP]
    
    
13. 
    Theoretical analysis of diversity mechanisms for global exploration. [Citation Graph (, )][DBLP]
    
    
14. 
    Multiplicative approximations and the hypervolume indicator. [Citation Graph (, )][DBLP]
    
    
15. 
    Set-based multi-objective optimization, indicators, and deteriorative cycles. [Citation Graph (, )][DBLP]
    
    
16. 
    The maximum hypervolume set yields near-optimal approximation. [Citation Graph (, )][DBLP]
    
    
17. 
    Foundations of evolutionary multi-objective optimization. [Citation Graph (, )][DBLP]
    
    
18. 
    Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary study. [Citation Graph (, )][DBLP]
    
    
19. 
    Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. [Citation Graph (, )][DBLP]
    
    
20. 
    Smoothed Analysis of Balancing Networks. [Citation Graph (, )][DBLP]
    
    
21. 
    Average-Case Analysis of Online Topological Ordering. [Citation Graph (, )][DBLP]
    
    
22. 
    Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. [Citation Graph (, )][DBLP]
    
    
23. 
    Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. [Citation Graph (, )][DBLP]
    
    
24. 
    Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. [Citation Graph (, )][DBLP]
    
    
25. 
    Analyzing Hypervolume Indicator Based Algorithms. [Citation Graph (, )][DBLP]
    
    
26. 
    Tight Bounds for the Approximation Ratio of the Hypervolume Indicator. [Citation Graph (, )][DBLP]
    
    
27. 
    Deterministic random walks on regular trees. [Citation Graph (, )][DBLP]
    
    
28. 
    Quasirandom rumor spreading. [Citation Graph (, )][DBLP]
    
    
29. 
    Quasirandom Load Balancing. [Citation Graph (, )][DBLP]
    
    
30. 
    Efficient Broadcast on Random Geometric Graphs. [Citation Graph (, )][DBLP]
    
    
31. 
    Near-perfect load balancing by randomized rounding. [Citation Graph (, )][DBLP]
    
    
32. 
    Plateaus can be harder in multi-objective optimization. [Citation Graph (, )][DBLP]
    
    
33. 
    On improving approximate solutions by evolutionary algorithms. [Citation Graph (, )][DBLP]
    
    
34. 
    When to use bit-wise neutrality. [Citation Graph (, )][DBLP]
    
    
35. 
    Subband conversion for feature extraction from compressed audio. [Citation Graph (, )][DBLP]
    
    
36. 
    Approximating the volume of unions and intersections of high-dimensional geometric objects. [Citation Graph (, )][DBLP]
    
    
37. 
    Average-Case Analysis of Online Topological Ordering [Citation Graph (, )][DBLP]
    
    
38. 
    Approximating the volume of unions and intersections of high-dimensional geometric objects [Citation Graph (, )][DBLP]
    
    
39. 
    Approximating the least hypervolume contributor: NP-hard in general, but fast in practice [Citation Graph (, )][DBLP]
    
    
40. 
    Smoothed Analysis of Balancing Networks [Citation Graph (, )][DBLP]
    
    
41. 
    Quasirandom Load Balancing [Citation Graph (, )][DBLP]
    
    
42. 
    The Cover Time of Deterministic Random Walks [Citation Graph (, )][DBLP]
    
    
43. 
    Fast simulation of large-scale growth models [Citation Graph (, )][DBLP]
    
    
44. 
    Deterministic Random Walks on Regular Trees [Citation Graph (, )][DBLP]
    
    
45. 
    Deterministic Random Walks on the Two-Dimensional Grid. [Citation Graph (, )][DBLP]
    
    
46. 
    Average-case analysis of incremental topological ordering. [Citation Graph (, )][DBLP]
    
    
47. 
    Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. [Citation Graph (, )][DBLP]
    
    
48. 
    Analysis of Diversity-Preserving Mechanisms for Global Exploration. [Citation Graph (, )][DBLP]
    
    
49. 
    Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. [Citation Graph (, )][DBLP]