( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?

, , , , , и . ICALP, том 132 из LIPIcs, стр. 131:1-131:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Eleni Ayalew Belay

Eleni Tsitsoni

Eleni Butulussi

Eleni Marini

Eleni Jelastopulu

 

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

How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?, , , , , и . ICALP, том 132 из LIPIcs, стр. 131:1-131:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Temporal flows in temporal networks., , , , и . J. Comput. Syst. Sci., (2019)Temporal Flows in Temporal Networks., , , , и . CIAC, том 10236 из Lecture Notes in Computer Science, стр. 43-54. (2017)The Temporal Explorer Who Returns to the Base., , и . CIAC, том 11485 из Lecture Notes in Computer Science, стр. 13-24. Springer, (2019)Ephemeral networks with random availability of links: The case of fast networks., , , и . J. Parallel Distributed Comput., (2016)A Paraphrase Identification Approach in Paragraph length texts., , , и . EDM, International Educational Data Mining Society, (2022)Ephemeral networks with random availability of links: diameter and connectivity., , , и . SPAA, стр. 267-276. ACM, (2014)On Verifying and Maintaining Connectivity of Interval Temporal Networks., и . ALGOSENSORS, том 9536 из Lecture Notes in Computer Science, стр. 142-154. Springer, (2015)Temporal Vertex Cover with a Sliding Time Window., , , и . ICALP, том 107 из LIPIcs, стр. 148:1-148:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Designing and Testing Temporally Connected Graphs., , , и . CoRR, (2015)