( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Surveillance of SARS-CoV-2 in Urban Wastewater in Italy.

, , , , , , , , , , , , , и . ICDH, стр. 117-122. IEEE, (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 Mirkovic

Elisabeth Mirkowitsch

Jelena Mirkovi

Milijana Mirkovic-Hösle

Mijo Mirkovi

 

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

Blackout-tolerant temporal spanners., , , , и . J. Comput. Syst. Sci., (мая 2024)Finding single-source shortest p-disjoint paths: fast computation and sparse preservers., , , , , и . CoRR, (2021)Blackout-Tolerant Temporal Spanners., , , , и . ALGOSENSORS, том 13707 из Lecture Notes in Computer Science, стр. 31-44. Springer, (2022)Augmented Reality App to improve quality of life of people with cognitive and sensory disabilities., , , и . MetroInd4.0&IoT, стр. 59-62. IEEE, (2020)On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games., , , , и . FUN, том 100 из LIPIcs, стр. 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem., , , , и . SIROCCO, том 12810 из Lecture Notes in Computer Science, стр. 167-184. Springer, (2021)Sparse Temporal Spanners with Low Stretch., , , , и . ESA, том 244 из LIPIcs, стр. 19:1-19:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers., , , , , и . STACS, том 219 из LIPIcs, стр. 12:1-12:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)New approximation algorithms for the heterogeneous weighted delivery problem., , , , и . Theor. Comput. Sci., (2022)Surveillance of SARS-CoV-2 in Urban Wastewater in Italy., , , , , , , , , и 4 other автор(ы). ICDH, стр. 117-122. IEEE, (2022)