Publications
]
(2010). Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models.
Evolutionary Computation. 18(4), 617-633.
(2010). Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects.
Computational Geometry. 43(6-7), 601-610.
(2010). Average-Case Analysis of Incremental Topological Ordering.
Discrete Applied Mathematics. 158(4), 240-250.
(2010). Efficient Broadcast on Random Geometric Graphs.
1412-1421.
(2010). Plateaus Can Be Harder in Multi-Objective Optimization.
Theoretical Computer Science. 411(6), 854-864.
(2010). Quasirandom Load Balancing.
1620-1629.
(2010). Smoothed Analysis of Balancing Networks.
In Random Structures and Algorithms. 39(1), 115-138.
(2010). When to Use Bit-Wise Neutrality.
Natural Computing. 9(1), 283-294.
(2009). Analysis of Diversity-Preserving Mechanisms for Global Exploration.
Evolutionary Computation. 17(4), 455-476.
(2009). Approximating the Least Hypervolume Contributor : NP-Hard in General, but Fast in Practice.
6-20.
(2009). Dont Be Greedy When Calculating Hypervolume Contributions..
103-112.
(2009). On the Effects of Adding Objectives to Plateau Functions.
IEEE Transactions on Evolutionary Computation. 13(3), 591-603.
(2009). Multiplicative Approximations and the Hypervolume Indicator.
571-578.
(2009). Near-Perfect Load Balancing by Randomized Rounding.
121-130.
(2009). Quasirandom Rumor Spreading: An Experimental Analysis.
145-153.
(2009). Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness.
366-377.
(2009). Smoothed Analysis of Balancing Networks.
472-483.