default search action
Maximilian Katzmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Tobias Friedrich, Andreas Göbel
, Maximilian Katzmann, Leon Schiller:
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. SIAM J. Discret. Math. 38(2): 1943-2000 (2024) - [c17]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Real-World Networks Are Low-Dimensional: Theoretical and Practical Assessment. IJCAI 2024: 2036-2044 - [i17]Thomas Bläsius, Jean-Pierre von der Heydt, Maximilian Katzmann, Nikolai Maas:
Weighted Embeddings for Low-Dimensional Graph Representation. CoRR abs/2410.06042 (2024) - 2023
- [b1]Maximilian Katzmann:
About the analysis of algorithms on networks with underlying hyperbolic geometry (Über die Analyse von Algorithmen auf Netzwerken mit zugrundeliegender hyperbolischer Geometrie). University of Potsdam, Germany, 2023 - [j6]Thomas Bläsius
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. Algorithmica 85(12): 3487-3520 (2023) - [j5]Thomas Bläsius
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Theory Comput. Syst. 67(1): 28-51 (2023) - [c16]Davin Jeong, Allison Gunby-Mann, Sarel Cohen, Maximilian Katzmann, Chau Pham, Arnav Bhakta, Tobias Friedrich, Peter Chin:
Deep Distance Sensitivity Oracles. COMPLEX NETWORKS (1) 2023: 452-463 - [c15]Thomas Bläsius
On the Giant Component of Geometric Inhomogeneous Random Graphs. ESA 2023: 20:1-20:13 - [c14]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. ICALP 2023: 62:1-62:13 - [c13]Thomas Bläsius
Strongly Hyperbolic Unit Disk Graphs. STACS 2023: 13:1-13:17 - [c12]Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm:
Partitioning the Bags of a Tree Decomposition into Cliques. SEA 2023: 3:1-3:19 - [d1]Vanja Doskoc
Code for: Faster Nearest Neighbors Queries on Geographic Data. Zenodo, 2023 - [i16]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. CoRR abs/2302.04113 (2023) - [i15]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
A simple statistic for determining the dimensionality of complex networks. CoRR abs/2302.06357 (2023) - [i14]Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm:
Partitioning the Bags of a Tree Decomposition Into Cliques. CoRR abs/2302.08870 (2023) - [i13]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif:
On the Giant Component of Geometric Inhomogeneous Random Graphs. CoRR abs/2306.09506 (2023) - [i12]Thomas Bläsius, Maximilian Katzmann, Clara Stegehuis:
Maximal Cliques in Scale-Free Random Graphs. CoRR abs/2309.02990 (2023) - 2022
- [j4]Thomas Bläsius
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. 10(4): 361-380 (2022) - [j3]Thomas Bläsius
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ACM Trans. Algorithms 18(2): 19:1-19:32 (2022) - [c11]Tobias Friedrich
Algorithms for Hard-Constraint Point Processes via Discretization. COCOON 2022: 242-254 - [c10]Sebastian Angrick
Towards explainable real estate valuation via evolutionary algorithms. GECCO 2022: 1130-1138 - [i11]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik:
Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials. CoRR abs/2204.01793 (2022) - [i10]Davin Jeong, Chau Pham, Arnav Bhakta, Sarel Cohen, Maximilian Katzmann, Tobias Friedrich, Sang (Peter) Chin:
Deep Distance Sensitivity Oracles. CoRR abs/2211.02681 (2022) - 2021
- [c9]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. ESA 2021: 20:1-20:15 - [c8]Thomas Bläsius
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. SEA 2021: 22:1-22:18 - [i9]Thomas Bläsius
Routing in Strongly Hyperbolic Unit Disk Graphs. CoRR abs/2107.05518 (2021) - [i8]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca
Algorithms for general hard-constraint point processes via discretization. CoRR abs/2107.08848 (2021) - [i7]Sebastian Angrick, Ben Bals, Niko Hastrich, Maximilian Kleissl, Jonas Schmidt, Vanja Doskoc, Maximilian Katzmann, Louise Molitor, Tobias Friedrich:
Towards Explainable Real Estate Valuation via Evolutionary Algorithms. CoRR abs/2110.05116 (2021) - [i6]Tobias Friedrich, Maximilian Katzmann, Leon Schiller:
Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane. CoRR abs/2112.02553 (2021) - 2020
- [j2]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ACM J. Exp. Algorithmics 25: 1-18 (2020) - [c7]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. STACS 2020: 25:1-25:14 - [i5]Thomas Bläsius
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR abs/2010.02787 (2020)
2010 – 2019
- 2019
- [c6]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA 2019: 21:1-21:14 - [i4]Álvaro Parra Bustos, Tat-Jun Chin, Frank Neumann, Tobias Friedrich, Maximilian Katzmann:
A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints. CoRR abs/1902.01534 (2019) - [i3]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann:
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. CoRR abs/1904.12503 (2019) - [i2]Thomas Bläsius
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR abs/1905.06706 (2019) - 2018
- [j1]Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Unbounded Discrepancy of Deterministic Random Walks on Grids. SIAM J. Discret. Math. 32(4): 2441-2452 (2018) - [c5]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ALENEX 2018: 199-208 - [c4]Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry:
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ICALP 2018: 20:1-20:14 - [c3]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel
Towards a Systematic Evaluation of Generative Network Models. WAW 2018: 99-114 - [i1]Thomas Bläsius
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR abs/1805.03253 (2018) - 2017
- [c2]Maximilian Katzmann, Christian Komusiewicz:
Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem. AAAI 2017: 846-852 - 2015
- [c1]Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Unbounded Discrepancy of Deterministic Random Walks on Grids. ISAAC 2015: 212-222
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-19 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: