2023
About the analysis of algorithms on networks with underlying hyperbolic geometry (Über die Analyse von Algorithmen auf Netzwerken mit zugrundeliegender hyperbolischer Geometrie)
University of Potsdam, Germany 2023
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry.
Algorithmica 2023
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs.
Theory of Computing Systems 2023
Deep Distance Sensitivity Oracles.
International Workshop on Complex Networks & Their Applications (COMPLEX NETWORKS) 2023
On the Giant Component of Geometric Inhomogeneous Random Graphs.
European Symposium on Algorithms (ESA) 2023
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs.
International Colloquium on Automata, Languages and Programming (ICALP) 2023
Strongly Hyperbolic Unit Disk Graphs.
Symposium on Theoretical Aspects of Computer Science (STACS) 2023
Partitioning the Bags of a Tree Decomposition into Cliques.
Symposium on Experimental and Efficient Algorithms (SEA) 2023
2022
Efficiently generating geometric inhomogeneous and hyperbolic random graphs.
Network Science 2022
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry.
ACM Transactions on Algorithms (TALG) 2022
Algorithms for Hard-Constraint Point Processes via Discretization.
International Computing and Combinatorics Conference (COCOON) 2022
Towards explainable real estate valuation via evolutionary algorithms.
Annual Conference on Genetic and Evolutionary Computation (GECCO) 2022
2021
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry.
European Symposium on Algorithms (ESA) 2021
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane.
Symposium on Experimental and Efficient Algorithms (SEA) 2021
2020
Hyperbolic Embeddings for Near-Optimal Greedy Routing.
ACM Journal of Experimental Algorithmics (JEA) 2020
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs.
Symposium on Theoretical Aspects of Computer Science (STACS) 2020
2019
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
European Symposium on Algorithms (ESA) 2019
2018
Unbounded Discrepancy of Deterministic Random Walks on Grids.
SIAM Journal on Discrete Mathematics 2018
Hyperbolic Embeddings for Near-Optimal Greedy Routing.
Workshop on Algorithm Engineering and Experimentation (ALENEX) 2018
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry.
International Colloquium on Automata, Languages and Programming (ICALP) 2018
Towards a Systematic Evaluation of Generative Network Models.
Workshop on Algorithms and Models for the Web-Graph (WAW) 2018
2017
Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem.
AAAI Conference on Artificial Intelligence (AAAI) 2017
2015
Unbounded Discrepancy of Deterministic Random Walks on Grids.
International Symposium on Algorithms and Computation (ISAAC) 2015