Maximilian Katzmann
Maximilian Katzmann
PhD Student, Hasso Plattner Institute, University of Potsdam, Potsdam, Germany
Verified email at hpi.de - Homepage
Title
Cited by
Cited by
Year
Efficiently generating geometric inhomogeneous and hyperbolic random graphs
T Bläsius, T Friedrich, M Katzmann, U Meyer, M Penschuck, C Weyand
arXiv preprint arXiv:1905.06706, 2019
62019
Efficient shortest paths in scale-free networks with underlying hyperbolic geometry
T Bläsius, C Freiberger, T Friedrich, M Katzmann, F Montenegro-Retana, ...
arXiv preprint arXiv:1805.03253, 2018
62018
Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem.
M Katzmann, C Komusiewicz
AAAI, 846-852, 2017
52017
A practical maximum clique algorithm for matching with pairwise constraints
AP Bustos, TJ Chin, F Neumann, T Friedrich, M Katzmann
arXiv preprint arXiv:1902.01534, 2019
42019
Solving vertex cover in polynomial time on hyperbolic random graphs
T Bläsius, P Fischbeck, T Friedrich, M Katzmann
arXiv preprint arXiv:1904.12503, 2019
32019
Towards a systematic evaluation of generative network models
T Bläsius, T Friedrich, M Katzmann, A Krohmer, J Striebel
International Workshop on Algorithms and Models for the Web-Graph, 99-114, 2018
32018
Unbounded discrepancy of deterministic random walks on grids
T Friedrich, M Katzmann, A Krohmer
International Symposium on Algorithms and Computation, 212-222, 2015
32015
Hyperbolic Embeddings for Near-Optimal Greedy Routing
T Bläsius, T Friedrich, M Katzmann, A Krohmer
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and …, 2018
22018
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
T Bläsius, T Friedrich, M Katzmann
arXiv preprint arXiv:2010.02787, 2020
2020
Hyperbolic Embeddings for Near-Optimal Greedy Routing
T Bläsius, T Friedrich, M Katzmann, A Krohmer
Journal of Experimental Algorithmics (JEA) 25 (1), 1-18, 2020
2020
A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints
A Parra Bustos, TJ Chin, F Neumann, T Friedrich, M Katzmann
arXiv, arXiv: 1902.01534, 2019
2019
Unbounded Discrepancy of Deterministic Random Walks on Grids
T Friedrich, M Katzmann, A Krohmer
SIAM Journal on Discrete Mathematics 32 (4), 2441-2452, 2018
2018
Embedding Networks into the Hyperbolic Plane
T Bläsius, T Friedrich, M Katzmann, A Krohmer
BOOK OF ABSTRACTS Macfang| BCN 2017 5, 7, 2015
2015
The system can't perform the operation now. Try again later.
Articles 1–13