# All publications in 2015

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

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

2015

- Chauhan, Ankit; Rao, B. V. Raghavendra
**Parameterized Analogues of Probabilistic Computation**Conference on Algorithms and Discrete Applied Mathematics (CALDAM) 2015: 181–192 - Bringmann, Karl; Friedrich, Tobias; Klitzke, Patrick
**Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator**Congress on Evolutionary Computation (CEC) 2015: 970–977 - Bläsius, Thomas; Lehmann, Sebastian; Rutter, Ignaz
**Orthogonal Graph Drawing with Inflexible Edges**International Conference on Algorithms and Complexity (CIAC) 2015: 61–73 - Kötzing, Timo; Lissovoi, Andrei; Witt, Carsten
**(1+1) EA on Generalized Dynamic OneMax**Foundations of Genetic Algorithms (FOGA) 2015: 40–51 - Alam, Md. Jawaherul; Bläsius, Thomas; Rutter, Ignaz; Ueckerdt, Torsten; Wolff, Alexander
**Pixel and Voxel Representations of Graphs**Graph Drawing (GD) 2015: 472–486 - Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M.
**Robustness of Ant Colony Optimization to Noise**Genetic and Evolutionary Computation Conference (GECCO) 2015: 17–24Best-Paper Award (ACO/SI Track) - Doerr, Benjamin; Doerr, Carola; Kötzing, Timo
**Solving Problems with Unknown Solution Length at (Almost) No Extra Cost**Genetic and Evolutionary Computation Conference (GECCO) 2015: 831–838 - Doerr, Benjamin; Neumann, Frank; Sutton, Andrew M.
**Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation**Genetic and Evolutionary Computation Conference (GECCO) 2015: 1415–1422 - Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli
**Popular Matchings with Two-Sided Preferences and One-Sided Ties**International Colloquium on Automata, Languages and Programming (ICALP) 2015: 367–379 - Bringmann, Karl; Friedrich, Tobias; Hoefer, Martin; Rothenberger, Ralf; Sauerwald, Thomas
**Ultra-Fast Load Balancing on Scale-Free Networks**International Colloquium on Automata, Languages and Programming (ICALP) 2015: 516–527 - Friedrich, Tobias; Krohmer, Anton
**On the Diameter of Hyperbolic Random Graphs**International Colloquium on Automata, Languages and Programming (ICALP) 2015: 614–625 - Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David
**Counting Homomorphisms to Square-Free Graphs, Modulo 2**International Colloquium on Automata, Languages, and Programming (ICALP) 2015: 642–653 - Friedrich, Tobias; Krohmer, Anton
**Cliques in Hyperbolic Random Graphs**International Conference on Computer Communications (INFOCOM) 2015: 1544–1552 - Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M.
**The Benefit of Recombination in Noisy Evolutionary Search**International Symposium of Algorithms and Computation (ISAAC) 2015: 140–150 - Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, Jannik
**Many-to-one Matchings with Lower Quotas: Algorithms and Complexity**International Symposium Algorithms and Computation (ISAAC) 2015: 176–187 - Friedrich, Tobias; Katzmann, Maximilian; Krohmer, Anton
**Unbounded Discrepancy of Deterministic Random Walks on Grids**International Symposium on Algorithms and Computation (ISAAC) 2015: 212–222 - Cord-Landwehr, Andreas; Lenzner, Pascal
**Network Creation Games: Think Global - Act Local**Mathematical Foundations of Computer Science (MFCS) 2015: 248–260 - Cseh, Ágnes; Manlove, David F.
**Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability**Symposium Algorithmic Game Theory (SAGT) 2015: 15–26 - Rothenberger, Ralf; Grau, Sascha; Rossberg, Michael
**Dominating an s-t-Cut in a Network**Current Trends in Theory and Practice of Computer Science (SOFSEM) 2015: 401–411 - Teibrich, Alexander; Mueller, Stefanie; Guimbretière, François; Kovacs, Robert; Neubert, Stefan; Baudisch, Patrick
**Patching Physical Objects**User Interface Software and Technology (UIST) 2015: 83–91

## Journal Publications

2015

- Friedrich, Tobias; Wagner, Markus
**Seeding the initial population of multi-objective evolutionary algorithms: A computational study**Applied Soft Computing 2015: 223–230 - Bläsius, Thomas; Rutter, Ignaz
**Disconnectivity and relative positions in simultaneous embeddings**Computational Geometry 2015: 459–478 - Parsaei Majd, Leila; Rahimi, Ahad
**On the structure of sequentially Cohen-Macaulay bigraded modules**Czechoslovak Mathematical Journal 2015: 1011–1022 - Friedrich, Tobias; Krohmer, Anton
**Parameterized clique on inhomogeneous random graphs**Discrete Applied Mathematics 2015: 130–138 - Wagner, Markus; Bringmann, Karl; Friedrich, Tobias; Neumann, Frank
**Efficient optimization of many objectives by approximation-guided evolution**European Journal of Operational Research 2015: 465–479 - Friedrich, Tobias; Neumann, Frank; Thyssen, Christian
**Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point**Evolutionary Computation 2015: 131–159 - Chicano, Francisco; Sutton, Andrew M.; Whitley, L. Darrell; Alba, Enrique
**Fitness Probability Distribution of Bit-Flip Mutation**Evolutionary Computation 2015: 217–248 - Friedrich, Tobias; Neumann, Frank
**Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms**Evolutionary Computation 2015: 543–558 - Doerr, Benjamin; Doerr, Carola; Kötzing, Timo
**Unbiased Black-Box Complexities of Jump Functions**Evolutionary Computation 2015: 641–670 - Cohen, Sarel; Fiat, Amos; Hershcovitch, Moshik; Kaplan, Haim
**Minimal indices for predecessor search**Information and Computation 2015: 12–30 - Batra, Sanjit Singh; Kumar, Nikhil; Tripathi, Amitabha
**On a Linear Diophantine Problem Involving the Fibonacci and Lucas Sequences**Integers 2015: A26 - Berenbrink, Petra; Cooper, Colin; Friedetzky, Tom; Friedrich, Tobias; Sauerwald, Thomas
**Randomized diffusion for indivisible loads**Journal of Computer and System Sciences 2015: 159–185 - Friedrich, Tobias; Hercher, Christian
**On the kernel size of clique cover reductions for random intersection graphs**Journal of Discrete Algorithms 2015: 128–136 - Paixão, Tiago; Badkobeh, Golnaz; Barton, Nick H.; Çörüş, Doğan; Dang, Duc-Cuong; Friedrich, Tobias; Lehre, Per Kristian; Sudholt, Dirk; Sutton, Andrew; Trubenová, Barbora
**Toward a unifying framework for evolutionary processes**Journal of Theoretical Biology 2015: 28–43 - Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki
**Counting List Matrix Partitions of Graphs**SIAM Journal on Computing 2015: 1089–1118 - Friedrich, Tobias; He, Jun; Jansen, Thomas; Moraglio, Alberto
**Genetic and Evolutionary Computation**Theoretical Computer Science 2015: 1–2 - Fountoulakis, Nikolaos; Friedrich, Tobias; Hermelin, Danny
**On the average-case complexity of parameterized clique**Theoretical Computer Science 2015: 18–29 - Nguyen, Anh Quang; Sutton, Andrew M.; Neumann, Frank
**Population size matters: Rigorous runtime results for maximizing the hypervolume indicator**Theoretical Computer Science 2015: 24–36 - Freydenberger, Dominik D.; Kötzing, Timo
**Fast Learning of Restricted Regular Expressions and DTDs**Theory of Computing Systems 2015: 1114–1158