The European Symposium on Algorithms (ESA) is a premier conference on the design and analysis of algorithm and a central part of ALGO, Europe's largest meeting on the topic. Its 29th edition will be held either virtually or as a hybrid event in Lisbon September 6 - 8. The Algorithm Engineering group contributes four papers.
The International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) is a scientific venue emphasizing approximation algorithms. The group contributes one work to the program of this year's edition, which will be held completely virtually on August 16-18.
D. Bilò, S. Cohen, T. Friedrich, and M. Schirneck: Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles, ESA, 2021.
T. Bläsius, T. Friedrich, and M. Katzmann: Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry, ESA, 2021.
T. Bläsius, T. Friedrich, and C. Weyand: Efficiently Computing Maximum Flows in Scale-Free Networks, ESA, 2021.
K. Casel, T. Friedrich, D. Issac, A. Niklanovits, and Z. Zeif: Balanced Crown Decomposition for Connectivity Constraints, ESA, 2021.
R. Borndörfer, K. Casel, D. Issac, A. Niklanovits, S. Schwartz, and Z. Zeif: Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs, APPROX, 2021.