# Publications at ESA

Below you find the list of all publications of the Algorithm Engineering group presented at the European Symposia on Algorithms (ESA).

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

2024 [ nach oben ]

- Angrick, Sebastian; Bals, Ben; Friedrich, Tobias; Gawendowicz, Hans; Hastrich, Niko; Klodt, Nicolas; Lenzner, Pascal; Schmidt, Jonas; Skretas, George; Wells, Armin
**How to Reduce Temporal Cliques to Find Sparse Spanners**European Symposium on Algorithms (ESA) 2024[ BibTeX ]

2023 [ nach oben ]

2022 [ nach oben ]

2021 [ nach oben ]

- 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 - 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 - 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

2020 [ nach oben ]

- 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 - Bläsius, Thomas; Friedrich, Tobias; Schirneck, Martin
**The Minimization of Random Hypergraphs**European Symposium on Algorithms (ESA) 2020: 21:1–21:15

2019 [ nach oben ]

- Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Meyer, Ulrich; Penschuck, Manuel; Weyand, Christopher
**Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs**European Symposium on Algorithms (ESA) 2019: 21:2–21:14EATCS Best Paper Award

2017 [ nach oben ]

2016 [ nach oben ]

- Arndt, Tobias; Hafner, Danijar; Kellermeier, Thomas; Krogmann, Simon; Razmjou, Armin; Krejca, Martin S.; Rothenberger, Ralf; Friedrich, Tobias
**Probabilistic Routing for On-Street Parking Search**European Symposium on Algorithms (ESA) 2016: 6:1–6:13 - Baum, Moritz; Bläsius, Thomas; Gemsa, Andreas; Rutter, Ignaz; Wegner, Franziska
**Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths**European Symposium on Algorithms (ESA) 2016: 7:1–7:18 - Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton
**Hyperbolic Random Graphs: Separators and Treewidth**European Symposium on Algorithms (ESA) 2016: 15:1–15:16 - Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton; Laue, Sören
**Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane**European Symposium on Algorithms (ESA) 2016: 16:1–16:18EATCS Best Paper Award

2014 [ nach oben ]