RatFish: A File Sharing Protocol Provably Secure against Rational Users. - Michael Backes 001; Oana Ciobotaru; Anton Krohmer (ESORICS, 2010)

Efficient algorithms for extracting biological key pathways with global constraints. - Jan Baumbach; Tobias Friedrich 001; Timo Kötzing; Anton Krohmer; Joachim Müller; Josch Pauling (GECCO, 2012)

Parameterized Clique on Scale-Free Networks. - Tobias Friedrich 001; Anton Krohmer (ISAAC, 2012)

Cliques in hyperbolic random graphs. - Tobias Friedrich 001; Anton Krohmer (INFOCOM, 2015)

Parameterized clique on inhomogeneous random graphs. - Tobias Friedrich 001; Anton Krohmer (Discret. Appl. Math., 2015)

Hyperbolic Random Graphs: Separators and Treewidth. - Thomas Bläsius; Tobias Friedrich 001; Anton Krohmer (ESA, 2016)

Structures & algorithms in hyperbolic random graphs (Strukturen & Algorithmen in Hyperbolischen Zufallsgraphen) - Anton Krohmer (2016)

Phase Transitions for Scale-Free SAT Formulas. - Tobias Friedrich 001; Anton Krohmer; Ralf Rothenberger; Andrew M. Sutton (AAAI, 2017)

Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. - Tobias Friedrich 001; Anton Krohmer; Ralf Rothenberger; Thomas Sauerwald; Andrew M. Sutton (ESA, 2017)

Towards a Systematic Evaluation of Generative Network Models. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Anton Krohmer; Jonathan Striebel (WAW, 2018)

Cliques in Hyperbolic Random Graphs. - Thomas Bläsius; Tobias Friedrich 001; Anton Krohmer (Algorithmica, 2018)

De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. - Karl Bringmann; Tobias Friedrich 001; Anton Krohmer (Algorithmica, 2018)

On the Diameter of Hyperbolic Random Graphs. - Tobias Friedrich 001; Anton Krohmer (SIAM J. Discret. Math., 2018)

Unbounded Discrepancy of Deterministic Random Walks on Grids. - Tobias Friedrich 001; Maximilian Katzmann; Anton Krohmer (SIAM J. Discret. Math., 2018)

Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. - Thomas Bläsius; Tobias Friedrich 001; Anton Krohmer; Sören Laue (IEEE/ACM Trans. Netw., 2018)

Hyperbolic Embeddings for Near-Optimal Greedy Routing. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Anton Krohmer (ACM J. Exp. Algorithmics, 2020)