Detail page

Knowledge Web

Person

Maximilian Katzmann

Informatiker

Name	Maximilian Katzmann
Place	Potsdam (Wirkungsort) Deutschland
Academic degree	Dr.
Profession	Informatiker (characteristic profession)
Related	Universität Potsdam Hasso-Plattner-Institut für Digital Engineering
Further information	Promotion Potsdam, Universität, Digital Engineering Fakultät, 2023
Record type	Person
GND-Identifier	1283665166
Record ID	1283665166
Involved in show all Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry About the analysis of algorithms on networks with underlying hyperbolic geometry On the Giant Component of Geometric Inhomogeneous Random Graphs Partitioning the Bags of a Tree Decomposition into Cliques Strongly Hyperbolic Unit Disk Graphs Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry

Please note

The beta version does not yet contain all functions and information of the DNB portal catalogue. If you are missing information or want to order a medium, please visit the page in the DNB portal catalogue via the following link:

Katalog der Deutschen Nationalbibliothek

Maximilian Katzmann

Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry

About the analysis of algorithms on networks with underlying hyperbolic geometry

On the Giant Component of Geometric Inhomogeneous Random Graphs

Partitioning the Bags of a Tree Decomposition into Cliques

Strongly Hyperbolic Unit Disk Graphs

Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs

Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry

Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane

Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs

Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs

Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry