Author:
Akrida Eleni C.,Gąsieniec Leszek,Mertzios George B.,Spirakis Paul G.
Funder
Engineering and Physical Sciences Research Council
European Commission
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference33 articles.
1. Akrida, E.C., Gąsieniec, L., Mertzios, G.B., Spirakis, P.G.: Ephemeral networks with random availability of links: diameter and connectivity. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2014)
2. Akrida, E.C., Gąsieniec, L., Mertzios, G.B., Spirakis, P.G.: On temporally connected graphs of small cost. In: Proceedings of the 13th Workshop on Approximation and Online Algorithms (WAOA) (2015)
3. Akrida, E.C., Spirakis, P.G.: On verifying and maintaining connectivity of interval temporal networks. In: Bose, P., Gasieniec, L.A., Römer, K., Wattenhofer, R. (eds.) Algorithms for Sensor Systems - 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, September 17–18, 2015, Revised Selected Papers, Lecture Notes in Computer Science, vol. 9536, pp 142–154. Springer, Patras, Greece (2015). doi: 10.1007/978-3-319-28472-9_11
4. Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Proceedings of the Third Italian Conference on Algorithms and Complexity, CIAC ’97, pp 288–298. Springer, London, UK (1997). http://dl.acm.org/citation.cfm?id=648256.752884
5. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput., 235–253 (2006)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献