Your search returned the following 80 documents:

80. Approximation Quality of the Hypervolume Indicator
    Karl Bringmann and Tobias Friedrich
    Artificial Intelligence 195: 265–290 p., 2013
    
79. Exact and Efficient Generation of Geometric Random Variates and Random Graphs
    Karl Bringmann and Tobias Friedrich
    In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), Riga, Latvia, 2013, 267-278
    
78. Minimizing maximum (weighted) flow-time on related and unrelated machines
    S Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, and Amit Kumar
    In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), Riga, Latvia, 2013, 13-24
    
77. Parameterized Average-Case Complexity of the Hypervolume Indicator
    Karl Bringmann and Tobias Friedrich
    In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), Amsterdam, The Netherlands, 2013, 575-582
    
76. Speeding Up Many-Objective Optimization by Monte Carlo Approximations
    Karl Bringmann, Tobias Friedrich, Christian Igel, and Thomas Voß
    Artificial Intelligence 204: 22–29 p., 2013
    
75. Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
    Karl Bringmann and Tobias Friedrich
    Theoretical Computer Science 425: 104-116, 2012
    
74. Asynchronous rumor spreading in preferential attachment graphs
    Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, 2012, 307-315
    
73. Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
    Karl Bringmann and Tobias Friedrich
    In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, USA, 2012, 457-464
    
    
72. Efficient algorithms for extracting biological key pathways with global constraints
    Jan Baumbach, Tobias Friedrich, Timo Kötzing, Anton Krohmer, Joachim Müller, and Josch Pauling
    In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, USA, 2012, 169-176
    
71. Efficient key pathway mining: combining networks and OMICS data
    Nicolas Alcaraz, Tobias Friedrich, Timo Kötzing, Anton Krohmer, Joachim Müller, Josch Pauling, and Jan Baumbach
    Integrative Biology 4 (7): 756-764, 2012
    
70. Experimental analysis of rumor spreading in social networks
    Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, Ein Gedi, Israel, 2012, 159-173. Note: To appear
    
69. Quasirandom Load Balancing
    Tobias Friedrich, Martin Gairing, and Thomas Sauerwald
    SIAM Journal on Computing 41 (4): 747-771, 2012
    
68. Weighted preferences in evolutionary multi-objective optimization
    Tobias Friedrich, Trent Kroeger, and Frank Neumann
    International Journal of Machine Learning and Cybernetics Online First: 1-10, 2012
    
67. Why Rumors Spread Fast in Social Networks
    Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    Communications of the ACM 55: 70-75, 2012
    
66. Approximation-guided evolutionary multi-objective optimization
    Karl Bringmann, Tobias Friedrich, Frank Neumann, and Markus Wagner
    In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), Barcelona, Spain, 2011, 1198-1203
    
65. Average Case Parameterized Complexity
    Nikolaos Fountoulakis, Tobias Friedrich, and Danny Hermelin
    . Note: Submitted
    
64. Average update times for fully-dynamic all-pairs shortest paths
    Tobias Friedrich and Nils Hebbinghaus
    Discrete Applied Mathematics 159 (16): 1751-1758, 2011
    
63. Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
    Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, and Frances A. Rosamond
    In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), Barcelona, Spain, 2011, 522-527
    
62. Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
    Karl Bringmann and Tobias Friedrich
    In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 745-752
    
61. Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
    Tobias Friedrich, Thomas Sauerwald, and Alexandre Stauffer
    In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), Yokohama, Japan, 2011, 190-199
    
60. Illustration of fairness in evolutionary multi-objective optimization
    Tobias Friedrich, Christian Horoba, and Frank Neumann
    Theoretical Computer Science 412 (17): 1546-1556, 2011
    
59. Quasirandom Rumor Spreading: An Experimental Analysis
    Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, and Thomas Sauerwald
    ACM Journal of Experimental Algorithmics 16: Article No. 3.3 p., 2011
    
58. Randomized Diffusion for Indivisible Loads
    Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, and Thomas Sauerwald
    In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), San Francisco, CA, 2011, 429-439
    
57. Smoothed analysis of balancing networks
    Tobias Friedrich, Thomas Sauerwald, and Dan Vilenchik
    Random Structures & Algorithms 39 (1): 115-138, 2011
    
56. Social Networks Spread Rumors in Sublogarithmic Time
    Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, San Jose, CA, 2011, 21-30
    
55. Social Networks Spread Rumors in Sublogarithmic Time
    Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, Budapaest, 2011, 303-308
    
54. The Logarithmic Hypervolume Indicator
    Tobias Friedrich, Karl Bringmann, Thomas Voss, and Christian Igel
    In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011, 81-92
    
53. An Efficient Algorithm for Computing Hypervolume Contributions
    Karl Bringmann and Tobias Friedrich
    Evolutionary Computation 18 (3): 383-402, 2010
    
52. Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
    Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
    Evolutionary Computation 18 (4): 617 - 633, 2010
    
51. Approximating the volume of unions and intersections of high-dimensional geometric objects
    Karl Bringmann and Tobias Friedrich
    Computational Geometry 43 (6-7): 601-610, 2010
    
50. Average-case Analysis of Incremental Topological Ordering
    Deepak Ajwani and Tobias Friedrich
    Discrete Applied Mathematics 158 (4): 240-250, 2010
    
49. Deterministic Random Walks on Regular Trees
    Joshua Cooper, Benjamin Doerr, Tobias Friedrich, and Joel Spencer
    Random Structures and Algorithms 37 (3): 353-366, 2010
    
48. Efficient Broadcast on Random Geometric Graphs
    Milan Bradonjić, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, and Alexandre Stauffer
    In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, 2010, 1412-1421
    
47. Plateaus Can Be Harder in Multi-Objective Optimization
    Tobias Friedrich, Nils Hebbinhaus, and Frank Neumann
    Theoretical Computer Science 411 (6): 854-864, 2010
    
46. Quasirandom Load Balancing
    Tobias Friedrich, Martin Gairing, and Thomas Sauerwald
    In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, 2010, 1620-1629
    
45. Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
    Rudolf Berghammer, Tobias Friedrich, and Frank Neumann
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 495-502
    
44. Smoothed Analysis of Balancing Networks
    Tobias Friedrich, Thomas Sauerwald, and Dan Vilenchik
    Random Structures and Algorithms Early View: 1-24, 2010
    
43. The Cover Time of Deterministic Random Walks
    Tobias Friedrich and Thomas Sauerwald
    In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, 2010, 130-139
    
42. The Cover Time of Deterministic Random Walks
    Tobias Friedrich and Thomas Sauerwald
    The Electronic Journal of Combinatorics 17 (1): R167,1-R167,30, 2010
    
41. The Maximum Hypervolume Set Yields Near-optimal Approximation
    Karl Bringmann and Tobias Friedrich
    In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), Portland, USA, 2010, 511-518
    
40. Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
    Karl Bringmann and Tobias Friedrich
    In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Krakow, Poland, 2010, 607-616
    
39. When to Use Bit-Wise Neutrality
    Tobias Friedrich and Frank Neumann
    Natural Computing 9 (1): 283 - 294, 2010. Note: To appear
    
38. Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
    Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
    Evolutionary Computation, 17 (1): 3-19, 2009
    
37. Analysis of Diversity-Preserving Mechanisms for Global Exploration
    Tobias Friedrich, Pietro Oliveto, Dirk Sudholt, and Carsten Witt
    Evolutionary Computation 17 (4): 455-476, 2009
    
36. Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
    Karl Bringmann and Tobias Friedrich
    In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, Nantes, France, 2009, 6-20
    
35. Comparison of Simple Diversity Mechanisms on Plateau Functions
    Tobias Friedrich, Nils Hebbinghaus, and Frank Neumann
    Theoretical Computer Science 410 (26): 2455-2462, 2009
    
34. Computing Single Source Shortest Paths using Single-Objective Fitness Functions
    Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, and Frank Neumann
    In: FOGA'09 : revised selected papers from ACM SIGEVO Foundations of Genetic Algorithms X, Orlando, USA, 2009, 59-66
    
33. Deterministic Random Walks on the Two-Dimensional Grid
    Benjamin Doerr and Tobias Friedrich
    Combinatorics, Probability and Computing 18 (1-2): 123-144, 2009
    
32. Don't be greedy when calculating hypervolume contributions
    Karl Bringmann and Tobias Friedrich
    In: FOGA'09 : revised selected papers from ACM SIGEVO Foundations of Genetic Algorithms X, Orlando, USA, 2009, 103-112
    
31. Multiplicative Approximations and the Hypervolume Indicator
    Tobias Friedrich, Christian Horoba, and Frank Neumann
    In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), Montreal, Canada, 2009, 571-578. Note: Best Paper Award in the track "Evolutionary Multiobjective Optimization"
    
30. Near-Perfect Load Balancing by Randomized Rounding
    Tobias Friedrich and Thomas Sauerwald
    In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, Bethesda, Maryland, USA, 2009, 121-130
    
29. On the Effects of Adding Objectives to Plateau Functions
    Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, and Eckart Zitzler
    IEEE Transactions on Evolutionary Computation 13 (3): 591-603, 2009
    
28. Quasirandom Rumor Spreading on Expanders
    Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
    Electronic Notes in Discrete Mathematics 34: 243 - 247, 2009
    
27. Quasirandom Rumor Spreading: An Experimental Analysis
    Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, and Thomas Sauerwald
    In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), New York, USA, 2009, 145-153
    
26. Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
    Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
    In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, 2009, 366-377
    
25. Smoothed Analysis of Balancing Networks
    Tobias Friedrich, Thomas Sauerwald, and Dan Vilenchik
    In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, 2009, 472-483
    
24. An $O(n^2.75)$ algorithm for incremental topological ordering
    Deepak Ajwani, Tobias Friedrich, and Ulrich Meyer
    ACM Transactions on Algorithms 4 (4): 1-14, 2008
    
23. Analyzing Hypervolume Indicator Based Algorithms
    Dimo Brockhoff, Tobias Friedrich, and Frank Neumann
    In: Parallel Problem Solving from Nature (PPSN X), Dortmund, Germany, 2008, 651-660
    
22. Approximating the volume of unions and intersections of high-dimensional geometric objects.
    Karl Bringmann and Tobias Friedrich
    In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Gold Coast, Australia, 2008, 436-447
    
21. Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
    Tobias Friedrich and Nils Hebbinghaus
    In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Gold Coast, Australia, 2008, 693-704
    
20. Deterministic Random Walks on Regular Trees
    Joshua Cooper, Benjamin Doerr, Tobias Friedrich, and Joel Spencer
    In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, USA, 2008, 766-772
    
19. Quasirandom Rumor Spreading
    Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
    In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, USA, 2008, 773-781
    
18. Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
    Tobias Friedrich, Christian Horoba, and Frank Neumann
    In: Parallel Problem Solving from Nature (PPSN X), Dortmund, Germany, 2008, 671-680
    
17. Theoretical Analysis of Diversity Mechanisms for Global Exploration
    Tobias Friedrich, Pietro Oliveto, Dirk Sudholt, and Carsten Witt
    In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), Atlanta, USA, 2008, 945-952
    
16. When to Use Bit-wise Neutrality
    Tobias Friedrich and Frank Neumann
    In: IEEE Congress on Evolutionary Computation 2008, Hong Kong, 2008, 997-1003
    
15. Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
    Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
    In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 797-804
    
14. Average-Case Analysis of Online Topological Ordering
    Deepak Ajwani and Tobias Friedrich
    In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, Sendai, Japan, 2007, 464-475
    
13. Deterministic Random Walks on Regular Trees
    Joshua Cooper, Benjamin Doerr, Tobias Friedrich, and Joel Spencer
    Electronic Notes in Discrete Mathematics 29: 509-513, 2007
    
12. Do Additional Objectives Make a Problem Harder?
    Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, and Eckart Zitzler
    In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 765-772
    
11. On Improving Approximate Solutions by Evolutionary Algorithms
    Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, Singapore, 2007, 2614-2621
    
10. Plateaus Can Be Harder in Multi-Objective Optimization
    Tobias Friedrich, Nils Hebbinghaus, and Frank Neumann
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, Singapore, 2007, 2622-2629
    
9. Rigorous Analyses of Simple Diversity Mechanisms
   Tobias Friedrich, Nils Hebbinghaus, and Frank Neumann
   In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 1219-1225. Note: nominated for best paper award
   
8. Unbiased Matrix Rounding
   Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
   Electronic Notes in Discrete Mathematics 28: 41-46, 2007
   
7. Use and Avoidance of Randomness
   Tobias Friedrich
   Doctoral dissertation, Universität des Saarlandes, 2007
   
6. An $O(n^2.75)$ algorithm for online topological ordering
   Deepak Ajwani, Tobias Friedrich, and Ulrich Meyer
   In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, 2006, 53-64
   [PDF: Download: 2006SWATofficial_oto.pdf]
   
5. Deterministic Random Walks on the Two-Dimensional Grid
   Benjamin Doerr and Tobias Friedrich
   In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, 2006, 474-483
   [PDF: Download: 2006ISAAC.pdf]
   
4. Quasirandomness in Graphs
   Benjamin Doerr and Tobias Friedrich
   Electronic Notes in Discrete Mathematics 25: 61-64, 2006
   
   
3. Unbiased Matrix Rounding
   Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
   In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, 2006, 102-112
   [PDF: Download: 2006SWATofficial_rounding.pdf]
   
2. Deterministic Random Walks on Infinite Grids
   Tobias Friedrich
   Master's thesis, Friedrich-Schiller-Universität Jena, 2005. Note: Mathematik-Diplomarbeit, eingereicht an der Friedrich-Schiller-Universität Jena
   [PDF: Download: DA.pdf]
   
1. Rounding of Sequences and Matrices, with Applications
   Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
   In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), Palma de Mallorca, Spain, 2005, 96-109
   [PDF: Download: public.pdf] [PDF: Download: final.pdf]