Ioannis Lamprou

yiannis.lamprou AT gmail DOT com

Profile

I am a Senior Research Engineer at the Huawei Paris Research Center.

I obtained my PhD in 2018 at the Department of Computer Science, University of Liverpool.

My academic interests span Algorithm Design, Combinatorial Optimization and Systems for Machine Learning.

For any queries, feel free to contact me via e-mail.

Publications (arxiv) , (scholar)

Conferences

Safe Optimized Static Memory Allocation for Parallel Deep Learning, I. Lamprou, Z. Zhang, J. de Juan, H. Yang, Y. Lai, E. Filhol, C. Bastoul 6th Conference on Machine Learning and Systems (MLSys), Proceedings, 2023.

Fault-Tolerant Total Domination via Submodular Function Approximation, I. Lamprou, I. Sigalas, I. Vaxevanakis, V. Zissimopoulos, 17th Annual Conference on Theory and Applications of Models of Computation (TAMC), Springer LNCS, vol. 13571, pp. 281-292, Tianjin, China, 2022.

Cops and Robbers on Dynamic Graphs: Offline and Online Case, S. Balev, J.L. Jiménez Laredo, I. Lamprou, Y. Pigné, E. Sanlaville, 27th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS, vol. 12156, pp. 203-219, Paderborn, Germany, 2020.

Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination, I. Lamprou, I.Sigalas, V. Zissimopoulos, 31st International Workshop on Combinatorial Algorithms (IWOCA), Springer LNCS, vol. 12126, pp. 368-381, Bordeaux, France, 2020.

Maximum Rooted Connected Expansion, I. Lamprou, R. Martin, S. Schewe, I. Sigalas, V. Zissimopoulos, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS), LIPIcs, vol. 117, pp. 25:1-25:14, Liverpool, UK, 2018.

Cover Time in Edge-Uniform Stochastically-Evolving Graphs, I. Lamprou, R. Martin, P. Spirakis, 19th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS), Springer LNCS, vol. 10616, pp. 441-455, Boston, MA, USA, 2017.

Perpetually Dominating Large Grids, I. Lamprou, R. Martin, S. Schewe, 10th International Conference on Algorithms and Complexity (CIAC), Springer LNCS, vol. 10236, pp. 393-404, Athens, Greece, 2017.

Fast Two-Robot Disk Evacuation with Wireless Communication, I. Lamprou, R. Martin, S. Schewe, 30th International Symposium on DIStributed Computing (DISC), Springer LNCS, vol. 9888, pp. 1-15, Paris, France, 2016.

Journals

Cops and Robbers on Dynamic Graphs: Offline and Online Case, S. Balev, J.L. Jiménez Laredo, I. Lamprou, Y. Pigné, E. Sanlaville, Discrete Mathematics & Theoretical Computer Science, vol. 25:1, 2023.

Maximum Rooted Connected Expansion, I. Lamprou, R. Martin, S. Schewe, I. Sigalas, V. Zissimopoulos, Theoretical Computer Science, vol. 873, pp. 25-37, 2021.

Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination, I. Lamprou, I. Sigalas, V. Zissimopoulos, Theoretical Computer Science, vol. 858, pp. 1-12, 2021.

Fast Two-Robot Disk Evacuation with Wireless Communication, I. Lamprou, R. Martin, S. Schewe, Theoretical Computer Science, vol. 846, pp. 38-60, 2020.

Eternally Dominating Large Grids, I. Lamprou, R. Martin, S. Schewe, Theoretical Computer Science, vol. 794, pp. 27-46, 2019.

Cover Time in Edge-Uniform Stochastically-Evolving Graphs, I. Lamprou, R. Martin, P. Spirakis, Algorithms, 11(10), 149, 2018.

Connected Surveillance Game, F. Giroire, I. Lamprou, D. Mazauric, N. Nisse, S. Pérennes, R. Soares, Theoretical Computer Science, vol. 584, pp. 131-143, 2015.