Maximilian Katzmann

Research Interest

I am interested in Theoretical Computer Science and focus on graphs and their connections to the hyperbolic space.

Publications

2023

•  

  Bläsius, Thomas; Fischbeck, Philipp; Friedrich, Tobias; Katzmann, MaximilianSolving Vertex Cover in Polynomial Time on Hyperbolic Random GraphsTheory of Computing Systems 2023: 28–51

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Ruff, Janosch; Zeif, ZienaOn the Giant Component of Geometric Inhomogeneous Random GraphsEuropean Symposium on Algorithms (ESA) 2023: 20:1–20:13

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Friedrich, Tobias; Göbel, Andreas; Katzmann, Maximilian; Schiller, LeonCliques in High-Dimensional Geometric Inhomogeneous Random GraphsInternational Colloquium on Automata, Languages and Programming (ICALP) 2023: 62:1–62:13

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Stephan, DanielStrongly Hyperbolic Unit Disk GraphsSymposium Theoretical Aspects of Computer Science (STACS) 2023: 13:1–13:17

  [ ][ ][ URL ][ DOI ][ Download ]

2022

•  

  Bläsius, Thomas; Freiberger, Cedric; Friedrich, Tobias; Katzmann, Maximilian; Montenegro-Retana, Felix; Thieffry, MarianneEfficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic GeometryACM Transactions on Algorithms 2022: 1–32

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Friedrich, Tobias; Göbel, Andreas; Katzmann, Maximilian; Krejca, Martin S.; Pappik, MarcusAlgorithms for hard-constraint point processes via discretizationInternational Computing and Combinatorics Conference (COCOON) 2022: 242–254

  [ ][ ][ DOI ][ Download ]

•  

  Angrick, Sebastian; Bals, Ben; Hastrich, Niko; Kleissl, Maximilian; Schmidt, Jonas; Doskoč, Vanja; Katzmann, Maximilian; Molitor, Louise; Friedrich, TobiasTowards Explainable Real Estate Valuation via Evolutionary AlgorithmsGenetic and Evolutionary Computation Conference (GECCO) 2022: 1130–1138

  [ ][ ][ URL ][ DOI ][ Download ]

2021

•  

  Bläsius, Thomas; Friedrich, Tobias; Katzmann, MaximilianEfficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic GeometryEuropean Symposium on Algorithms (ESA) 2021: 20:1–20:15

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Bläsius, Thomas; Friedrich, Tobias; Katzmann, MaximilianForce-Directed Embedding of Scale-Free Networks in the Hyperbolic PlaneSymposium on Experimental Algorithms (SEA) 2021: 22:1–22:18

  [ ][ ][ URL ][ DOI ][ Download ]

2020

•  

  Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Krohmer, AntonHyperbolic Embeddings for Near-Optimal Greedy RoutingJournal of Experimental Algorithmics (JEA) 2020: 1–18

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Bläsius, Thomas; Fischbeck, Philipp; Friedrich, Tobias; Katzmann, MaximilianSolving Vertex Cover in Polynomial Time on Hyperbolic Random GraphsSymposium on the Theoretical Aspects of Computer Science (STACS) 2020: 25:1–25:14

  [ ][ ][ URL ][ DOI ][ Download ]

2019

•  

  Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Meyer, Ulrich; Penschuck, Manuel; Weyand, ChristopherEfficiently Generating Geometric Inhomogeneous and Hyperbolic Random GraphsEuropean Symposium on Algorithms (ESA) 2019: 21:2–21:14

  EATCS Best Paper Award

  [ ][ ][ URL ][ DOI ][ Download ]

2018

•  

  Friedrich, Tobias; Katzmann, Maximilian; Krohmer, AntonUnbounded Discrepancy of Deterministic Random Walks on GridsSIAM Journal on Discrete Mathematics 2018: 2441–2452

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Krohmer, AntonHyperbolic Embeddings for Near-Optimal Greedy RoutingAlgorithm Engineering and Experiments (ALENEX) 2018: 199–208

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Bläsius, Thomas; Freiberger, Cedric; Friedrich, Tobias; Katzmann, Maximilian; Montenegro-Retana, Felix; Thieffry, MarianneEfficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic GeometryInternational Colloquium on Automata, Languages, and Programming (ICALP) 2018: 20:1–20:14

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Krohmer, Anton; Striebel, JonathanTowards a Systematic Evaluation of Generative Network ModelsWorkshop on Algorithms and Models for the Web Graph (WAW) 2018: 99–114

  [ ][ ][ URL ][ DOI ][ Download ]

2017

•  

  Katzmann, Maximilian; Komusiewicz, ChristianSystematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover ProblemConference on Artificial Intelligence (AAAI) 2017: 846–852

  [ ][ ][ URL ][ Download ]

2015

•  

  Friedrich, Tobias; Katzmann, Maximilian; Krohmer, AntonUnbounded Discrepancy of Deterministic Random Walks on GridsInternational Symposium on Algorithms and Computation (ISAAC) 2015: 212–222

  [ ][ ][ DOI ][ Download ]

Short C.V.