( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Algorithms for Landmark Hub Labeling.

. ISAAC, том 248 из LIPIcs, стр. 5:1-5:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Sabine Storandt

Beate Storandt

Ralf Storandt

Frieder Storandt

Sabine Schwertel

Hochsegmentierte CVD-Diamant-Detektoren und hochauflösende Impulsmessungen in Knockout-Reaktionen. TU München, (2009)
 

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

Maximum Gap Minimization in Polylines., и . W2GIS, том 12473 из Lecture Notes in Computer Science, стр. 181-196. Springer, (2020)A Repository of Network-Constrained Trajectory Data (Position Paper)., и . MOVE++@SIGSPATIAL, стр. 5:1-5:4. ACM, (2019)Placement of Loading Stations for Electric Vehicles: No Detours Necessary!, , и . AAAI, стр. 417-423. AAAI Press, (2014)Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks (Extended Abstract)., , и . IJCAI, стр. 4730-4734. ijcai.org, (2021)Customizable Hub Labeling: Properties and Algorithms., и . COCOON, том 13595 из Lecture Notes in Computer Science, стр. 345-356. Springer, (2022)Consistent Simplification of Polyline Tree Bundles., , , , и . COCOON, том 13025 из Lecture Notes in Computer Science, стр. 231-243. Springer, (2021)Group Diagrams for Simplified Representation of Scanpaths., , , и . VINCI, стр. 7:1-7:8. ACM, (2022)Exact and Approximate Hierarchical Hub Labeling., и . WALCOM, том 14549 из Lecture Notes in Computer Science, стр. 194-211. Springer, (2024)Growing Balls in ℝd., , , , , , и . ALENEX, стр. 247-258. SIAM, (2017)Algorithms for Landmark Hub Labeling.. ISAAC, том 248 из LIPIcs, стр. 5:1-5:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)