Publications

Found 20 results
Author Title Type [ Year(Desc)]
Filters: Author is Tobias Friedrich  [Clear All Filters]
2008
Bringmann, K., & Friedrich T. (2008).  Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. 436-447.
Friedrich, T., & Hebbinghaus N. (2008).  Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. 693-704.
2009
Friedrich, T., Oliveto P.. S., Sudholt D., & Witt C. (2009).  Analysis of Diversity-Preserving Mechanisms for Global Exploration. Evolutionary Computation. 17(4), 455-476.
Bringmann, K., & Friedrich T. (2009).  Approximating the Least Hypervolume Contributor : NP-Hard in General, but Fast in Practice. 6-20.
Baswana, S., Biswas S., Doerr B., Friedrich T., Kurur P., & Neumann F. (2009).  Computing Single Source Shortest Paths Using Single-Objective Fitness Functions. 59-66.
Bringmann, K., & Friedrich T. (2009).  Don’t Be Greedy When Calculating Hypervolume Contributions.. 103-112.
Brockhoff, D.., Friedrich T., Hebbinghaus N., Klein C.., Neumann F., & Zitzler E.. (2009).  On the Effects of Adding Objectives to Plateau Functions. IEEE Transactions on Evolutionary Computation. 13(3), 591-603.
Friedrich, T., Horoba C., & Neumann F. (2009).  Multiplicative Approximations and the Hypervolume Indicator. 571-578.
Friedrich, T., & Sauerwald T. (2009).  Near-Perfect Load Balancing by Randomized Rounding. 121-130.
Doerr, B., Friedrich T., Künneman M.., & Sauerwald T. (2009).  Quasirandom Rumor Spreading: An Experimental Analysis. 145-153.
Doerr, B., Friedrich T., & Sauerwald T. (2009).  Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. 366-377.
Friedrich, T., Sauerwald T., & Vilenchik D. (2009).  Smoothed Analysis of Balancing Networks. 472-483.
2010
Friedrich, T., He J., Hebbinghaus N., Neumann F., & Witt C. (2010).  Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models. Evolutionary Computation. 18(4), 617-633.
Bringmann, K., & Friedrich T. (2010).  Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. Computational Geometry. 43(6-7), 601-610.
Ajwani, D.., & Friedrich T. (2010).  Average-Case Analysis of Incremental Topological Ordering. Discrete Applied Mathematics. 158(4), 240-250.
Bradonjic, M.., Elsässer R., Friedrich T., Sauerwald T., & Stauffer A. (2010).  Efficient Broadcast on Random Geometric Graphs. 1412-1421.
Friedrich, T., Hebbinghaus N., & Neumann F. (2010).  Plateaus Can Be Harder in Multi-Objective Optimization. Theoretical Computer Science. 411(6), 854-864.
Friedrich, T., Gairing M., & Sauerwald T. (2010).  Quasirandom Load Balancing. 1620-1629.
Friedrich, T., Sauerwald T., & Vilenchik D. (2010).  Smoothed Analysis of Balancing Networks. In Random Structures and Algorithms. 39(1), 115-138.
Friedrich, T., & Neumann F. (2010).  When to Use Bit-Wise Neutrality. Natural Computing. 9(1), 283-294.