Maximilian Katzmann

Publication Activity (10 Years)

Years Active: 2015-2023
Publications (10 Years): 37

Top Topics

Maximal Cliques

Point Processes

Real Estate Valuation

Top Venues

Publications

Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm
Partitioning the Bags of a Tree Decomposition into Cliques. SEA (2023)
Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm
Partitioning the Bags of a Tree Decomposition Into Cliques. CoRR (2023)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif
On the Giant Component of Geometric Inhomogeneous Random Graphs. ESA (2023)
Thomas Bläsius, Maximilian Katzmann, Clara Stegehuis
Maximal Cliques in Scale-Free Random Graphs. CoRR (2023)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. CoRR (2023)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif
On the Giant Component of Geometric Inhomogeneous Random Graphs. CoRR (2023)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan
Strongly Hyperbolic Unit Disk Graphs. STACS (2023)
Davin Jeong, Allison Gunby-Mann, Sarel Cohen, Maximilian Katzmann, Chau Pham, Arnav Bhakta, Tobias Friedrich, Peter Chin
Deep Distance Sensitivity Oracles. COMPLEX NETWORKS (1) (2023)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller
A simple statistic for determining the dimensionality of complex networks. CoRR (2023)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. ICALP (2023)
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Theory Comput. Syst. 67 (1) (2023)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. Algorithmica 85 (12) (2023)
Davin Jeong, Chau Pham, Arnav Bhakta, Sarel Cohen, Maximilian Katzmann, Tobias Friedrich, Sang (Peter) Chin
Deep Distance Sensitivity Oracles. CoRR (2022)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik
Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials. CoRR (2022)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik
Algorithms for Hard-Constraint Point Processes via Discretization. COCOON (2022)
Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ACM Trans. Algorithms 18 (2) (2022)
Sebastian Angrick, Ben Bals, Niko Hastrich, Maximilian Kleissl, Jonas Schmidt, Vanja Doskoc, Louise Molitor, Tobias Friedrich, Maximilian Katzmann
Towards explainable real estate valuation via evolutionary algorithms. GECCO (2022)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. 10 (4) (2022)
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik
Algorithms for general hard-constraint point processes via discretization. CoRR (2021)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan
Routing in Strongly Hyperbolic Unit Disk Graphs. CoRR (2021)
Tobias Friedrich, Maximilian Katzmann, Leon Schiller
Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane. CoRR (2021)
Sebastian Angrick, Ben Bals, Niko Hastrich, Maximilian Kleissl, Jonas Schmidt, Vanja Doskoc, Maximilian Katzmann, Louise Molitor, Tobias Friedrich
Towards Explainable Real Estate Valuation via Evolutionary Algorithms. CoRR (2021)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. ESA (2021)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. SEA (2021)
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. STACS (2020)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR (2020)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ACM J. Exp. Algorithmics 25 (2020)
Álvaro Parra Bustos, Tat-Jun Chin, Frank Neumann, Tobias Friedrich, Maximilian Katzmann
A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints. CoRR (2019)
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. CoRR (2019)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA (2019)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR (2019)
Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR (2018)
Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
Unbounded Discrepancy of Deterministic Random Walks on Grids. SIAM J. Discret. Math. 32 (4) (2018)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ALENEX (2018)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel
Towards a Systematic Evaluation of Generative Network Models. WAW (2018)
Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ICALP (2018)
Maximilian Katzmann, Christian Komusiewicz
Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem. AAAI (2017)
Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
Unbounded Discrepancy of Deterministic Random Walks on Grids. ISAAC (2015)