# All Publications in 2021

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

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: 2024, 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, Dr. Shaily Verma
- PhD students: Panagiotis Aivasiliotis, Michelle Döring, Philipp Fischbeck, 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, Farehe Soheil, 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

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 - Doerr, Benjamin; Krejca, Martin S.
**The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis**Evolutionary Computation 2021: 543–563 - 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 - 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 - Tabatabaei, Azadeh; Soheil, Farehe; Aletaha, Mohammad; Ghodsi, Mohammad
**Integer Cow-path Problem and Simple Robot Street Search**Canadian Conference on Computational Geometry (CCCG) 2021: 388–398 - 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

## Journal Publications

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 - Doerr, Benjamin; Krejca, Martin S.
**The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis**Evolutionary Computation 2021: 543–563 - 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 - 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 - Tabatabaei, Azadeh; Soheil, Farehe; Aletaha, Mohammad; Ghodsi, Mohammad
**Integer Cow-path Problem and Simple Robot Street Search**Canadian Conference on Computational Geometry (CCCG) 2021: 388–398 - 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