# All publications in 2010

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

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

- years: 2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010
- researchers: Prof. Dr. Tobias Friedrich, Dr. Thomas Bläsius, Dr. Katrin Casel, Dr. Sarel Cohen, Dr. Ágnes Cseh, Dr. Andreas Göbel, Dr. Davis Issac, Dr. Timo Kötzing, Dr. Martin Krejca, Dr. Pascal Lenzner
- PhD students: Vanja Doskoč, Ziena Elijazyfer, Philipp Fischbeck, Maximilian Katzmann, Ardalan Khazraei, 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

2010

- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations. Algorithmic Learning Theory (ALT) 2010: 285-299
- Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. International Conference on Swarm Intelligence (ANTS) 2010: 324-335
- The Cover Time of Deterministic Random Walks. Computing and Combinatorics Conference (COCOON) 2010: 130-139
- Strongly Non-U-Shaped Learning Results by General Techniques. Conference On Learning Theory (COLT) 2010: 181-193
- RatFish: A File Sharing Protocol Provably Secure against Rational Users. European Symposium on Research in Computer Security (ESORICS) 2010: 607-625
- Orthogonal Graph Drawing with Flexibility Constraints. Graph Drawing (GD) 2010: 92-104
- Set-based multi-objective optimization, indicators, and deteriorative cycles. Genetic and Evolutionary Computation Conference (GECCO) 2010: 495-502
- The maximum hypervolume set yields near-optimal approximation. Genetic and Evolutionary Computation Conference (GECCO) 2010: 511-518Best Paper Award (EMO Track)
- Ant colony optimization and the minimum cut problem. Genetic and Evolutionary Computation Conference (GECCO) 2010: 1393-1400
- Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary study. Genetic and Evolutionary Computation Conference (GECCO) 2010: 1975-1978
- String Extension Learning Using Lattices. Language and Automata Theory and Applications (LATA) 2010: 380-391
- More Effective Crossover Operators for the All-Pairs Shortest Path Problem. Parallel Problem Solving from Nature (PPSN) 2010: 184-193
- Tight Bounds for the Approximation Ratio of the Hypervolume Indicator. Parallel Problem Solving from Nature (PPSN) 2010: 607-616
- Directed Plateau Search for MAX-k-SAT. Symposium on Combinatorial Search (SOCS) 2010
- Efficient Broadcast on Random Geometric Graphs. Symposium on Discrete Algorithms (SODA) 2010: 1412-1421
- Quasirandom Load Balancing. Symposium on Discrete Algorithms (SODA) 2010: 1620-1629
- On Approximate Nash Equilibria in Network Design. Web and Internet Economics (WINE) 2010: 14-25

## Journal Publications

2010

- Approximating the volume of unions and intersections of high-dimensional geometric objects. Computational Geometry 2010: 601-610
- Average-case analysis of incremental topological ordering. Discrete Applied Mathematics 2010: 240-250
- The Cover Time of Deterministic Random Walks. Electronic Journal of Combinatorics 2010
- An Efficient Algorithm for Computing Hypervolume Contributions. Evolutionary Computation 2010: 383-402
- Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Evolutionary Computation 2010: 617-633
- When to use bit-wise neutrality. Natural Computing 2010: 283-294
- Deterministic random walks on regular trees. Random Structures and Algorithms 2010: 353-366
- Plateaus can be harder in Multi-Objective Optimization. Theoretical Computer Science 2010: 854-864