# All publications in 2011

The following listing contains all publications of the current members of the Algorithm Engineering group in 2011.

You can view all publications of the current members of the Algorithm Engineering group. For other listings, please see:

- years: 2021, 2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010
- researchers: Prof. Dr. Tobias Friedrich, Dr. Katrin Casel, Dr. Sarel Cohen, Dr. Ágnes Cseh, Dr. Andreas Göbel, Dr. Davis Issac, Dr. Timo Kötzing, Dr. Nikhil Kumar, Dr. Pascal Lenzner
- PhD students: Vanja Doskoč, Ziena Elijazyfer, Philipp Fischbeck, Maximilian Katzmann, Simon Krogmann, Gregor Lagodzinski, Anna Melnichenko, Louise Molitor, Stefan Neubert, Francesco Quinzan, Ralf Rothenberger, Martin Schirneck, Karen Seidel, Christopher Weyand
- theory conferences: ICALP, MFCS, SAGT, STACS, STOC, WINE

algorithm conferences: ALENEX, ESA, GD, ISAAC, SODA, SPAA, SWAT, WAW - artificial intelligence conferences: AAAI, AAMAS, ALT, COLT, ECAI, ICAPS, IJCAI, SAT

evolutionary computation conferences: CEC, EMO, EvoCOP, FOGA, GECCO, PPSN

## Conference Publications

2011

- Iterative Learning from Positive Data and Counters. Algorithmic Learning Theory (ALT) 2011: 40-54
- Fast Simulation of Large-Scale Growth Models. Approximation Algorithms for Combinatorial Optimization (APPROX) 2011: 555-566
- Weighted Preferences in Evolutionary Multi-objective Optimization. Australasian Conference on Artificial Intelligence (AUSAI) 2011: 291-300
- The logarithmic hypervolume indicator. Foundations of Genetic Algorithms (FOGA) 2011: 81-92
- Approximating the distribution of fitness over hamming regions. Foundations of Genetic Algorithms (FOGA) 2011: 93-104
- Faster black-box algorithms through higher arity operators. Foundations of Genetic Algorithms (FOGA) 2011: 163-172
- Simple max-min ant systems and the optimization of linear pseudo-boolean functions. Foundations of Genetic Algorithms (FOGA) 2011: 209-218
- Convergence of hypervolume-based archiving algorithms I: effectiveness. Genetic and Evolutionary Computation Conference (GECCO) 2011: 745-752Nominated for Best Paper Award (EMO Track)
- Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis. Genetic and Evolutionary Computation Conference (GECCO) 2011: 973-980
- Black-box complexities of combinatorial problems. Genetic and Evolutionary Computation Conference (GECCO) 2011: 981-988
- How crossover helps in pseudo-boolean optimization. Genetic and Evolutionary Computation Conference (GECCO) 2011: 989-996
- Too fast unbiased black-box algorithms. Genetic and Evolutionary Computation Conference (GECCO) 2011: 2043-2050
- PAC learning and genetic programming. Genetic and Evolutionary Computation Conference (GECCO) 2011: 2091-2096
- Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. International Joint Conference on Artificial Intelligence (IJCAI) 2011: 522-527
- Approximation-Guided Evolutionary Multi-Objective Optimization. International Joint Conference on Artificial Intelligence (IJCAI) 2011: 1198-1203
- Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. International Symposium on Algorithms and Computation (ISAAC) 2011: 190-199
- On Dynamics in Basic Network Creation Games. Symposium on Algorithmic Game Theory (SAGT) 2011: 254-265
- Randomized Diffusion for Indivisible Loads. Symposium on Discrete Algorithms (SODA) 2011: 429-439
- Measuring Learning Complexity with Criteria Epitomizers. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 320-331
- Balanced Interval Coloring. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 531-542
- Social networks spread rumors in sublogarithmic time. Symposium on Theory of Computing (STOC) 2011: 21-30

## Journal Publications

2011

- Average update times for fully-dynamic all-pairs shortest paths. Discrete Applied Mathematics 2011: 1751-1758
- Social Networks Spread Rumors in Sublogarithmic Time. Electronic Notes in Discrete Mathematics 2011: 303-308
- Quasirandom rumor spreading: An experimental analysis. Journal of Experimental Algorithmics 2011
- Smoothed analysis of balancing networks. Random Structures and Algorithms 2011: 115-138
- Illustration of Fairness in Evolutionary Multi-Objective Optimization. Theoretical Computer Science 2011: 1546-1556