Publications

Found 4 results
Author Title Type [ Year(Desc)]
Filters: Author is Nils Hebbinghaus  [Clear All Filters]
2008
Friedrich, T., & Hebbinghaus N. (2008).  Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. 693-704.
2009
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.
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.
Friedrich, T., Hebbinghaus N., & Neumann F. (2010).  Plateaus Can Be Harder in Multi-Objective Optimization. Theoretical Computer Science. 411(6), 854-864.