Author:
Akrida Eleni C.,Mertzios George B.,Spirakis Paul G.
Publisher
Springer International Publishing
Reference24 articles.
1. Aaron, E., Krizanc, D., Meyerson, E.: DMVP: foremost waypoint coverage of time-varying graphs. In: International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 29–41 (2014)
2. Akrida, E.C., Gasieniec, L., Mertzios, G.B., Spirakis, P.G.: The complexity of optimal design of temporally connected graphs. Theory Comput. Syst. 61(3), 907–944 (2017)
3. Akrida, E.C., Mertzios, G., Spirakis, P.G., Zamaraev, V.: Temporal vertex covers and sliding time windows. In: International Colloquium on Automata, Languages and Programming (ICALP) (2018)
4. Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999).
https://doi.org/10.1007/978-3-642-58412-1
5. Lecture Notes in Computer Science;S Biswas,2015
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献