# All publications in 2018

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

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. Á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, 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

2018

- Hyperbolic Embeddings for Near-Optimal Greedy Routing. Algorithm Engineering and Experiments (ALENEX) 2018: 199-208
- Popular Matchings in Complete Graphs. Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2018: 17:1-17:14
- Escaping Large Deceptive Basins of Attraction with Heavy Mutation Operators. Genetic and Evolutionary Computation Conference (GECCO) 2018: 293-300
- Improving the Run Time of the (1+1) Evolutionary Algorithm with Luby Sequences. Genetic and Evolutionary Computation Conference (GECCO) 2018: 301-308
- Randomized Greedy Algorithms for Covering Problems. Genetic and Evolutionary Computation Conference (GECCO) 2018: 309-315
- Significance-based Estimation-of-Distribution Algorithms. Genetic and Evolutionary Computation Conference (GECCO) 2018: 1483-1490
- Spanning tree congestion and computation of gyori lovasz partition. International Colloquium on Automata, Languages, and Programming (ICALP) 2018
- Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. International Colloquium on Automata, Languages, and Programming (ICALP) 2018: 20:1-20:14
- Resolving Conflicts for Lower-Bounded Clustering. International Symposium on Parameterized and Exact Computation (IPEC) 2018: 23:1-23:14
- Identification of Multiregime Periodic Autoregressive Models by Genetic Algorithms. International Conference on Time Series and Forecasting (ITISE) 2018: 396-407
- EvoCells – A Treemap Layout Algorithm for Evolving Tree Data. 9th International Conference on Information Visualization Theory and Applications (IVAPP) 2018: 273-280
- Algorithms and bounds for very strong rainbow coloring. Latin American Symposium on Theoretical Informatics Conference (LATIN) 2018
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Mathematical Foundations of Computer Science (MFCS) 2018
- Counting Homomorphisms to Trees Modulo a Prime. Mathematical Foundations of Computer Science (MFCS) 2018: 49:1-49:13
- Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming. Parallel Problem Solving From Nature (PPSN) 2018: 42-54
- First-Hitting Times for Finite State Spaces. Parallel Problem Solving From Nature (PPSN) 2018: 79-91
- First-Hitting Times Under Additive Drift. Parallel Problem Solving From Nature (PPSN) 2018: 92-104
- Ring Migration Topology Helps Bypassing Local Optima. Parallel Problem Solving From Nature (PPSN) 2018: 129-140
- Heavy-tailed Mutation Operators in Single-Objective Combinatorial Optimization. Parallel Problem Solving From Nature (PPSN) 2018: 134-145
- Schelling Segregation with Strategic Agents. Symposium on Algorithmic Game Theory (SAGT) 2018
- The Complexity of Cake Cutting with Unequal Shares. Symposium Algorithmic Game Theory (SAGT) 2018: 19-30
- Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. Theory and Applications of Satisfiability Testing (SAT) 2018: 273-291Best Paper Award
- Generalized Periodic Autoregressive Models for Trend and Seasonality Varying Time Series. Scientific Meeting of the Italian Statistical Society (SIS) 2018
- Memory-restricted Routing With Tiled Map Data. Systems, Man, and Cybernetics (SMC) 2018: 3347-3354
- On the Tree Conjecture for the Network Creation Game. Symposium on the Theoretical Aspects of Computer Science (STACS) 2018: 14:1-14:15
- Towards a Systematic Evaluation of Generative Network Models. Workshop on Algorithms and Models for the Web Graph (WAW) 2018: 99-114

## Journal Publications

2018

- Sampling in space restricted settings. Algorithmica 2018: 1439-1458
- Matchings with Lower Quotas: Algorithms and Complexity. Algorithmica 2018: 185-208
- Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. Algorithmica 2018: 1214-1277
- Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. Algorithmica 2018: 1575-1578
- Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables. Algorithmica 2018: 1732-1768
- Cliques in Hyperbolic Random Graphs. Algorithmica 2018: 2324-2344
- Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. Algorithmica 2018: 2517-2550
- De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. Algorithmica 2018: 3397–3427
- Learning from Informants: Relations between Learning Success Criteria. ArXiv 2018: 37ArXiv preprint
- Local and Union Boxicity. Discrete Mathematics 2018: 1307 - 1315
- Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. Journal of Computational Geometry 2018: 27-73
- Statistical and Computational Tradeoff in Genetic Algorithm-Based Estimation. Journal of Statistical Computation and Simulation 2018: 3081-3097
- Popular edges and dominant matchings. Mathematical Programming 2018: 209-229
- On the diameter of hyperbolic random graphs. SIAM Journal on Discrete Mathematics 2018: 1314-1334
- Unbounded Discrepancy of Deterministic Random Walks on Grids. SIAM Journal on Discrete Mathematics 2018: 2441-2452
- The many facets of upper domination. Theoretical Computer Science 2018: 2-25
- Escaping Local Optima Using Crossover with Emergent Diversity. Transactions on Evolutionary Computation 2018: 484-497
- Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. Transactions on Networking 2018: 920-933