I am a recent PhD graduate. I studied graph theory under the supervision of Prof. Vadim Lozin. My thesis' main focus is the interplay between various graph parameters and hereditary classes. Among other things, it deals with questions of the form: how can we characterise boundedness of parameter $p$ within universe $X$?

Here is my CV (updated September 2021).

I have now moved to the University of Leeds (webpage pending).

Research interests

Graph theory (in any of its many flavours - structural, algorithmic, algebraic, extremal, enumerative, ...), permutation patterns, Ramsey theory, well-quasi-orderability, combinatorics in general.

Publications and preprints

B. Alecu, A. Atminas, V. Lozin, D. Malyshev, Combinatorics and algorithms for quasi-chain graphs. Preprint available at https://arxiv.org/abs/2104.04471

B. Alecu, V. Lozin, D. Malyshev. Critical properties of bipartite permutation graphs, European J. Combin., Submitted. Preprint available at https://arxiv.org/abs/2010.14467

B. Alecu, V. Lozin, D. de Werra. The micro-world of cographs, Discrete Applied Mathematics, Submitted. Extended abstract available at https://doi.org/10.1007/978-3-030-48966-3_3

B. Alecu, A. Atminas, V. Lozin, V. Zamaraev. Graph classes with linear Ramsey numbers, Discrete Mathematics 344(4) (2021), Article 112307. https://doi.org/10.1016/j.disc.2021.112307

B. Alecu, A. Atminas, V. Lozin. Graph Functionality, J. Combin. Theory B 141 (2021), 139-158. https://doi.org/10.1016/j.jctb.2020.11.002

B. Alecu, V. Lozin, D. de Werra, V. Zamaraev. Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition, Discrete Applied Mathematics 283 (2020), 482-494. https://doi.org/10.1016/j.dam.2020.01.038

B. Alecu, M. Kanté, V. Lozin, V. Zamaraev. Between clique-width and linear clique-width of bipartite graphs, Discrete Mathematics 343(8) (2020), Article 111926. https://doi.org/10.1016/j.disc.2020.111926

E-mail: B.Alecu@leeds.ac.uk