Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Maximilian Katzmann
Observed names:
Katzmann, Maximilian,
Katzmann, Maximillian,
Maximillian Katzmann
Institution:
Karlsruhe Institute of Technology
Observed institutions:
Karlsruhe Institute of Technology,
Hasso Plattner Institute,
University of Potsdam,
Friedrich Schiller University Jena,
University of Twente
ORCID:
0000-0002-9302-5527
Observed ORCID:
0000-0002-9302-5527
OpenAlex ID:
A5090479052
Efficiently generating geometric inhomogeneous and hyperbolic random graphs
2022
·
Thomas Bläsius
, Tobias Friedrich
, et al.
·
Network Science
·
54
PDF
A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints
2019
·
Parra, Álvaro
, Chin, Tat-Jun
, et al.
·
arXiv (Cornell University)
·
41
PDF
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
2022
·
Thomas Bläsius
, Cedric Freiberger
, et al.
·
ACM Transactions on Algorithms
·
38
PDF
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
2021
·
Thomas Bläsius
, Philipp Fischbeck
, et al.
·
Theory of Computing Systems
·
25
PDF
Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem
2017
·
Maximilian Katzmann
, Christian Komusiewicz
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
23
Hyperbolic Embeddings for Near-Optimal Greedy Routing
2020
·
Thomas Bläsius
, Tobias Friedrich
, et al.
·
ACM Journal of Experimental Algorithmics
·
20
Strongly Hyperbolic Unit Disk Graphs
2021
·
Bläsius, Thomas
, Friedrich, Tobias
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
15
PDF
Towards a Systematic Evaluation of Generative Network Models
2018
·
Thomas Bläsius
, Tobias Friedrich
, et al.
·
Lecture notes in computer science
·
13
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
2024
·
Tobias Friedrich
, Andreas Göbel
, et al.
·
SIAM Journal on Discrete Mathematics
·
12
PDF
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
2023
·
Thomas Bläsius
, Tobias Friedrich
, et al.
·
Algorithmica
·
9
PDF
Hyperbolic Embeddings for Near-Optimal Greedy Routing
2018
·
Thomas Bläsius
, Tobias Friedrich
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
9
PDF
Towards explainable real estate valuation via evolutionary algorithms
2022
·
Sebastian Angrick
, Ben Bals
, et al.
·
Genetic and Evolutionary Computation Conference (GECCO)
·
8
PDF
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane
2021
·
Bläsius, Thomas
, Friedrich, Tobias
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
7
PDF
Algorithms for Hard-Constraint Point Processes via Discretization
2022
·
Tobias Friedrich
, Andreas Göbel
, et al.
·
Lecture notes in computer science
·
6
PDF
Maximal cliques in scale-free random graphs
2024
·
Thomas Bläsius
, Maximillian Katzmann
, et al.
·
Network Science
·
5
PDF
Sampling repulsive Gibbs point processes using random graphs
2024
·
Tobias Friedrich
, Andreas Göbel
, et al.
·
Combinatorics Probability Computing
·
5
Unbounded Discrepancy of Deterministic Random Walks on Grids
2015
·
Tobias Friedrich
, Maximilian Katzmann
, et al.
·
Lecture notes in computer science
·
5
Weighted Embeddings for Low-Dimensional Graph Representation
2025
·
Thomas Bläsius
, Jean-Pierre Von der Heydt
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
3
PDF
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
2021
·
Bläsius, Thomas
, Friedrich, Tobias
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
3
PDF
On the Giant Component of Geometric Inhomogeneous Random Graphs
2023
·
Bläsius, Thomas
, Friedrich, Tobias
, et al.
·
Repository KITopen (Karlsruhe Institute of Technology)
·
2
PDF
Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane
2021
·
Friedrich, Tobias
, Katzmann, Maximilian
, et al.
·
arXiv (Cornell University)
·
2
PDF
Towards Explainable Real Estate Valuation via Evolutionary Algorithms
2021
·
Angrick, Sebastian
, Bals, Ben
, et al.
·
arXiv (Cornell University)
·
2
PDF
Unbounded Discrepancy of Deterministic Random Walks on Grids
2018
·
Tobias Friedrich
, Maximilian Katzmann
, et al.
·
SIAM Journal on Discrete Mathematics
·
2
Partitioning the Bags of a Tree Decomposition Into Cliques
2023
·
Bläsius, Thomas
, Katzmann, Maximilian
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
1
PDF
Algorithms for general hard-constraint point processes via discretization.
2021
·
Tobias Friedrich
, Andreas Göbel
, et al.
·
arXiv (Cornell University)
·
1
Show more works
View as search
Works count:
43
Citation count:
324
H-index:
9
I10-index:
9
Year
Topic
Type