| Efficiently generating geometric inhomogeneous and hyperbolic random graphs T Bläsius, T Friedrich, M Katzmann, U Meyer, M Penschuck, C Weyand Network Science 10 (4), 361-380, 2022 | 39 | 2022 |
| Efficient shortest paths in scale-free networks with underlying hyperbolic geometry T Bläsius, C Freiberger, T Friedrich, M Katzmann, F Montenegro-Retana, ... ACM Transactions on Algorithms (TALG) 18 (2), 1-32, 2022 | 28 | 2022 |
| 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 | 25 | 2020 |
| A practical maximum clique algorithm for matching with pairwise constraints AP Bustos, TJ Chin, F Neumann, T Friedrich, M Katzmann arXiv preprint arXiv:1902.01534 2, 2019 | 25 | 2019 |
| Systematic exploration of larger local search neighborhoods for the minimum vertex cover problem M Katzmann, C Komusiewicz Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 18 | 2017 |
| Solving vertex cover in polynomial time on hyperbolic random graphs T Bläsius, P Fischbeck, T Friedrich, M Katzmann Theory of Computing Systems 67 (1), 28-51, 2023 | 17 | 2023 |
| A practical maximum clique algorithm for matching with pairwise constraints A Parra, TJ Chin, F Neumann, T Friedrich, M Katzmann arXiv preprint arXiv:1902.01534, 2019 | 17 | 2019 |
| 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 | 13 | 2018 |
| Strongly hyperbolic unit disk graphs T Bläsius, T Friedrich, M Katzmann, D Stephan arXiv preprint arXiv:2107.05518, 2021 | 10 | 2021 |
| Cliques in high-dimensional geometric inhomogeneous random graphs T Friedrich, A Göbel, M Katzmann, L Schiller SIAM Journal on Discrete Mathematics 38 (2), 1943-2000, 2024 | 8 | 2024 |
| Force-directed embedding of scale-free networks in the hyperbolic plane T Bläsius, T Friedrich, M Katzmann 19th International Symposium on Experimental Algorithms (SEA 2021), 22: 1-22: 18, 2021 | 8 | 2021 |
| Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry T Bläsius, T Friedrich, M Katzmann Algorithmica 85 (12), 3487-3520, 2023 | 6 | 2023 |
| A simple statistic for determining the dimensionality of complex networks T Friedrich, A Göbel, M Katzmann, L Schiller arXiv e-prints, arXiv: 2302.06357, 2023 | 6 | 2023 |
| Unbounded discrepancy of deterministic random walks on grids T Friedrich, M Katzmann, A Krohmer International Symposium on Algorithms and Computation, 212-222, 2015 | 5 | 2015 |
| Algorithms for hard-constraint point processes via discretization T Friedrich, A Göbel, M Katzmann, MS Krejca, M Pappik International Computing and Combinatorics Conference, 242-254, 2022 | 4 | 2022 |
| Towards explainable real estate valuation via evolutionary algorithms S Angrick, B Bals, N Hastrich, M Kleissl, J Schmidt, V Doskoč, L Molitor, ... Proceedings of the Genetic and Evolutionary Computation Conference, 1130-1138, 2022 | 4 | 2022 |
| On the giant component of geometric inhomogeneous random graphs T Bläsius, T Friedrich, M Katzmann, J Ruff, Z Zeif arXiv preprint arXiv:2306.09506, 2023 | 3 | 2023 |
| About the analysis of algorithms on networks with underlying hyperbolic geometry M Katzmann Universität Potsdam, 2023 | 3 | 2023 |
| Partitioning the Bags of a Tree Decomposition into Cliques T Bläsius, M Katzmann, M Wilhelm arXiv preprint arXiv:2302.08870, 2023 | 2 | 2023 |
| Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials T Friedrich, A Göbel, M Katzmann, M Krejca, M Pappik arXiv preprint arXiv:2204.01793, 2022 | 2 | 2022 |
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyVerifisert e-postadresse på hpi.de