| 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 | 49 | 2012 |
| On the diameter of hyperbolic random graphs T Friedrich, A Krohmer SIAM Journal on Discrete Mathematics 32 (2), 1314-1334, 2018 | 46 | 2018 |
| 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 | 40 | 2018 |
| Cliques in hyperbolic random graphs T Friedrich, A Krohmer 2015 IEEE Conference on Computer Communications (INFOCOM), 1544-1552, 2015 | 30 | 2015 |
| Hyperbolic random graphs: Separators and treewidth T Bläsius, T Friedrich, A Krohmer 24th Annual European Symposium on Algorithms (ESA 2016), 2016 | 18 | 2016 |
| Cliques in hyperbolic random graphs T Bläsius, T Friedrich, A Krohmer Algorithmica 80 (8), 2324-2344, 2018 | 17 | 2018 |
| 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 | 17 | 2010 |
| 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 | 16 | 2012 |
| De-anonymization of heterogeneous random graphs in quasilinear time K Bringmann, T Friedrich, A Krohmer European Symposium on Algorithms, 197-208, 2014 | 14 | 2014 |
| Parameterized clique on scale-free networks T Friedrich, A Krohmer International Symposium on Algorithms and Computation, 659-668, 2012 | 14 | 2012 |
| 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 | 13 | 2017 |
| Parameterized clique on inhomogeneous random graphs T Friedrich, A Krohmer Discrete Applied Mathematics 184, 130-138, 2015 | 11 | 2015 |
| 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 | 7 | 2017 |
| De-anonymization of heterogeneous random graphs in quasilinear time K Bringmann, T Friedrich, A Krohmer Algorithmica 80 (11), 3397-3427, 2018 | 3 | 2018 |
| 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 | 3 | 2018 |
| 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 | 3 | 2018 |
| Unbounded discrepancy of deterministic random walks on grids T Friedrich, M Katzmann, A Krohmer International Symposium on Algorithms and Computation, 212-222, 2015 | 3 | 2015 |
| Finding Cliques in Scale-Free Networks A Krohmer Master's thesis, Saarland University, Germany, 2012 | 3 | 2012 |
| A rational secret sharing scheme robust against malicious players N Altabari, A Krohmer, H Molter, T Tarrach | 3 | 2009 |
| 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 |
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyVerified email at hpi.de
