Follow
Anton Krohmer
Anton Krohmer
Google Germany GmbH, Munich, Germany
Verified email at google.com - Homepage
Title
Cited by
Cited by
Year
Efficient embedding of scale-free graphs in the hyperbolic plane
T Bläsius, T Friedrich, A Krohmer, S Laue
IEEE/ACM transactions on Networking 26 (2), 920-933, 2018
792018
On the diameter of hyperbolic random graphs
T Friedrich, A Krohmer
SIAM Journal on Discrete Mathematics 32 (2), 1314-1334, 2018
782018
Efficient key pathway mining: combining networks and OMICS data
N Alcaraz, T Friedrich, T Kötzing, A Krohmer, J Müller, J Pauling, ...
Integrative Biology 4 (7), 756-764, 2012
552012
Cliques in hyperbolic random graphs
T Friedrich, A Krohmer
2015 IEEE Conference on Computer Communications (INFOCOM), 1544-1552, 2015
422015
Cliques in hyperbolic random graphs
T Bläsius, T Friedrich, A Krohmer
Algorithmica 80, 2324-2344, 2018
342018
Hyperbolic random graphs: Separators and treewidth
T Bläsius, T Friedrich, A Krohmer
24th Annual European Symposium on Algorithms (ESA 2016), 2016
322016
Phase transitions for scale-free SAT formulas
T Friedrich, A Krohmer, R Rothenberger, A Sutton
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
252017
Hyperbolic embeddings for near-optimal greedy routing
T Bläsius, T Friedrich, M Katzmann, A Krohmer
Journal of Experimental Algorithmics (JEA) 25, 1-18, 2020
212020
De-anonymization of heterogeneous random graphs in quasilinear time
K Bringmann, T Friedrich, A Krohmer
Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014
182014
Efficient algorithms for extracting biological key pathways with global constraints
J Baumbach, T Friedrich, T Kötzing, A Krohmer, J Müller, J Pauling
Proceedings of the 14th annual conference on Genetic and evolutionary …, 2012
182012
RatFish: a file sharing protocol provably secure against rational users
M Backes, O Ciobotaru, A Krohmer
Computer Security–ESORICS 2010: 15th European Symposium on Research in …, 2010
172010
Bounds on the satisfiability threshold for power law distributed random SAT
T Friedrich, A Krohmer, R Rothenberger, T Sauerwald, AM Sutton
arXiv preprint arXiv:1706.08431, 2017
152017
Parameterized clique on scale-free networks
T Friedrich, A Krohmer
International Symposium on Algorithms and Computation, 659-668, 2012
152012
Parameterized clique on inhomogeneous random graphs
T Friedrich, A Krohmer
Discrete Applied Mathematics 184, 130-138, 2015
142015
Towards a systematic evaluation of generative network models
T Bläsius, T Friedrich, M Katzmann, A Krohmer, J Striebel
Algorithms and Models for the Web Graph: 15th International Workshop, WAW …, 2018
112018
De-anonymization of heterogeneous random graphs in quasilinear time
K Bringmann, T Friedrich, A Krohmer
Algorithmica 80, 3397-3427, 2018
52018
Unbounded discrepancy of deterministic random walks on grids
T Friedrich, M Katzmann, A Krohmer
International Symposium on Algorithms and Computation, 212-222, 2015
52015
Structures & algorithms in hyperbolic random graphs
A Krohmer
Universität Potsdam, 2016
42016
A rational secret sharing scheme robust against malicious players
N Altabari, A Krohmer, H Molter, T Tarrach
32009
Finding Cliques in Scale-Free Networks
A Krohmer
Master's thesis, Saarland University, Germany, 2012
22012
The system can't perform the operation now. Try again later.
Articles 1–20