About Me

Associate Professor - École d'Ingénieurs - IMT Atlantique.
PhD - Université Paris-Sud.
MSc Computer Science - Universidad de Buenos Aires.

Research interests

Graph theory, algorithms, complexity and theoretical computer science.

Contact Me

Email:
firstname.lastname [at] imt-atlantique.fr

Studies

PhD - Université Paris-Sud, France - 2012.

Thesis: "Graph and colors: Edge-colored graphs, edge-colorings and proper connections". Advisor: Prof. Yannis Manoussakis. Available HERE!

MSc Computer Science - Universidad de Buenos Aires, Argentina - 2008.

Thesis: "Convergence and divergence of the iterated biclique graph". Advisor: Prof. Marina Groshaus. Available in spanish HERE!

Teaching

École d'Ingénieurs - IMT Atlantique Nantes (2024-present)

.

École d'Ingénieurs - ISEN Nantes (2018-2024)

Algorithms and programming in C; PHP; JavaScript; Graph theory, algorithms and complexity, Introduction to language theory.

Université Paris-Sud (2010-2016)

Graph theory; Algorithms, data structures and complexity; Operational research; C, C++ & Java programming.

Universidad de Buenos Aires (2004-2009)

Mathematics; Calculus; Graph theory; Algorithms, data structures and complexity; C++ and Java programming.

Research

My research domain is mainly discrete mathematics and theoretical computer science, centered on graph theory.
In particular:

Structural graph theory.

Algorithms and complexity.

Vertex and edge colorings, and vertex and edge colored graphs.

Hamiltonian cycles and paths.

Intersection graphs, clique graphs and biclique graphs.

Iterated graph operators.

Publications

L. Montero: "Vertex removal in biclique graphs", Discrete Applied Mathematics, Vol 323: 302-310 (2022).

L. Montero, S. Legay: "On the edge-biclique graph and the iterated edge-biclique operator", Journal of Graph Theory. Vol 100(2): 232-251 (2022).

M. Groshaus, L. Montero: "Structural properties of biclique graphs and the distance formula", The Autralasian Journal of Combinatorics. Vol 81(2): 301-318 (2021).

R. Agueda, N. Cohen, S. Fujita, S. Legay, Y. Manoussakis, Y. Matsui, L. Montero, R. Naserasr, H. Ono, Y. Otachi, T. Sakuma, Zs. Tuza, R. Xu: "Safe sets in graphs: Graph classes and structural parameters", Journal of Combinatorial Optimization 36(4): 1221-1242 (2018).

J.-A. Anglès d'Auriac, Cs. Bujtás, A. El Maftouhi, M. Karpinski, Y. Manoussakis, L. Montero, N. Narayanan, L. Rosaz, J. Thapper, Zs. Tuza: "Tropical dominating sets in vertex-coloured graphs", Journal of Discrete Algorithms 48: 27-41 (2018).

R. Agueda, V. Borozan, R. Diaz, Y. Manoussakis, L. Montero: "Proper hamiltonian cycles in edge-colored multigraphs", Discrete Mathematics 340(8): 1897-1902 (2017).

R. Agueda, V. Borozan, Y. Manoussakis, L. Montero, M. Groshaus, G. Mendy: "Proper Hamiltonian Paths in Edge-Coloured Multigraphs", Graphs and Combinatorics 33(4): 617-633 (2017).

M. Groshaus, A. Guedes, L. Montero: "Almost every graph is divergent under the biclique operator", Discrete Applied Mathematics 201: 130-140 (2016).

M. Groshaus, L. Montero: "Tight lower bounds on the number of bicliques in false-twin-free graphs", Theoretical Computer Sciences 636: 77-84 (2016).

V. Borozan, L. Montero, N. Narayanan: "Futher results on strong edge-colourings in outerplanar graphs", The Autralasian Journal of Combinatorics. Vol 62(1): 35-44 (2015).

M. Groshaus, L. Montero: "On the Iterated Biclique Operator". Journal of Graph Theory 73(2): 181-190 (2013).

V. Borozan, S. Fujita, A. Gerek, C. Magnant, Y. Manoussakis, L. Montero, Zs. Tuza: "Proper connection of graphs". Discrete Mathematics 312(17): 2550-2560 (2012).