# All publications in 2013

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

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

- years: 2023, 2022, 2021, 2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010
- researchers: Prof. Dr. Tobias Friedrich, Dr. Samuel Baguley, Dr. Sarel Cohen, Dr. Andreas Göbel, Dr. Timo Kötzing, Dr. Pascal Lenzner, Dr. Kirill Simonov, Dr. George Skretas
- PhD students: Michelle Döring, Philipp Fischbeck, Jonathan Gadea Harder, Hans Gawendowicz, Merlin de la Haye, Nicolas Klodt, Simon Krogmann, Xiaoyue Sherry Li, Paraskevi Machaira,Nadym Mallek, Stefan Neubert, Aikaterini Niklanovits, Marcus Pappik, Aishwarya Radhakrishnan, Janosch Ruff, Ziena Zeif
- theory conferences: FOCS, 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

2013

- Case, John; Kötzing, Timo
**Topological Separations in Inductive Inference**Algorithmic Learning Theory (ALT) 2013: 128–142 - Wagner, Markus; Friedrich, Tobias
**Efficient parent selection for Approximation-Guided Evolutionary multi-objective optimization**Congress on Evolutionary Computation (CEC) 2013: 1846–1853 - Nallaperuma, Samadhi; Sutton, Andrew M.; Neumann, Frank
**Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem**Congress on Evolutionary Computation (CEC) 2013: 2037–2044 - Nallaperuma, Samadhi; Sutton, Andrew M.; Neumann, Frank
**Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem**Congress on Evolutionary Computation (CEC) 2013: 2045–2052 - Feldmann, Matthias; Kötzing, Timo
**Optimizing expected path lengths with ant colony optimization using fitness proportional update**Foundations of Genetic Algorithms (FOGA) 2013: 65–74 - Bläsius, Thomas; Karrer, Annette; Rutter, Ignaz
**Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices**Graph Drawing (GD) 2013: 220–231 - Biedl, Therese C.; Bläsius, Thomas; Niedermann, Benjamin; Nöllenburg, Martin; Prutkin, Roman; Rutter, Ignaz
**Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings**Graph Drawing (GD) 2013: 460–471 - Benz, Florian; Kötzing, Timo
**An effective heuristic for the smallest grammar problem**Genetic and Evolutionary Computation Conference (GECCO) 2013: 487–494 - Bringmann, Karl; Friedrich, Tobias
**Parameterized average-case complexity of the hypervolume indicator**Genetic and Evolutionary Computation Conference (GECCO) 2013: 575–582Nominated for Best Paper Award (EMO Track) - Anand, S.; Bringmann, Karl; Friedrich, Tobias; Garg, Naveen; Kumar, Amit
**Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines**International Colloquium on Automata, Languages and Programming (ICALP) 2013: 13–24 - Bläsius, Thomas; Rutter, Ignaz; Wagner, Dorothea
**Optimal Orthogonal Graph Drawing with Convex Bend Costs**International Colloquium on Automata, Languages, and Programming (ICALP) 2013: 184–195 - Bringmann, Karl; Friedrich, Tobias
**Exact and Efficient Generation of Geometric Random Variates and Random Graphs**International Colloquium on Automata, Languages, and Programming (ICALP) 2013: 267–278 - Freydenberger, Dominik D.; Kötzing, Timo
**Fast learning of restricted regular expressions and DTDs**International Conference on Database Theory (ICDT) 2013: 45–56 - Angelini, Patrizio; Bläsius, Thomas; Rutter, Ignaz
**Testing Mutual Duality of Planar Graphs**International Symposium on Algorithms and Computation (ISAAC) 2013: 350–360 - Cohen, Sarel; Fiat, Amos; Hershcovitch, Moshik; Kaplan, Haim
**Minimal Indices for Successor Search - (Extended Abstract).**Mathematical Foundations of Computer Science (MFCS) 2013: 278–289 - Bläsius, Thomas; Rutter, Ignaz
**Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems**Symposium on Discrete Algorithms (SODA) 2013: 1030–1043 - Kawald, Bernd; Lenzner, Pascal
**On dynamics in selfish network creation**Symposium on Parallelism in Algorithms and Architectures (SPAA) 2013: 83–92 - Croitoru, Cosmina; Kötzing, Timo
**A Normal Form for Argumentation Frameworks**Theorie and Applications of Formal Argumentation (TAFA) 2013: 32–45 - Bailly, Gilles; Oulasvirta, Antti; Kötzing, Timo; Hoppe, Sabrina
**MenuOptimizer: interactive optimization of menu systems**User Interface Software and Technology (UIST) 2013: 331–342

## Journal Publications

2013

- Friedrich, Tobias; Sauerwald, Thomas; Stauffer, Alexandre
**Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions**Algorithmica 2013: 65–88 - Cseh, Ágnes; Matuschke, Jannik; Skutella, Martin
**Stable Flows over Time**Algorithms 2013: 532–545 - Bringmann, Karl; Friedrich, Tobias; Igel, Christian; Voß, Thomas
**Speeding up many-objective optimization by Monte Carlo approximations**Artificial Intelligence 2013: 22–29 - Bringmann, Karl; Friedrich, Tobias
**Approximation quality of the hypervolume indicator**Artificial Intelligence 2013: 265–290 - Sutton, Andrew M.; Chicano, Francisco; Whitley, L. Darrell
**Fitness Function Distributions over Generalized Search Neighborhoods in the q-ary Hypercube**Evolutionary Computation 2013: 561–590 - Albers, Susanne; Lenzner, Pascal
**On Approximate Nash Equilibria in Network Design**Internet Mathematics 2013: 384–405 - Friedrich, Tobias; Kroeger, Trent; Neumann, Frank
**Weighted preferences in evolutionary multi-objective optimization**Machine Learning and Cybernetics 2013: 139–148 - Friedrich, Tobias; Levine, Lionel
**Fast simulation of large-scale growth models**Random Structures and Algorithms 2013: 185–213 - Vladislavleva, Ekaterina; Friedrich, Tobias; Neumann, Frank; Wagner, Markus
**Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation**Renewable Energy 2013: 236–243 - Koepke, Peter; Räsch, Karen; Schlicht, Philipp
**A minimal Prikry-type forcing for singularizing a measurable cardinal**The Journal of Symbolic Logic 2013: 85–100 - Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo; Neumann, Frank; Theile, Madeleine
**More effective crossover operators for the all-pairs shortest path problem**Theoretical Computer Science 2013: 12–26 - Fellows, Michael R.; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances A.
**Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable**Theoretical Computer Science 2013: 81–89 - Doerr, Benjamin; Kötzing, Timo; Lengler, Johannes; Winzen, Carola
**Black-box complexities of combinatorial problems**Theoretical Computer Science 2013: 84–106 - Case, John; Kötzing, Timo
**Memory-limited non-U-shaped learning with solved open problems**Theoretical Computer Science 2013: 100–123