( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Deep Distance Sensitivity Oracles.

, , , , , , и . CoRR, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Heini Katzmann

Ute Katzmann

Luise Katzmann

Horst Katzmann

Margarethe Katzmann

 

Другие публикации лиц с тем же именем

A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints., , , , и . CoRR, (2019)Maximal Cliques in Scale-Free Random Graphs., , и . CoRR, (2023)Towards Explainable Real Estate Valuation via Evolutionary Algorithms., , , , , , , , и . CoRR, (2021)Strongly Hyperbolic Unit Disk Graphs., , , и . STACS, том 254 из LIPIcs, стр. 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Deep Distance Sensitivity Oracles., , , , , , и . CoRR, (2022)Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane., , и . CoRR, (2021)Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry., , и . ESA, том 204 из LIPIcs, стр. 20:1-20:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs., , , , , и . CoRR, (2019)Deep Distance Sensitivity Oracles., , , , , , , и . COMPLEX NETWORKS (1), том 1141 из Studies in Computational Intelligence, стр. 452-463. Springer, (2023)Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry., , , , , и . ACM Trans. Algorithms, 18 (2): 19:1-19:32 (2022)