From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Compact Routing in Unit Disk Graphs.

W. Mulzer, и M. Willert. ISAAC, том 181 из LIPIcs, стр. 16:1-16:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Routing in polygonal domains.B. Banyassady, M. Chiu, M. Korman, W. Mulzer, A. van Renssen, M. Roeloffzen, P. Seiferth, Y. Stein, B. Vogtenhuber, и M. Willert. Comput. Geom., (2020)Routing in Polygonal Domains.B. Banyassady, M. Chiu, M. Korman, W. Mulzer, A. van Renssen, M. Roeloffzen, P. Seiferth, Y. Stein, B. Vogtenhuber, и M. Willert. ISAAC, том 92 из LIPIcs, стр. 10:1-10:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Routing and Stabbing.M. Willert. Free University of Berlin, Germany, (2021)Stabbing Pairwise Intersecting Disks by Five Points.S. Har-Peled, H. Kaplan, W. Mulzer, L. Roditty, P. Seiferth, M. Sharir, и M. Willert. ISAAC, том 123 из LIPIcs, стр. 50:1-50:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Routing in Histograms.M. Chiu, J. Cleve, K. Klost, M. Korman, W. Mulzer, A. van Renssen, M. Roeloffzen, и M. Willert. WALCOM, том 12049 из Lecture Notes in Computer Science, стр. 43-54. Springer, (2020)Compact Routing in Unit Disk Graphs.W. Mulzer, и M. Willert. ISAAC, том 181 из LIPIcs, стр. 16:1-16:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)