Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem. - Maximilian Katzmann; Christian Komusiewicz (AAAI, 2017)

Towards a Systematic Evaluation of Generative Network Models. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Anton Krohmer; Jonathan Striebel (WAW, 2018)

Unbounded Discrepancy of Deterministic Random Walks on Grids. - Tobias Friedrich 001; Maximilian Katzmann; Anton Krohmer (SIAM J. Discret. Math., 2018)

A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints. - Álvaro Parra Bustos; Tat-Jun Chin; Frank Neumann 001; Tobias Friedrich 001; Maximilian Katzmann (CoRR, 2019)

Hyperbolic Embeddings for Near-Optimal Greedy Routing. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Anton Krohmer (ACM J. Exp. Algorithmics, 2020)

Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann (SEA, 2021)

Routing in Strongly Hyperbolic Unit Disk Graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Daniel Stephan (CoRR, 2021)

Algorithms for general hard-constraint point processes via discretization. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Martin S. Krejca; Marcus Pappik (CoRR, 2021)

Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane. - Tobias Friedrich 001; Maximilian Katzmann; Leon Schiller (CoRR, 2021)

Algorithms for Hard-Constraint Point Processes via Discretization. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Martin S. Krejca; Marcus Pappik (COCOON, 2022)

Towards explainable real estate valuation via evolutionary algorithms. - Sebastian Angrick; Ben Bals; Niko Hastrich; Maximilian Kleissl; Jonas Schmidt 002; Vanja Doskoc; Louise Molitor; Tobias Friedrich 001; Maximilian Katzmann (GECCO, 2022)

Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Martin S. Krejca; Marcus Pappik (CoRR, 2022)

Deep Distance Sensitivity Oracles. - Davin Jeong; Chau Pham 001; Arnav Bhakta; Sarel Cohen; Maximilian Katzmann; Tobias Friedrich 001; Sang (Peter) Chin (CoRR, 2022)

Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. - Thomas Bläsius; Cedric Freiberger; Tobias Friedrich 001; Maximilian Katzmann; Felix Montenegro-Retana; Marianne Thieffry (ACM Trans. Algorithms, 2022)

Efficiently generating geometric inhomogeneous and hyperbolic random graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Ulrich Meyer 001; Manuel Penschuck; Christopher Weyand (Netw. Sci., 2022)

Deep Distance Sensitivity Oracles. - Davin Jeong; Allison Gunby-Mann; Sarel Cohen; Maximilian Katzmann; Chau Pham 001; Arnav Bhakta; Tobias Friedrich 001; Peter Chin 001 (COMPLEX NETWORKS (1), 2023)

On the Giant Component of Geometric Inhomogeneous Random Graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Janosch Ruff; Ziena Zeif (ESA, 2023)

Strongly Hyperbolic Unit Disk Graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Daniel Stephan (STACS, 2023)

Partitioning the Bags of a Tree Decomposition into Cliques. - Thomas Bläsius; Maximilian Katzmann; Marcus Wilhelm (SEA, 2023)

A simple statistic for determining the dimensionality of complex networks. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Leon Schiller (CoRR, 2023)

About the analysis of algorithms on networks with underlying hyperbolic geometry (Über die Analyse von Algorithmen auf Netzwerken mit zugrundeliegender hyperbolischer Geometrie) - Maximilian Katzmann (2023)

Code for: Faster Nearest Neighbors Queries on Geographic Data. - Vanja Doskoc; Tobias Friedrich 001; Niko Hastrich; Maximilian Katzmann (Zenodo, 2023)

Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. - Thomas Bläsius; Philipp Fischbeck; Tobias Friedrich 001; Maximilian Katzmann (Theory Comput. Syst., 2023)

Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann (Algorithmica, 2023)

Real-World Networks Are Low-Dimensional: Theoretical and Practical Assessment. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Leon Schiller (IJCAI, 2024)

Maximal cliques in scale-free random graphs. - Thomas Bläsius; Maximilian Katzmann; Clara Stegehuis (Netw. Sci., 2024)

Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Leon Schiller (SIAM J. Discret. Math., 2024)

Weighted Embeddings for Low-Dimensional Graph Representation. - Thomas Bläsius; Jean-Pierre von der Heydt; Maximilian Katzmann; Nikolai Maas (AAAI, 2025)

Sampling repulsive Gibbs point processes using random graphs. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Martin S. Krejca; Marcus Pappik (Comb. Probab. Comput., 2025)