Follow
Maximilian Katzmann
Maximilian Katzmann
Assistant Researcher, Karlsruhe Institute of Technology (KIT)
Verified email at kit.edu - Homepage
Title
Cited by
Cited by
Year
A practical maximum clique algorithm for matching with pairwise constraints
A Parra, TJ Chin, F Neumann, T Friedrich, M Katzmann
arXiv preprint arXiv:1902.01534, 2019
352019
Efficiently generating geometric inhomogeneous and hyperbolic random graphs
T Bläsius, T Friedrich, M Katzmann, U Meyer, M Penschuck, C Weyand
Network Science 10 (4), 361-380, 2022
342022
Efficient shortest paths in scale-free networks with underlying hyperbolic geometry
T Bläsius, C Freiberger, T Friedrich, M Katzmann, F Montenegro-Retana, ...
ACM Transactions on Algorithms (TALG) 18 (2), 1-32, 2022
232022
Hyperbolic embeddings for near-optimal greedy routing
T Bläsius, T Friedrich, M Katzmann, A Krohmer
Journal of Experimental Algorithmics (JEA) 25, 1-18, 2020
212020
Solving vertex cover in polynomial time on hyperbolic random graphs
T Bläsius, P Fischbeck, T Friedrich, M Katzmann
Theory of Computing Systems 67 (1), 28-51, 2023
152023
Systematic exploration of larger local search neighborhoods for the minimum vertex cover problem
M Katzmann, C Komusiewicz
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
132017
Towards a systematic evaluation of generative network models
T Bläsius, T Friedrich, M Katzmann, A Krohmer, J Striebel
Algorithms and Models for the Web Graph: 15th International Workshop, WAW …, 2018
112018
Cliques in high-dimensional geometric inhomogeneous random graphs
T Friedrich, A Göbel, M Katzmann, L Schiller
arXiv preprint arXiv:2302.04113, 2023
52023
Force-directed embedding of scale-free networks in the hyperbolic plane
T Bläsius, T Friedrich, M Katzmann
19th International Symposium on Experimental Algorithms (SEA 2021), 2021
52021
Unbounded discrepancy of deterministic random walks on grids
T Friedrich, M Katzmann, A Krohmer
International Symposium on Algorithms and Computation, 212-222, 2015
52015
Algorithms for hard-constraint point processes via discretization
T Friedrich, A Göbel, M Katzmann, MS Krejca, M Pappik
International Computing and Combinatorics Conference, 242-254, 2022
42022
Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry
T Bläsius, T Friedrich, M Katzmann
Algorithmica 85 (12), 3487-3520, 2023
32023
A simple statistic for determining the dimensionality of complex networks
T Friedrich, A Göbel, M Katzmann, L Schiller
arXiv preprint arXiv:2302.06357, 2023
32023
Towards explainable real estate valuation via evolutionary algorithms
S Angrick, B Bals, N Hastrich, M Kleissl, J Schmidt, V Doskoč, L Molitor, ...
Proceedings of the Genetic and Evolutionary Computation Conference, 1130-1138, 2022
22022
Routing in strongly hyperbolic unit disk graphs
T Bläsius, T Friedrich, M Katzmann, D Stephan
arXiv preprint arXiv 2107, 2021
22021
Partitioning the Bags of a Tree Decomposition into Cliques
T Bläsius, M Katzmann, M Wilhelm
arXiv preprint arXiv:2302.08870, 2023
12023
Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials
T Friedrich, A Göbel, M Katzmann, M Krejca, M Pappik
arXiv preprint arXiv:2204.01793, 2022
12022
Deep Distance Sensitivity Oracles
D Jeong, A Gunby-Mann, S Cohen, M Katzmann, C Pham, A Bhakta, ...
International Conference on Complex Networks and Their Applications, 452-463, 2023
2023
On the Giant Component of Geometric Inhomogeneous Random Graphs
T Bläsius, T Friedrich, M Katzmann, J Ruff, Z Zeif
arXiv preprint arXiv:2306.09506, 2023
2023
About the analysis of algorithms on networks with underlying hyperbolic geometry
M Katzmann
Universität Potsdam, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–20