Prof. Dr. Tobias Friedrich

All Publications in 2021

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

Conference Publications


  • Aziz, Haris; Cseh, Agnes; Dickerson, John; McElfresh, DuncanOptimal Kidney Exchange with Immunosuppressants. Conference on Artificial Intelligence (AAAI) 2021
  • Selfish Creation of Socia... - Download
    Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Lowski, Stefanie; Melnichenko, AnnaSelfish Creation of Social Networks. Conference on Artificial Intelligence (AAAI) 2021
  • Kraiczy, Sonja; Cseh, Ágnes; Manlove, DavidOn Weakly and Strongly Popular Rankings. Autonomous Agents and Multiagent Systems (AAMAS) 2021
  • Aziz, Haris; Chan, Hau; Cseh, Ágnes; Li, Bo; Ramezani, Fahimeh; Wang, ChenhaoMulti-Robot Task Allocation—Complexity and Approximation. Autonomous Agents and Multiagent Systems (AAMAS) 2021
  • Adaptive Sampling for Fas... - Download
    Quinzan, Francesco; Doskoč, Vanja; Göbel, Andreas; Friedrich, TobiasAdaptive Sampling for Fast Constrained Maximization of Submodular Functions. Artificial Intelligence and Statistics (AISTATS) 2021: 964-972
  • Khazraei, Ardalan; Kötzing, Timo; Seidel, KarenTowards a Map for Incremental Learning in the Limit from Positive and Negative Information. Computability in Europe (CiE) 2021
  • Kötzing, Timo; Seidel, KarenLearning Languages in the Limit from Positive Information with Finitely Many Memory Changes. Computability in Europe (CiE) 2021
  • Doskoč, Vanja; Kötzing, TimoNormal Forms for Semantically Witness-Based Learners in Inductive Inference. Computability in Europe (CiE) 2021
  • Doskoč, Vanja; Kötzing, TimoMapping Monotonic Restrictions in Inductive Inference. Computability in Europe (CiE) 2021
  • 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, SimonLearning Languages with Decidable Hypotheses. Computability in Europe (CiE) 2021
  • Doerr, Benjamin; Kötzing, TimoLower Bounds from Fitness Levels Made Easy. Genetic and Evolutionary Computation Conference (GECCO) 2021
  • Evolutionary Minimization... - Download
    Böther, Maximilian; Fischbeck, Philipp; Friedrich, Tobias; Krejca, Martin S.; Molitor, Louise; Schiller, LeonEvolutionary Minimization of Traffic Congestion. Genetic and Evolutionary Computation Conference (GECCO) 2021
  • Fine-Grained Complexity o... - Download
    Casel, Katrin; Schmid, Markus L.Fine-Grained Complexity of Regular Path Queries. International Conference on Database Theory (ICDT) 2021
  • Kißig, Otto; Taraz, Martin; Cohen, Sarel; Doskoč, Vanja; Friedrich, TobiasDrug Repurposing for Multiple COVID Strains using Collaborative Filtering. ICLR Workshop on Machine Learning for Preventing and Combating Pandemics (MLPCP@ICLR) 2021
  • Bläsius, Thomas; Friedrich, Tobias; Katzmann, MaximilianForce-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. Symposium on Experimental Algorithms (SEA) 2021
  • The Impact of Heterogenei... - Download
    Bläsius, Thomas; Friedrich, Tobias; Göbel, Andreas; Levy, Jordi; Rothenberger, RalfThe Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. Symposium on Discrete Algorithms (SODA) 2021: 42-53

Journal Publications


  • Pairwise Preferences in t... - Download
    Cseh, Ágnes; Juhos, AttilaPairwise Preferences in the Stable Marriage Problem. ACM Transactions on Economics and Computation (TEAC) 2021: 1--28
  • Cseh, Ágnes; Kavitha, TelikepalliPopular matchings in complete graphs. Algorithmica 2021: 1--31
  • Organizing time exchanges... - Download
    Andersson, Tommy; Cseh, Ágnes; Ehlers, Lars; Erlanson, AlbinOrganizing time exchanges: Lessons from matching markets. American Economic Journal: Microeconomics 2021: 338--73
  • Friedemann, Wilhelm; Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Melnichenko, Anna; Peters, Jannik; Stephan, Daniel; Vaichenker, MichaelEfficiency and Stability in Euclidean Network Design. Symposium on Parallelism in Algorithms and Architectures (SPAA) 2021
  • A Simplified Run Time Ana... - Download
    Doerr, Benjamin; Krejca, Martin S.A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes. Theoretical Computer Science 2021: 121-128
  • On the Complexity of the ... - Download
    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
  • The Complexity of Depende... - Download
    Bläsius, Thomas; Friedrich, Tobias; Schirneck, MartinThe Complexity of Dependency Detection and Discovery in Relational Databases. CoRR 2021
    ArXiv preprint