About the analysis of algorithms on networks with underlying hyperbolic geometry (Über die Analyse von Algorithmen auf Netzwerken mit zugrundeliegender hyperbolischer Geometrie)

[BibT_eX]

[DOI]

Maximilian Katzmann

PhD thesis, 2023

Maximal Cliques in Scale-Free Random Graphs.

[BibT_eX]

[DOI]

Thomas Bläsius

Maximilian Katzmann

Clara Stegehuis

CoRR, 2023

A simple statistic for determining the dimensionality of complex networks.

[BibT_eX]

[DOI]

CoRR, 2023

Partitioning the Bags of a Tree Decomposition into Cliques.

[BibT_eX]

[DOI]

Thomas Bläsius

Maximilian Katzmann

Marcus Wilhelm

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Strongly Hyperbolic Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

On the Giant Component of Geometric Inhomogeneous Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Deep Distance Sensitivity Oracles.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks & Their Applications XII, 2023

2022

Efficiently generating geometric inhomogeneous and hyperbolic random graphs.

[BibT_eX]

[DOI]

Netw. Sci., December, 2022

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

[BibT_eX]

[DOI]

Felix Montenegro-Retana

Marianne Thieffry

ACM Trans. Algorithms, 2022

Deep Distance Sensitivity Oracles.

[BibT_eX]

[DOI]

CoRR, 2022

Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials.

[BibT_eX]

[DOI]

CoRR, 2022

Towards explainable real estate valuation via evolutionary algorithms.

[BibT_eX]

[DOI]

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Algorithms for Hard-Constraint Point Processes via Discretization.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane.

[BibT_eX]

[DOI]

Tobias Friedrich

Maximilian Katzmann

Leon Schiller

CoRR, 2021

Algorithms for general hard-constraint point processes via discretization.

[BibT_eX]

[DOI]

CoRR, 2021

Routing in Strongly Hyperbolic Unit Disk Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

Thomas Bläsius

Tobias Friedrich

Maximilian Katzmann

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2020

Hyperbolic Embeddings for Near-Optimal Greedy Routing.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2020

2019

A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Unbounded Discrepancy of Deterministic Random Walks on Grids.

[BibT_eX]

[DOI]

Tobias Friedrich

Maximilian Katzmann

Anton Krohmer

SIAM J. Discret. Math., 2018

Towards a Systematic Evaluation of Generative Network Models.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018

2017

Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem.

[BibT_eX]

[DOI]

Maximilian Katzmann

Christian Komusiewicz

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Maximilian Katzmann

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...