default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnton Krohmer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2016
[b1]Anton Krohmer:
Structures & algorithms in hyperbolic random graphs (Strukturen & Algorithmen in Hyperbolischen Zufallsgraphen). University of Potsdam, Germany, 2016
Journal Articles
- 2020
- [j7]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ACM J. Exp. Algorithmics 25: 1-18 (2020) - 2018
- [j6]Thomas Bläsius, Tobias Friedrich, Anton Krohmer
:
Cliques in Hyperbolic Random Graphs. Algorithmica 80(8): 2324-2344 (2018) - [j5]Karl Bringmann, Tobias Friedrich, Anton Krohmer:
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. Algorithmica 80(11): 3397-3427 (2018) - [j4]Tobias Friedrich, Anton Krohmer:
On the Diameter of Hyperbolic Random Graphs. SIAM J. Discret. Math. 32(2): 1314-1334 (2018) - [j3]Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Unbounded Discrepancy of Deterministic Random Walks on Grids. SIAM J. Discret. Math. 32(4): 2441-2452 (2018) - [j2]Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue:
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. IEEE/ACM Trans. Netw. 26(2): 920-933 (2018) - 2015
- [j1]Tobias Friedrich, Anton Krohmer:
Parameterized clique on inhomogeneous random graphs. Discret. Appl. Math. 184: 130-138 (2015)
Conference and Workshop Papers
- 2018
- [c13]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ALENEX 2018: 199-208 - [c12]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel:
Towards a Systematic Evaluation of Generative Network Models. WAW 2018: 99-114 - 2017
- [c11]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton:
Phase Transitions for Scale-Free SAT Formulas. AAAI 2017: 3893-3899 - [c10]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton:
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. ESA 2017: 37:1-37:15 - 2016
- [c9]Thomas Bläsius, Tobias Friedrich, Anton Krohmer:
Hyperbolic Random Graphs: Separators and Treewidth. ESA 2016: 15:1-15:16 - [c8]Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue:
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. ESA 2016: 16:1-16:18 - 2015
- [c7]Tobias Friedrich, Anton Krohmer:
On the Diameter of Hyperbolic Random Graphs. ICALP (2) 2015: 614-625 - [c6]Tobias Friedrich, Anton Krohmer:
Cliques in hyperbolic random graphs. INFOCOM 2015: 1544-1552 - [c5]Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Unbounded Discrepancy of Deterministic Random Walks on Grids. ISAAC 2015: 212-222 - 2014
- [c4]Karl Bringmann, Tobias Friedrich, Anton Krohmer:
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. ESA 2014: 197-208 - 2012
- [c3]Jan Baumbach, Tobias Friedrich, Timo Kötzing, Anton Krohmer, Joachim Müller, Josch Pauling:
Efficient algorithms for extracting biological key pathways with global constraints. GECCO 2012: 169-176 - [c2]Tobias Friedrich, Anton Krohmer:
Parameterized Clique on Scale-Free Networks. ISAAC 2012: 659-668 - 2010
- [c1]Michael Backes, Oana Ciobotaru, Anton Krohmer:
RatFish: A File Sharing Protocol Provably Secure against Rational Users. ESORICS 2010: 607-625
Informal and Other Publications
- 2017
- [i2]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton:
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. CoRR abs/1706.08431 (2017) - 2015
- [i1]Tobias Friedrich, Anton Krohmer:
On the diameter of hyperbolic random graphs. CoRR abs/1512.00184 (2015)
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-04-24 23:15 CEST 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:
