Maximilian Katzmann

According to our database, Maximilian Katzmann authored at least 28 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs.

Tobias Friedrich, Andreas Göbel, 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

CoRR, 2024

Real-World Networks Are Low-Dimensional: Theoretical and Practical Assessment.

Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023

Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry.

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann

Algorithmica, December, 2023

Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs.

Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann

Theory Comput. Syst., February, 2023

Code for: Faster Nearest Neighbors Queries on Geographic Data.

Vanja Doskoc, Tobias Friedrich, Niko Hastrich, Maximilian Katzmann

Dataset, February, 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

PhD thesis, 2023

Maximal Cliques in Scale-Free Random Graphs.

Thomas Bläsius, Maximilian Katzmann, Clara Stegehuis

CoRR, 2023

A simple statistic for determining the dimensionality of complex networks.

Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller

CoRR, 2023

Partitioning the Bags of a Tree Decomposition into Cliques.

Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Strongly Hyperbolic Unit Disk Graphs.

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

On the Giant Component of Geometric Inhomogeneous Random Graphs.

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Deep Distance Sensitivity Oracles.

Davin Jeong, Allison Gunby-Mann, Sarel Cohen, Maximilian Katzmann, Chau Pham, Arnav Bhakta, Tobias Friedrich, Peter Chin

Proceedings of the Complex Networks & Their Applications XII, 2023

2022

Efficiently generating geometric inhomogeneous and hyperbolic random graphs.

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand

Netw. Sci., December, 2022

Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry.

Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry

ACM Trans. Algorithms, 2022

Deep Distance Sensitivity Oracles.

Davin Jeong, Chau Pham, Arnav Bhakta, Sarel Cohen, Maximilian Katzmann, Tobias Friedrich, Sang (Peter) Chin

CoRR, 2022

Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials.

Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik

CoRR, 2022

Towards explainable real estate valuation via evolutionary algorithms.

Sebastian Angrick, Ben Bals, Niko Hastrich, Maximilian Kleissl, Jonas Schmidt, Vanja Doskoc, Louise Molitor, Tobias Friedrich, Maximilian Katzmann

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Algorithms for Hard-Constraint Point Processes via Discretization.

Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane.

Tobias Friedrich, Maximilian Katzmann, Leon Schiller

CoRR, 2021

Algorithms for general hard-constraint point processes via discretization.

Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik

CoRR, 2021

Routing in Strongly Hyperbolic Unit Disk Graphs.

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan

CoRR, 2021

Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane.

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2020

Hyperbolic Embeddings for Near-Optimal Greedy Routing.

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer

ACM J. Exp. Algorithmics, 2020

2019

A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints.

Álvaro Parra Bustos, Tat-Jun Chin, Frank Neumann, Tobias Friedrich, Maximilian Katzmann

CoRR, 2019

2018

Unbounded Discrepancy of Deterministic Random Walks on Grids.

Tobias Friedrich, Maximilian Katzmann, Anton Krohmer

SIAM J. Discret. Math., 2018

Towards a Systematic Evaluation of Generative Network Models.

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel

Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018

2017

Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem.

Maximilian Katzmann, Christian Komusiewicz

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017