# All Publications

The following listing contains all publications of the current members of the Algorithm Engineering group. Loading the page might take a few seconds depending on your connection. Alternatively, see the shorter list of current publications.

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. 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. Nikhil Kumar, 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

2021

- A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes. Theoretical Computer Science 2021: 121-128
- Optimal Kidney Exchange with Immunosuppressants. Conference on Artificial Intelligence (AAAI) 2021[ BibTeX ]
- Selfish Creation of Social Networks. Conference on Artificial Intelligence (AAAI) 2021
- On weakly and strongly popular rankings. International Conference on Autonomous Agents and Multiagent Systems (AAMAS) 2021[ BibTeX ]
- Multi-Robot Task Allocation—Complexity and Approximation. International Conference on Autonomous Agents and Multiagent Systems (AAMAS) 2021[ BibTeX ]
- Fine-Grained Complexity of Regular Path Queries. International Conference on Database Theory (ICDT) 2021
- The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. Symposium on Discrete Algorithms (SODA) 2021

2020

- The Complexity of Cake Cutting with Unequal Shares. ACM Transactions on Algorithms 2020: 1-21
- Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 2020: 3117-3123
- Greed is Good for Deterministic Scale-Free Networks. Algorithmica 2020: 3338–3389
- Complexity of independency and cliquy trees. Discrete Applied Mathematics 2020: 2-15
- Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. Discrete Applied Mathematics 2020: 23-42
- The stable marriage problem with ties and restricted edges. Discrete Optimization 2020: 100571
- Hyperbolic Embeddings for Near-Optimal Greedy Routing. Journal of Experimental Algorithmics (JEA) 2020
- Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery. Proceedings of the VLDB Endowment 2020: 2270 - 2283
- Parsimonious periodic autoregressive models for time series with evolving trend and seasonality. Statistics and Computing 2020: 77-91
- Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. Theoretical Computer Science 2020: 3-19
- Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming. Theoretical Computer Science 2020: 96--113
- Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax. Theoretical Computer Science 2020: 143-165
- The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time. Theoretical Computer Science 2020: 144--168
- On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory of Computing Systems 2020
- On the Tree Conjecture for the Network Creation Game. Theory of Computing Systems 2020: 422--443
- Significance-based Estimation-of-Distribution Algorithms. Transactions on Evolutionary Computation 2020: 1025-1034
- Theory of Estimation-of-Distribution Algorithms. Theory of Evolutionary Computation: Recent Developments in Discrete Optimization 2020: 405-442
- Cautious Limit Learning. Algorithmic Learning Theory (ALT) 2020: 251-276
- A Constant Factor Approximation for Capacitated Min-Max Tree Cover. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM) 2020: 55:1-55:13
- A Strategic Routing Framework and Algorithms for Computing Alternative Paths. Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) 2020: 10:1--10:14
- ScrabbleGAN: Semi-Supervised Varying Length Handwritten Text Generation. Conference on Computer Vision and Pattern Recognition (CVPR) 2020: 4323-4332
- Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. European Conference on Artificial Intelligence (ECAI) 2020: 435-442
- The Minimization of Random Hypergraphs. European Symposium on Algorithms (ESA) 2020: 21:1-21:15
- Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow. European Symposium on Algorithms (ESA) 2020: 55:1-55:13
- The Univariate Marginal Distribution Algorithm Copes Well With Deception and Epistasis. Evolutionary Computation in Combinatorial Optimisation (EvoCOP) 2020: 51-66Best-Paper Award
- Fair Tree Connection Games with Topology-Dependent Edge Cost. Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2020: 15:1--15:15
- Bivariate Estimation-of-Distribution Algorithms Can Find an Exponential Number of Optima. Genetic and Evolutionary Computation Conference (GECCO) 2020: 796–804
- The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. Genetic and Evolutionary Computation Conference (GECCO) 2020: 1286-1294
- Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation. International Conference on Neural Information Processing (ICONIP) 2020: 592-604
- Flow-Based Network Creation Games. International Joint Conference on Artificial Intelligence (IJCAI) 2020: 139-145
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. Integer Programming and Combinatorial Optimization (IPCO) 2020: 144-157
- Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. International Symposium on Parameterized and Exact Computation (IPEC) 2020
- Multicommodity Flows in Planar Graphs with Demands on Faces. International Symposium on Algorithms and Computation (ISAAC) 2020
- Topological Influence and Locality in Swap Schelling Games. International Symposium on Mathematical Foundations of Computer Science (MFCS) 2020: 15:1--15:15
- Improved Fixed-Budget Results via Drift Analysis. Parallel Problem Solving From Nature (PPSN) 2020: 648-660
- Parallel Machine Scheduling to Minimize Energy Consumption. Symposium on Discrete Algorithms (SODA) 2020: 2758-2769
- Time- and Space-Optimal Clock Synchronization in the Beeping Model. Symposium Parallelism in Algorithms and Architectures (SPAA) 2020
- Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Symposium on the Theoretical Aspects of Computer Science (STACS) 2020: 25:1-25:14
- Distance sensitivity oracles with subcubic preprocessing time and fast query time. Symposium Theory of Computing (STOC) 2020: 1375-1388
- Privacy-Preserving Public Verification of Ethical Cobalt Sourcing. Trust, Security and Privacy in Computing and Communications (TrustCom) 2020
- An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. Workshop on Approximation and Online Algorithms (WAOA) 2020
- New Conditions via Markov Chains: Approximating Partition Functions of Abstract Polymer Models without Cluster Expansion. master's thesis, Hasso Plattner Institute 2020
- Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes. CoRR 2020ArXiv preprint
- Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. CoRR 2020ArXiv preprint
- Learning Half-Spaces and other Concept Classes in the Limit with Iterative Learners. CoRR 2020ArXiv preprint

2019

- Hadwiger's conjecture for squares of 2-trees. European Journal of Combinatorics 2019
- Routing for On-Street Parking Search using Probabilistic Data. AI Communications 2019: 113-124
- Solving Problems with Unknown Solution Length at Almost No Extra Cost. Algorithmica 2019: 703-748
- Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 2019: 828-857
- Island Models Meet Rumor Spreading. Algorithmica 2019: 886-915
- New and Simple Algorithms for Stable Flow Problems. Algorithmica 2019: 2557-2591
- Quasi-random Image Transition and Animation. Australian Journal of Intelligent Information Processing Systems 2019: 10-18
- Selected open problems in Matching Under Preferences. Bulletin of the European Association for Theoretical Computer Science 2019: 14-38
- Detection and estimation of additive outliers in seasonal time series. Computational Statistics 2019: 1-17
- Surfing on the seascape: Adaptation in a changing environment. Evolution: International Journal of Organic Evolution 2019: 1356-1374
- How to Draw a Planarization. Graph Algorithms and Applications 2019: 653-682
- Paths to stable allocations. International Journal of Game Theory 2019: 835-862
- Multiple changepoint detection for periodic autoregressive models with an application to river flow analysis. Stochastic Environmental Research and Risk Assessment 2019: 1137-1157
- Some Problems Concerning the Frobenius Number for Extensions of an Arithmetic Progression. The Ramanujan Journal 2019: 545-565
- Unbiasedness of Estimation-of-Distribution Algorithms. Theoretical Computer Science 2019: 46-59
- First-hitting times under drift. Theoretical Computer Science 2019: 51-69
- The Stable Roommates Problem with Short Lists. Theory of Computing Systems 2019: 128-149
- Greedy Maximization of Functions with Bounded Curvature Under Partition Matroid Constraints. Conference on Artificial Intelligence (AAAI) 2019: 2272-2279
- Pareto Optimization for Subset Selection with Dynamic Cost Constraints. Conference on Artificial Intelligence (AAAI) 2019: 2354-2361
- From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. Autonomous Agents and Multiagent Systems (AAMAS) 2019: 1949-1951
- Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. Algorithm Engineering and Experiments (ALENEX) 2019: 130-143
- Limit Learning Equivalence Structures. Algorithmic Learning Theory (ALT) 2019: 383-403
- Extension of vertex cover and independent set in some classes of graphs and generalizations. International Conference on Algorithms and Complexity (CIAC) 2019: 124-136
- Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. European Symposium on Algorithms (ESA) 2019: 21:2-21:14EATCS Best Paper Award
- Extension of some edge graph problems: standard and parameterized complexity. Fundamentals of Computation Theory (FCT) 2019: 185-200
- Multiplicative Up-Drift. Genetic and Evolutionary Computation Conference (GECCO) 2019
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. International Colloquium on Automata, Languages and Programming (ICALP) 2019: 12:1-12:14
- The Satisfiability Threshold for Non-Uniform Random 2-SAT. International Colloquium on Automata, Languages and Programming (ICALP) 2019: 61:1-61:14
- Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. International Colloquium on Automata, Languages and Programming (ICALP) 2019: 109:1-109:16
- Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. International Conference on Automated Planning and Scheduling (ICAPS) 2019: 541-554
- Sharpness of the Satisfiability Threshold for Non-Uniform Random \(k\)-SAT.International Joint Conference on Artificial Intelligence (IJCAI) 2019: 6151-6155
- Random Subgroups of Rationals. Mathematical Foundations of Computer Science (MFCS) 2019: 25:1-25:14
- Near Optimal Algorithms For The Single Source Replacement Paths Problem. Symposium on Discrete Algorithms (SODA) 2019: 2090-2109
- Geometric Network Creation Games. Symposium on Parallelism in Algorithms and Architectures (SPAA) 2019: 323-332
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity. Symposium Theoretical Aspects of Computer Science (STACS) 2019: 5:1–5:9
- Pairwise Preferences in the Stable Marriage Problem. Symposium Theoretical Aspects of Computer Science (STACS) 2019: 21:1-21:16
- On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. Tools and Algorithms for the Construction and Analysis of Systems (TACAS) 2019: 117-134
- Understanding the Effectiveness of Data Reduction in Public Transportation Networks. Workshop on Algorithms and Models for the Web Graph (WAW) 2019: 87-101
- Convergence and Hardness of Strategic Schelling Segregation. Web and Internet Economics (WINE) 2019: 156-170
- Theoretical Analyses of Univariate Estimation-of-Distribution Algorithms. PhD thesis, Hasso Plattner Institute, University of Potsdam 2019ACM SIGEVO Dissertation Award, Honorable Mention
- FOGA ’19: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. 2019ACM.Editorship
- Theory of Randomized Optimization Heuristics. Dagstuhl Reports 2019: 61-94
- The Minimization of Random Hypergraphs. CoRR 2019ArXiv preprint

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
- 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
- An improved algorithm for online machine minimization. Operations Research Letters 2018: 128-133
- 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
- Confident Iterative Learning in Computational Learning Theory. Current Trends in Theory and Practice of Computer Science (SOFSEM) 2018: 30-42
- Periodic Autoregressive Models with Multiple Structural Changes by Genetic Algorithms. Mathematical and Statistical Methods for Actuarial Sciences and Finance (MAF) 2018: 107-110
- Hyperbolic Embeddings for Near-Optimal Greedy Routing. Algorithm Engineering and Experiments (ALENEX) 2018: 199-208
- Selection of Relevant and Non-Redundant Multivariate Ordinal Patterns for Time Series Classification. Discovery Science (DS) 2018: 224-240
- 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
- Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. International Colloquium on Automata, Languages and Programming (ICALP) 2018: 7:1-7:16
- 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