Ioannis Lamprou

Ioannis Lamprou

Research Scientist

Huawei Paris Research Center

Algorithm Design · Combinatorial Optimization · Machine Learning Systems

About

I am a Research Scientist at the Huawei Paris Research Center. I obtained my PhD at the Department of Computer Science, University of Liverpool. My recent work spans algorithm design, combinatorial optimization, and machine learning systems. I develop approximation algorithms and hardness results for combinatorial problems and apply algorithmic thinking to practical infrastructure challenges.

Conference Publications

2026

Domination and Coverage Problems under Vulnerability Constraints

I. Lamprou, N. Lazaropoulos, I. Sigalas, I. Vaxevanakis, V. Zissimopoulos

IWOCA 2026, Springer LNCS, vol. 16587, pp. 415-429, Clermont-Ferrand, France
2023

Safe Optimized Static Memory Allocation for Parallel Deep Learning

I. Lamprou, Z. Zhang, J. de Juan, H. Yang, Y. Lai, E. Filhol, C. Bastoul

MLSys 2023, Miami Beach, FL, USA
2022

Fault-Tolerant Total Domination via Submodular Function Approximation

I. Lamprou, I. Sigalas, I. Vaxevanakis, V. Zissimopoulos

TAMC 2022, Springer LNCS, vol. 13571, pp. 281-292, Tianjin, China
2020

Cops and Robbers on Dynamic Graphs: Offline and Online Case

S. Balev, J.L. Jiménez Laredo, I. Lamprou, Y. Pigné, E. Sanlaville

SIROCCO 2020, 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

IWOCA 2020, Springer LNCS, vol. 12126, pp. 368-381, Bordeaux, France
2018

Maximum Rooted Connected Expansion

I. Lamprou, R. Martin, S. Schewe, I. Sigalas, V. Zissimopoulos

MFCS 2018, LIPIcs, vol. 117, pp. 25:1-25:14, Liverpool, UK
2017

Cover Time in Edge-Uniform Stochastically-Evolving Graphs

I. Lamprou, R. Martin, P. Spirakis

SSS 2017, Springer LNCS, vol. 10616, pp. 441-455, Boston, MA, USA
2017

Perpetually Dominating Large Grids

I. Lamprou, R. Martin, S. Schewe

CIAC 2017, Springer LNCS, vol. 10236, pp. 393-404, Athens, Greece
2016

Fast Two-Robot Disk Evacuation with Wireless Communication

I. Lamprou, R. Martin, S. Schewe

DISC 2016, Springer LNCS, vol. 9888, pp. 1-15, Paris, France

Journal Articles

2026

Approximations for Fault-Tolerant Total and Partial Positive Influence Domination

I. Lamprou, I. Sigalas, I. Vaxevanakis, V. Zissimopoulos

Discrete Mathematics & Theoretical Computer Science, vol. 28:2
2023

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
2021

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
2020

Fast Two-Robot Disk Evacuation with Wireless Communication

I. Lamprou, R. Martin, S. Schewe

Theoretical Computer Science, vol. 846, pp. 38-60
2019

Eternally Dominating Large Grids

I. Lamprou, R. Martin, S. Schewe

Theoretical Computer Science, vol. 794, pp. 27-46
2018

Cover Time in Edge-Uniform Stochastically-Evolving Graphs

I. Lamprou, R. Martin, P. Spirakis

Algorithms, 11(10), 149
2015

Connected Surveillance Game

F. Giroire, I. Lamprou, D. Mazauric, N. Nisse, S. Pérennes, R. Soares

Theoretical Computer Science, vol. 584, pp. 131-143