Anton Krohmer
Anton Krohmer
Google Germany GmbH, Munich, Germany
Bestätigte E-Mail-Adresse bei google.com - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
492012
On the diameter of hyperbolic random graphs
T Friedrich, A Krohmer
SIAM Journal on Discrete Mathematics 32 (2), 1314-1334, 2018
452018
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
402018
Cliques in hyperbolic random graphs
T Friedrich, A Krohmer
2015 IEEE Conference on Computer Communications (INFOCOM), 1544-1552, 2015
302015
Hyperbolic random graphs: Separators and treewidth
T Bläsius, T Friedrich, A Krohmer
24th Annual European Symposium on Algorithms (ESA 2016), 2016
172016
RatFish: a file sharing protocol provably secure against rational users
M Backes, O Ciobotaru, A Krohmer
European Symposium on Research in Computer Security, 607-625, 2010
172010
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
162012
Cliques in hyperbolic random graphs
T Bläsius, T Friedrich, A Krohmer
Algorithmica 80 (8), 2324-2344, 2018
152018
De-anonymization of heterogeneous random graphs in quasilinear time
K Bringmann, T Friedrich, A Krohmer
European Symposium on Algorithms, 197-208, 2014
142014
Parameterized clique on scale-free networks
T Friedrich, A Krohmer
International Symposium on Algorithms and Computation, 659-668, 2012
142012
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
112017
Parameterized clique on inhomogeneous random graphs
T Friedrich, A Krohmer
Discrete Applied Mathematics 184, 130-138, 2015
112015
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
72017
De-anonymization of heterogeneous random graphs in quasilinear time
K Bringmann, T Friedrich, A Krohmer
Algorithmica 80 (11), 3397-3427, 2018
32018
Towards a systematic evaluation of generative network models
T Bläsius, T Friedrich, M Katzmann, A Krohmer, J Striebel
International Workshop on Algorithms and Models for the Web-Graph, 99-114, 2018
32018
Hyperbolic embeddings for near-optimal greedy routing
T Bläsius, T Friedrich, M Katzmann, A Krohmer
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and …, 2018
32018
Unbounded discrepancy of deterministic random walks on grids
T Friedrich, M Katzmann, A Krohmer
International Symposium on Algorithms and Computation, 212-222, 2015
32015
Finding Cliques in Scale-Free Networks
A Krohmer
Master's thesis, Saarland University, Germany, 2012
32012
A rational secret sharing scheme robust against malicious players
N Altabari, A Krohmer, H Molter, T Tarrach
32009
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
2020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20