# 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. 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. Katrin Casel, Dr. Sarel Cohen, Dr. Andreas Göbel, Dr. Davis Issac, Dr. Timo Kötzing, Dr. Nikhil Kumar, Dr. Pascal Lenzner, Dr. Ralf Rothenberger, Dr. Kirill Simonov, Dr. George Skretas
- PhD students: Vanja Doskoč, Philipp Fischbeck, Hans Gawendowicz, Maximilian Katzmann, Nicolas Klodt, Simon Krogmann, Gregor Lagodzinski, Xiaoyue Sherry Li, Louise Molitor, Stefan Neubert, Aikaterini Niklanovits, Marcus Pappik, Leila Parsaei-Majd, Francesco Quinzan, Aishwarya Radhakrishnan, Ziena Zeif
- 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

2023

- Bläsius, Thomas; Friedrich, Tobias; Krejca, Martin S.; Molitor, Louise
**The Impact of Geometry on Monochrome Regions in the Flip Schelling Process**Computational Geometry (CGTA) 2023: 101902 - Friedrich, Tobias; Göbel, Andreas; Krejca, Martin S.; Pappik, Marcus
**Polymer Dynamics via Cliques: New Conditions for Approximations**Theoretical Computer Science 2023 - Krogmann, Simon; Lenzner, Pascal; Skopalik, Alexander
**Strategic Facility Location with Clients that Minimize Total Waiting Time**Conference on Artificial Intelligence (AAAI) 2023 - Böther, Maximilian; Kißig, Otto; Weyand, Christopher
**Efficiently Computing Directed Minimum Spanning Trees**SIAM Symposium on Algorithm Engineering and Experiments (ALENEX) 2023 - Casel, Katrin; Dierking, Jessica; Dunker, Rebekka; Egbert, Julian; Fischbeck, Philipp; Friedrich, Tobias; Helms, Christian; Isaac, Davis; Khomutovskiy, Ivan; Krogmann, Simon; Lenzner, Pascal; Schöllkopf, Finn
**Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm**SIAM Symposium on Algorithm Engineering and Experiments (ALENEX) 2023

2022

- Hacker, Philipp; Naumann, Felix; Friedrich, Tobias; Grundmann, Stefan; Lehmann, Anja
**AI Compliance - Challenges of Bridging Data Science and Law**ACM Journal of Data and Information Quality 2022 - Bläsius, Thomas; Freiberger, Cedric; Friedrich, Tobias; Katzmann, Maximilian; Montenegro-Retana, Felix; Thieffry, Marianne
**Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry**ACM Transactions on Algorithms 2022: 1–32 - Bilò, Davide; Bilò, Vittorio; Lenzner, Pascal; Molitor, Louise
**Topological Influence and Locality in Swap Schelling Games**Autonomous Agents and Multi-Agent Systems (AGNT) 2022: 47 - Casel, Katrin; Fischbeck, Philipp; Friedrich, Tobias; Göbel, Andreas; Lagodzinski, J. A. Gregor
**Zeros and approximations of Holant polynomials on the complex plane**Computational Complexity 2022: 11 - Casel, Katrin; Fernau, Henning; Grigoriev, Alexander; Schmid, Markus L.; Whitesides, Sue
**Combinatorial Properties and Recognition of Unit Square Visibility Graphs**Discrete & Computational Geometry 2022 - Bläsius, Thomas; Friedrich, Tobias; Lischeid, Julius; Meeks, Kitty; Schirneck, Martin
**Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling**Journal of Computer and System Sciences 2022: 192–213 - Friedrich, Tobias; Göbel, Andreas; Krejca, Martin S.; Pappik, Marcus
**A Spectral Independence View on Hard Spheres via Block Dynamics**SIAM Journal on Discrete Mathematics 2022: 2282–2322 - Bläsius, Thomas; Friedrich, Tobias; Schirneck, Martin
**The Complexity of Dependency Detection and Discovery in Relational Databases**Theoretical Computer Science 2022: 79–96 - Bandyapadhyay, Sayan; Fomin, Fedor V.; Golovach, Petr A.; Lochet, William; Purohit, Nidhi; Simonov, Kirill
**How to Find a Good Explanation for Clustering?**Conference on Artificial Intelligence (AAAI) 2022: 3904–3912 - Cseh, Ágnes; Peters, Jannik
**Three-Dimensional Popular Matching with Cyclic Preferences**Autonomous Agents and Multi-Agent Systems (AAMAS) 2022: 77–87 - Berenbrink, Petra; Hoefer, Martin; Kaaser, Dominik; Lenzner, Pascal; Rau, Malin; Schmand, Daniel
**Asynchronous Opinion Dynamics in Social Networks**Autonomous Agents and Multi-Agent Systems (AAMAS) 2022: 109–117 - Cseh, Ágnes; Friedrich, Tobias; Peters, Jannik
**Pareto Optimal and Popular House Allocation with Lower and Upper Quotas**Autonomous Agents and Multi-Agent Systems (AAMAS) 2022: 300–308 - Bläsius, Thomas; Friedrich, Tobias; Stangl, David; Weyand, Christopher
**An Efficient Branch-and-Bound Solver for Hitting Set**Algorithm Engineering and Experiments (ALENEX) 2022 - Friedrich, Tobias; Issac, Davis; Kumar, Nikhil; Mallek, Nadym; Zeif, Ziena
**A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs**Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2022: 55:1–55:18 - Doskoč, Vanja; Kötzing, Timo
**Maps of Restrictions for Behaviourally Correct Learning**Computability in Europe (CiE) 2022: 103–114 - Friedrich, Tobias; Göbel, Andreas; Katzmann, Maximilian; Krejca, Martin S.; Pappik, Marcus
**Algorithms for hard-constraint point processes via discretization**International Computing and Combinatorics Conference (COCOON) 2022 - Hildebrandt, Philipp; Schulze, Maximilian; Cohen, Sarel; Doskoč, Vanja; Saabni, Raid; Friedrich, Tobias
**Optical Character Recognition Guided Image Super Resolution**Symposium on Document Engineering (DocEng) 2022: 1–4 - Führlich, Pascal; Cseh, Ágnes; Lenzner, Pascal
**Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments**ACM Conference on Economics and Computation (EC) 2022: 1101–1102 - Bläsius, Thomas; Fischbeck, Philipp
**On the External Validity of Average-Case Analyses of Graph Algorithms**European Symposium on Algorithms (ESA) 2022: 21:1–21:14 - Kumar, Nikhil
**An Approximate Generalization of the Okamura-Seymour Theorem**Symposium on Foundations of Computer Science (FOCS) 2022 - Angrick, Sebastian; Bals, Ben; Hastrich, Niko; Kleissl, Maximilian; Schmidt, Jonas; Doskoč, Vanja; Katzmann, Maximilian; Molitor, Louise; Friedrich, Tobias
**Towards Explainable Real Estate Valuation via Evolutionary Algorithms**Genetic and Evolutionary Computation Conference (GECCO) 2022: 1130–1138 - Baguley, Samuel; Friedrich, Tobias; Timo, Kötzing; Li, Xiaoyue; Pappik, Marcus; Zeif, Ziena
**Analysis of a Gray-Box Operator for Vertex Cover**Genetic and Evolutionary Computation Conference (GECCO) 2022: 1363–1371 - Friedrich, Tobias; Kötzing, Timo; Radhakrishnan, Aishwarya; Schiller, Leon; Schirneck, Martin; Tennigkeit, Georg; Wietheger, Simon
**Crossover for Cardinality Constrained Optimization**Genetic and Evolutionary Computation Conference (GECCO) 2022: 1399–1407Best Paper Award (Theory Track) - Wood, Andrew; Hershcovitch, Moshik; Ennmouri, Ilias; Zong, Weiyu; Chennuri, Saurav; Cohen, Sarel; Sundararaman, Swaminathan; Waddington, Daniel; Chin, Peter
**Towards Fast Crash-Consistent Cluster Checkpointing**High Performance Extreme Computing Conference (HPEC) 2022 - Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Melnichenko, Anna
**Social Distancing Network Creation**International Colloquium on Automata, Languages and Programming (ICALP) 2022: 62:1–62:21 - Bilò, Davide; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Schirneck, Martin
**Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances**International Colloquium on Automata, Languages and Programming (ICALP) 2022: 68:1–68:19 - Böther, Maximilian; Kißig, Otto; Taraz, Martin; Cohen, Sarel; Seidel, Karen; Friedrich, Tobias
**What’s Wrong with Deep Learning in Tree Search for Combinatorial Optimization**International Conference on Learning Representations (ICLR) 2022 - Bilò, Davide; Bilò, Vittorio; Lenzner, Pascal; Molitor, Louise
**Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games**International Joint Conference on Artificial Intelligence (IJCAI) 2022: 81–87 - Bullinger, Martin; Lenzner, Pascal; Melnichenko, Anna
**Network Creation with Homophilic Agents**International Joint Conference on Artificial Intelligence (IJCAI) 2022: 151–157 - Bilò, Davide; Casel, Katrin; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Lagodzinski, J.A. Gregor; Schirneck, Martin; Wietheger, Simon
**Fixed-Parameter Sensitivity Oracles**Innovations in Theoretical Computer Science (ITCS) 2022: 23:1–23:18 - Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Rajabi, Amirhossein
**Escaping Local Optima With Local Search: A Theory-Driven Discussion**Parallel Problem Solving from Nature (PPSN) 2022: 442–455Best Paper Award and Best Poster Award - Friedrich, Tobias; Kötzing, Timo; Neumann, Frank; Radhakrishnan, Aishwarya
**Theoretical Study of Optimizing Rugge Landscapes with the cGA**Parallel Problem Solving From Nature (PPSN) 2022: 586–599 - Bläsius, Thomas; Fischbeck, Philipp; Gottesbüren, Lars; Hamann, Michael; Heuer, Tobias; Spinner, Jonas; Weyand, Christopher; Wilhelm, Marcus
**A Branch-and-Bound Algorithm for Cluster Editing**Symposium on Experimental Algorithms (SEA) 2022: 13:1–13:19 - Cohen, Sarel; Fischbeck, Philipp; Friedrich, Tobias; Krejca, Martin S.; Sauerwald, Thomas
**Accelerated Information Dissemination on Networks with Local and Global Edges**Structural Information and Communication Complexity (SIROCCO) 2022: 79–97 - Fomin, Fedor V.; Golovach, Petr A.; Sagunov, Danil; Simonov, Kirill
**Algorithmic Extensions of Dirac’s Theorem**Symposium on Discrete Algorithms (SODA) 2022: 406–416 - Bazgan, Cristina; Casel, Katrin; Cazals, Pierre
**Dense Graph Partitioning on sparse and dense graphs.**Scandinavian Workshop Algorithm Theory (SWAT) 2022

2021

- Göbel, Andreas; Lagodzinski, J. A. Gregor; Seidel, Karen
**Counting Homomorphisms to Trees Modulo a Prime**ACM Transactions on Computation Theory 2021 - Cseh, Ágnes; Juhos, Attila
**Pairwise Preferences in the Stable Marriage Problem**ACM Transactions on Economics and Computation (TEAC) 2021: 1–28 - Cseh, Ágnes; Kavitha, Telikepalli
**Popular matchings in complete graphs**Algorithmica 2021: 1–31 - Andersson, Tommy; Cseh, Ágnes; Ehlers, Lars; Erlanson, Albin
**Organizing time exchanges: Lessons from matching markets**American Economic Journal: Microeconomics 2021: 338–73 - Haemers, Willem H; Parsaei Majd, Leila
**Spectral symmetry in conference matrices**Designs, Codes and Cryptography 2021: 1–8 - Michail, Othon; Skretas, George; Spirakis, Paul G.
**Distributed computation and reconfiguration in actively dynamic networks**Distributed Computing 2021: 185–206 - Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Sikora, Florian
**On the Complexity of Solution Extension of Optimization Problems**Theoretical Computer Science 2021 - Doerr, Benjamin; Krejca, Martin S.
**A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes**Theoretical Computer Science 2021: 121–128 - Bläsius, Thomas; Fischbeck, Philipp; Friedrich, Tobias; Katzmann, Maximilian
**Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs**Theory of Computing Systems 2021 - Casel, Katrin; Fernau, Henning; Gaspers, Serge; Gras, Benjamin; Schmid, Markus L.
**On the Complexity of the Smallest Grammar Problem over Fixed Alphabets**Theory of Computing Systems 2021: 344–409 - Neubert, Stefan
**Grundkurs Theoretische Informatik**Rheinwerk Computing 2021 - Boockmeyer, Arne; Fischbeck, Philipp; Neubert, Stefan
**Fit fürs Studium - Informatik**Rheinwerk Computing 2021 - Aziz, Haris; Cseh, Agnes; Dickerson, John; McElfresh, Duncan
**Optimal Kidney Exchange with Immunosuppressants**Conference on Artificial Intelligence (AAAI) 2021: 21–29 - Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Lowski, Stefanie; Melnichenko, Anna
**Selfish Creation of Social Networks**Conference on Artificial Intelligence (AAAI) 2021: 5185–5193 - Aziz, Haris; Chan, Hau; Cseh, Ágnes; Li, Bo; Ramezani, Fahimeh; Wang, Chenhao
**Multi-Robot Task Allocation—Complexity and Approximation**Autonomous Agents and Multiagent Systems (AAMAS) 2021: 133–141 - Kraiczy, Sonja; Cseh, Ágnes; Manlove, David
**On Weakly and Strongly Popular Rankings**Autonomous Agents and Multiagent Systems (AAMAS) 2021: 1563–1565 - Cooley, Madison; Greene, Casey; Issac, Davis; Pividori, Milton; Sullivan, Blair
**Parameterized Algorithms for Identifying Gene Co-Expression Modules via Weighted Clique Decomposition**Applied and Computational Discrete Algorithms (ACDA) 2021: 111–122 - Quinzan, Francesco; Doskoč, Vanja; Göbel, Andreas; Friedrich, Tobias
**Adaptive Sampling for Fast Constrained Maximization of Submodular Functions**Artificial Intelligence and Statistics (AISTATS) 2021: 964–972 - Borndörfer, Ralf; Casel, Katrin; Issac, Davis; Niklanovits, Aikaterini; Schwartz, Stephan; Zeif, Ziena
**Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs**Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2021: 27:1–27:14 - Berger, Julian; Böther, Maximilian; Doskoč, Vanja; Gadea Harder, Jonathan; Klodt, Nicolas; Kötzing, Timo; Lötzsch, Winfried; Peters, Jannik; Schiller, Leon; Seifert, Lars; Wells, Armin; Wietheger, Simon
**Learning Languages with Decidable Hypotheses**Computability in Europe (CiE) 2021: 25–37 - Doskoč, Vanja; Kötzing, Timo
**Mapping Monotonic Restrictions in Inductive Inference**Computability in Europe (CiE) 2021: 146–157 - Doskoč, Vanja; Kötzing, Timo
**Normal Forms for Semantically Witness-Based Learners in Inductive Inference**Computability in Europe (CiE) 2021: 158–168 - Khazraei, Ardalan; Kötzing, Timo; Seidel, Karen
**Towards a Map for Incremental Learning in the Limit from Positive and Negative Information**Computability in Europe (CiE) 2021: 273–284 - Kötzing, Timo; Seidel, Karen
**Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes**Computability in Europe (CiE) 2021: 318–329 - Cohen, Sarel; Hershcovitch, Moshik; Taraz, Martin; Kißig, Otto; Wood, Andrew; Waddington, Daniel; Chin, Peter; Friedrich, Tobias
**Drug Repurposing using Link Prediction on Knowledge Graphs with Applications to Non-Volatile Memory**Complex Networks and their Applications (ComplexNetworks) 2021: 742–753 - Bilò, Davide; Cohen, Sarel; Friedrich, Tobias; Schirneck, Martin
**Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles**European Symposium on Algorithms (ESA) 2021: 18:1–18:17 - Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian
**Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry**European Symposium on Algorithms (ESA) 2021: 20:1–20:15 - Bläsius, Thomas; Friedrich, Tobias; Weyand, Christopher
**Efficiently Computing Maximum Flows in Scale-Free Networks**European Symposium on Algorithms (ESA) 2021: 21:1–21:14 - Casel, Katrin; Friedrich, Tobias; Issac, Davis; Niklanovits, Aikaterini; Zeif, Ziena
**Balanced Crown Decomposition for Connectivity Constraints**European Symposium on Algorithms (ESA) 2021: 26:1–26:15 - Behrendt, Lukas; Casel, Katrin; Friedrich, Tobias; Lagodzinski, J. A. Gregor; Löser, Alexander; Wilhelm, Marcus
**From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization**Fundamentals of Computation Theory (FCT) 2021: 53–66 - Berger, Julian; Bleidt, Tibor; Büßemeyer, Martin; Ding, Marcus; Feldmann, Moritz; Feuerpfeil, Moritz; Jacoby, Janusch; Schröter, Valentin; Sievers, Bjarne; Spranger, Moritz; Stadlinger, Simon; Wullenweber, Paul; Cohen, Sarel; Doskoč, Vanja; Friedrich, Tobias
**Fine-Grained Localization, Classification and Segmentation of Lungs with Various Diseases**CVPR Workshop on Fine-Grained Visual Categorization (FGVC@CVPR) 2021 - Böther, Maximilian; Schiller, Leon; Fischbeck, Philipp; Molitor, Louise; Krejca, Martin S.; Friedrich, Tobias
**Evolutionary Minimization of Traffic Congestion**Genetic and Evolutionary Computation Conference (GECCO) 2021: 937–945Best-Paper Award (RWA Track) - Doerr, Benjamin; Kötzing, Timo
**Lower Bounds from Fitness Levels Made Easy**Genetic and Evolutionary Computation Conference (GECCO) 2021: 1142–1150 - Wood, Andrew; Hershcovitch, Moshik; Waddington, Daniel; Cohen, Sarel; Chin, Peter
**Non-Volatile Memory Accelerated Posterior Estimation**High Performance and Embedded Computing (HPEC) 2021 - Wood, Andrew; Hershcovitch, Moshik; Waddington, Daniel; Cohen, Sarel; Wolf, Meredith; Suh, Hongjun; Zong, Weiyu; Chin, Peter
**Non-Volatile Memory Accelerated Geometric Multi-Scale Resolution Analysis**High Performance and Embedded Computing (HPEC) 2021: 1–7 - Friedrich, Tobias; Göbel, Andreas; Krejca, Martin S.; Pappik, Marcus
**A spectral independence view on hard spheres via block dynamics**International Colloquium on Automata, Languages and Programming (ICALP) 2021: 66:1–66:15 - Lagodzinski, J. A. Gregor; Göbel, Andreas; Casel, Katrin; Friedrich, Tobias
**On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order**International Colloquium on Automata, Languages and Programming (ICALP) 2021: 91:1–91:15 - Casel, Katrin; Schmid, Markus L.
**Fine-Grained Complexity of Regular Path Queries**International Conference on Database Theory (ICDT) 2021: 19:1–19:20 - Krogmann, Simon; Lenzner, Pascal; Molitor, Louise; Skopalik, Alexander
**Two-Stage Facility Location Games with Strategic Clients and Facilities**International Joint Conference on Artificial Intelligence (IJCAI) 2021: 292–298 - Bläsius, Thomas; Fischbeck, Philipp; Gottesbüren, Lars; Hamann, Michael; Heuer, Tobias; Spinner, Jonas; Weyand, Christopher; Wilhelm, Marcus
**PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm**International Symposium on Parameterized and Exact Computation (IPEC) 2021: 27:1–27:3 - Bläsius, Thomas; Fischbeck, Philipp; Gottesbüren, Lars; Hamann, Michael; Heuer, Tobias; Spinner, Jonas; Weyand, Christopher; Wilhelm, Marcus
**PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm**International Symposium on Parameterized and Exact Computation (IPEC) 2021: 31:1–31:4 - Bläsius, Thomas; Friedrich, Tobias; Krejca, Martin S.; Molitor, Louise
**The Impact of Geometry on Monochrome Regions in the Flip Schelling Process**International Symposium on Algorithms and Computation, (ISAAC) 2021 2021: 29:1–29:17 - Antoniadis, Antonios; Kumar, Gunjan; Kumar, Nikhil
**Skeletons and Minimum Energy Scheduling**International Symposium on Algorithms and Computation (ISAAC) 2021: 51:1–51:16 - Casel, Katrin; Friedrich, Tobias; Issac, Davis; Klodt, Nicolas; Seifert, Lars; Zahn, Arthur
**A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics**Knowledge Discovery and Data Mining (KDD) 2021: 882–891 - Bilò, Davide; Cohen, Sarel; Friedrich, Tobias; Schirneck, Martin
**Space-Efficient Fault-Tolerant Diameter Oracles**Mathematical Foundations of Computer Science (MFCS) 2021: 18:1–18:16 - Kißig, Otto; Taraz, Martin; Cohen, Sarel; Doskoč, Vanja; Friedrich, Tobias
**Drug Repurposing for Multiple COVID Strains using Collaborative Filtering**ICLR Workshop on Machine Learning for Preventing and Combating Pandemics (MLPCP@ICLR) 2021 - Atzberger, Daniel; Cech, Tim; de la Haye, Merlin; Söchting, Maximilian; Scheibel, Willy; Limberger, Daniel; Döllner, Jürgen
**Software Forest: A Visualization of Semantic Similarities in Source Code using a Tree Metaphor**Proceedings of the 16th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications -- Volume 3 IVAPP 2021: 112–122 - Friedrich, Tobias; Neumann, Frank; Rothenberger, Ralf; Sutton, Andrew M.
**Solving Non-Uniform Planted and Filtered Random SAT Formulas Greedily**Theory and Applications of Satisfiability Testing (SAT) 2021: 188–206 - Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian
**Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane**Symposium on Experimental Algorithms (SEA) 2021: 22:1–22:18 - Bläsius, Thomas; Friedrich, Tobias; Göbel, Andreas; Levy, Jordi; Rothenberger, Ralf
**The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability**Symposium on Discrete Algorithms (SODA) 2021: 42–53 - Friedemann, Wilhelm; Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Melnichenko, Anna; Peters, Jannik; Stephan, Daniel; Vaichenker, Michael
**Efficiency and Stability in Euclidean Network Design**Symposium on Parallelism in Algorithms and Architectures (SPAA) 2021: 232–242 - Kißig, Otto; Taraz, Martin; Cohen, Sarel; Friedrich, Tobias
**Drug Repurposing Using Link Prediction on Knowledge Graphs**ICML Workshop on Computational Biology (WCB@ICML) 2021: 742–753

2020

- Cseh, Ágnes; Fleiner, Tamás
**The Complexity of Cake Cutting with Unequal Shares**ACM Transactions on Algorithms 2020: 1–21 - Shi, Feng; Schirneck, Martin; Friedrich, Tobias; Kötzing, Timo; Neumann, Frank
**Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints**Algorithmica 2020: 3117–3123 - Chauhan, Ankit; Friedrich, Tobias; Rothenberger, Ralf
**Greed is Good for Deterministic Scale-Free Networks**Algorithmica 2020: 3338–3389 - Ghorbani, Ebrahim; Haemers, Willem H.; Reza Maimani, Hamid; Parsaei Majd, Leila
**On sign-symmetric signed graphs**Ars Mathematica Contemporane 2020: 83–93 - Casel, Katrin; Dreier, Jan; Fernau, Henning; Gobbert, Moritz; Kuinke, Philipp; Sanchez Villaamil, Fernando; Schmid, Markus L.; van Leeuwen, Erik Jan
**Complexity of independency and cliquy trees**Discrete Applied Mathematics 2020: 2–15 - Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning
**Domination chain: Characterisation, classical complexity, parameterised complexity and approximability**Discrete Applied Mathematics 2020: 23–42 - Akbari, Saieed; Reza Maimani, Hamid; Parsaei Majd, Leila; Wanless, Ian M.
**Zero-sum flows for Steiner systems**Discrete Mathematics 2020: 112074 - Cseh, Ágnes; Heeger, Klaus
**The stable marriage problem with ties and restricted edges**Discrete Optimization 2020: 100571 - Doerr, Benjamin; Krejca, Martin S.
**Significance-based Estimation-of-Distribution Algorithms**IEEE Transactions on Evolutionary Computation 2020: 1025–1034 - Alizadeh, Faezeh; Maimani, Hamid Reza; Parsaei Majd, Leila; Rajabi Parsa, Mina
**Roman 2-domination in graphs and graph products**Iranian Journal of Mathematical Sciences and Informatics Iranian Journal of Mathematical Sciences and Informatics 2020 - Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Krohmer, Anton
**Hyperbolic Embeddings for Near-Optimal Greedy Routing**Journal of Experimental Algorithmics (JEA) 2020: 1–18 - Birnick, Johann; Bläsius, Thomas; Friedrich, Tobias; Naumann, Felix; Papenbrock, Thorsten; Schirneck, Martin
**Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery**Proceedings of the VLDB Endowment 2020: 2270–2283 - Battaglia, Francesco; Cucina, Domenico; Rizzo, Manuel
**Parsimonious periodic autoregressive models for time series with evolving trend and seasonality**Statistics and Computing 2020: 77–91 - Friedrich, Tobias; Kötzing, Timo; Lagodzinski, J. A. Gregor; Neumann, Frank; Schirneck, Martin
**Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints**Theoretical Computer Science 2020: 3–19 - Kötzing, Timo; Lagodzinski, J. A. Gregor; Lengler, Johannes; Melnichenko, Anna
**Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming**Theoretical Computer Science 2020: 96–113 - Krejca, Martin S.; Witt, Carsten
**Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax**Theoretical Computer Science 2020: 143–165 - Doerr, Benjamin; Kötzing, Timo; Lagodzinski, J. A. Gregor; Lengler, Johannes
**The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time**Theoretical Computer Science 2020: 144–168 - Bilò, Davide; Lenzner, Pascal
**On the Tree Conjecture for the Network Creation Game**Theory of Computing Systems 2020: 422–443 - Krejca, Martin S.; Witt, Carsten
**Theory of Estimation-of-Distribution Algorithms**Theory of Evolutionary Computation: Recent Developments in Discrete Optimization 2020: 405–442 - Doskoč, Vanja; Kötzing, Timo
**Cautious Limit Learning**Algorithmic Learning Theory (ALT) 2020: 251–276 - Das, Syamantak; Jain, Lavina; Kumar, Nikhil
**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 - Bläsius, Thomas; Böther, Maximilian; Fischbeck, Philipp; Friedrich, Tobias; Gries, Alina; Hüffner, Falk; Kißig, Otto; Lenzner, Pascal; Molitor, Louise; Schiller, Leon; Wells, Armin; Wietheger, Simon
**A Strategic Routing Framework and Algorithms for Computing Alternative Paths**Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) 2020: 10:1–10:14 - Fogel, Sharon; Averbuch-Elor, Hadar; Cohen, Sarel; Mazor, Shai; Litman, Roee
**ScrabbleGAN: Semi-Supervised Varying Length Handwritten Text Generation**Conference on Computer Vision and Pattern Recognition (CVPR) 2020: 4323–4332 - Doskoč, Vanja; Friedrich, Tobias; Göbel, Andreas; Neumann, Aneta; Neumann, Frank; Quinzan, Francesco
**Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings**European Conference on Artificial Intelligence (ECAI) 2020: 435–442 - Bläsius, Thomas; Friedrich, Tobias; Schirneck, Martin
**The Minimization of Random Hypergraphs**European Symposium on Algorithms (ESA) 2020: 21:1–21:15 - Garg, Naveen; Kumar, Nikhil
**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 - Doerr, Benjamin; Krejca, Martin S.
**The Univariate Marginal Distribution Algorithm Copes Well With Deception and Epistasis**Evolutionary Computation in Combinatorial Optimisation (EvoCOP) 2020: 51–66Best-Paper Award - Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna; Molitor, Louise
**Fair Tree Connection Games with Topology-Dependent Edge Cost**Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2020: 15:1–15:15 - Doerr, Benjamin; Krejca, Martin S.
**Bivariate Estimation-of-Distribution Algorithms Can Find an Exponential Number of Optima**Genetic and Evolutionary Computation Conference (GECCO) 2020: 796–804 - Bossek, Jakob; Casel, Katrin; Kerschke, Pascal; Neumann, Frank
**The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics**Genetic and Evolutionary Computation Conference (GECCO) 2020: 1286–1294 - Friedrich, Tobias; Krejca, Martin S.; Lagodzinski, J. A. Gregor; Rizzo, Manuel; Zahn, Arthur
**Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation**International Conference on Neural Information Processing (ICONIP) 2020: 592–604 - Echzell, Hagen; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna
**Flow-Based Network Creation Games**International Joint Conference on Artificial Intelligence (IJCAI) 2020: 139–145 - Garg, Naveen; Kumar, Nikhil; Sebö, András
**Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation**Integer Programming and Combinatorial Optimization (IPCO) 2020: 144–157 - Feldmann, Andreas; Issac, Davis; Rai, Ashutosh
**Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem**International Symposium on Parameterized and Exact Computation (IPEC) 2020: 1–16 - Kumar, Nikhil
**Multicommodity Flows in Planar Graphs with Demands on Faces**International Symposium on Algorithms and Computation (ISAAC) 2020: 1–11 - Bilò, Davide; Bilò, Vittorio; Lenzner, Pascal; Molitor, Louise
**Topological Influence and Locality in Swap Schelling Games**International Symposium on Mathematical Foundations of Computer Science (MFCS) 2020: 15:1–15:15 - Michail, Othon; Skretas, George; Spirakis, G. Paul
**Distributed Computation and Reconfiguration in Actively Dynamic Networks**Principles of Distributed Computing (PODC) 2020: 448–457 - Kötzing, Timo; Witt, Carsten
**Improved Fixed-Budget Results via Drift Analysis**Parallel Problem Solving From Nature (PPSN) 2020: 648–660 - Antoniadis, Antonios; Garg, Naveen; Kumar, Gunjan; Kumar, Nikhil
**Parallel Machine Scheduling to Minimize Energy Consumption**Symposium on Discrete Algorithms (SODA) 2020: 2758–2769 - Feldmann, Michael; Khazraei, Ardalan; Scheideler, Christian
**Time- and Space-Optimal Clock Synchronization in the Beeping Model**Symposium Parallelism in Algorithms and Architectures (SPAA) 2020: 223–233 - Bläsius, Thomas; Fischbeck, Philipp; Friedrich, Tobias; Katzmann, Maximilian
**Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs**Symposium on the Theoretical Aspects of Computer Science (STACS) 2020: 25:1–25:14 - Chechik, Shiri; Cohen, Sarel
**Distance sensitivity oracles with subcubic preprocessing time and fast query time**Symposium Theory of Computing (STOC) 2020: 1375–1388 - Becher, Kilian; Lagodzinski, J. A. Gregor; Strufe, Thorsten
**Privacy-Preserving Public Verification of Ethical Cobalt Sourcing**Trust, Security and Privacy in Computing and Communications (TrustCom) 2020: 998–1005