The following pages link to Maximilian Katzmann (Q2701065):
Displaying 15 items.
- Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
- Unbounded Discrepancy of Deterministic Random Walks on Grids (Q3459862) (← links)
- Unbounded Discrepancy of Deterministic Random Walks on Grids (Q4691168) (← links)
- (Q5002689) (← links)
- Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. (Q5075758) (← links)
- Hyperbolic Embeddings for Near-Optimal Greedy Routing (Q5232738) (← links)
- (Q5874296) (← links)
- Towards a Systematic Evaluation of Generative Network Models (Q5881231) (← links)
- Hyperbolic Embeddings for Near-Optimal Greedy Routing (Q6039932) (← links)
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)
- Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane (Q6159913) (← links)
- Cliques in high-dimensional geometric inhomogeneous random graphs (Q6572998) (← links)
- Strongly hyperbolic unit disk graphs (Q6615114) (← links)
- Cliques in high-dimensional geometric inhomogeneous random graphs (Q6638064) (← links)
- On the giant component of geometric inhomogeneous random graphs (Q6656961) (← links)
