# All publications in 2012

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

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

2012

- A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. Conference on Artificial Intelligence (AAAI) 2012
- Enlarging Learnable Classes. Algorithmic Learning Theory (ALT) 2012: 36-50
- Disconnectivity and Relative Positions in Simultaneous Embeddings. Graph Drawing (GD) 2012: 31-42
- Ants easily solve stochastic shortest path problems. Genetic and Evolutionary Computation Conference (GECCO) 2012: 17-24
- Efficient Algorithms for Extracting Biological Key Pathways with Global Constraints. Genetic and Evolutionary Computation Conference (GECCO) 2012: 169-176
- A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. Genetic and Evolutionary Computation Conference (GECCO) 2012: 433-440
- Convergence of hypervolume-based archiving algorithms ii: competitiveness. Genetic and Evolutionary Computation Conference (GECCO) 2012: 457-464
- The max problem revisited: the importance of mutation in genetic programming. Genetic and Evolutionary Computation Conference (GECCO) 2012: 1333-1340
- Parameterized Clique on Scale-Free Networks. International Symposium on Algorithms and Computation (ISAAC) 2012: 659-668
- Experimental Analysis of Rumor Spreading in Social Networks. Mediterranean Conference on Algorithms (MedAlg) 2012: 159-173
- A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. Parallel Problem Solving from Nature (PPSN) 2012: 52-61
- ACO Beats EA on a Dynamic Pseudo-Boolean Function. Parallel Problem Solving from Nature (PPSN) 2012: 113-122
- Deliberative Acceptability of Arguments. Starting AI Researcher Symposium (STAIRS) 2012: 71-82
- Asynchronous Rumor Spreading in Preferential Attachment Graphs. Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2012: 307-315
- Greedy Selfish Network Creation. Web and Internet Economics (WINE) 2012: 142-155

## Journal Publications

2012

- Why rumors spread so quickly in social networks. Communications of the ACM 2012: 70-75
- Learning secrets interactively. Dynamic modeling in inductive inference. Information and Computation 2012: 60-73
- Efficient Key Pathway Mining: Combining Networks and OMICS Data. Integrative Biology 2012: 756-764
- Computability-Theoretic Learning Complexity. Philosophical Transactions of the Royal Society A 2012: 3570-3596
- Quasirandom Load Balancing. SIAM Journal on Computing 2012: 747-771
- Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intelligence 2012: 1-21
- Convergence of Set-Based Multi-Objective Optimization, Indicators and Deteriorative Cycles. Theoretical Computer Science 2012: 2-17
- Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time. Theoretical Computer Science 2012: 58-74
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Theoretical Computer Science 2012: 104-116
- Learning in the limit with lattice-structured hypothesis spaces. Theoretical Computer Science 2012: 111-127