Leandro Montero

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!

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

Introduction to object oriented programming, Python; Metaheuristics; TSP heuristics laboratory, Python; Inventory management; Production management;
Supply chain integrated project (SCIP); Inventory management and forecasting models; Graph theory escape game; Modeling and simulation of complex systems, Python; Corporate project management.

É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.

My research is structured around two main axes:

Axis 1: Combinatorial optimization, graph theory, algorithms and complexity.

Structural properties of graphs.

Vertex and edge colorings (network security problems).

Vertex/edge-colored graphs (e.g., web graphs).

Graph operators and intersection graphs (clique, biclique).

Extremal graphs for Hamiltonian cycles and paths (routing problems).

Axis 2: Graph-based modeling, large-scale data analysis, and logistics optimization.

Large-scale data analysis and data mining (financial transactions, stock markets).

Anomaly detection (money laundering, market abuse).

Mathematical modeling of complex environments.

Optimization and operations research for logistics systems.

J. Bensmail, M. Marin, L. Montero, A. Talon: "Highly Irregular Graph Decompositions", Theoretical Computer Science, 1029:115036 (2025).

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).

Refereed Conference Publications

S. Legay, L. Montero: "On the Iterated Edge-Biclique Operator", Electronic Notes in Theoretical Computer Science, 346: 577–587 (2019).

R. Camino, R. State, L. Montero, P. Valtchev: "Finding Suspicious Activities in Financial Transactions and Distributed Ledgers", IEEE International Conference on Data Mining Workshops (ICDM Workshops), (2017).

J.-A. Anglès d'Auriac, Cs. Bujtás, A. Maftouhi, Y. Manoussakis, L. Montero, N. Narayanan, L. Rosaz, J. Tapper, Zs. Tuza: "Tropical Dominating Sets in Vertex-Colored Graphs", WALCOM: Algorithms and Computation, LNCS 9627: 17–27, Springer (2016).

R. Agueda, N. Cohen, S. Fujita, S. Legay, Y. Manoussakis, Y. Matsui, L. Montero, R. Naserasr, Y. Otachi, T. Sakuma, Zs. Tuza, R. Xu: "Safe Sets in Graphs: Graph Classes and Structural Parameters", COCOA 2016, LNCS 10043: 241–253, Springer (2016).

M. Groshaus, L. Montero: "Tight Lower Bounds on the Number of Bicliques in False-Twin-Free Graphs", Electronic Notes in Discrete Mathematics, 50: 293–298 (2015).

R. Agueda, V. Borozan, M. Groshaus, Y. Manoussakis, G. Mendy, L. Montero: "Proper Hamiltonian Paths in Edge-Colored Multigraphs", Electronic Notes in Discrete Mathematics, 38: 5–10 (2011).

M. Groshaus, L. Montero: "The Number of Convergent Graphs under the Biclique Operator with No Twin Vertices is Finite", Electronic Notes in Discrete Mathematics, 35: 241–246 (2009).

M. Groshaus, L. Montero: "On the Iterated Biclique Operator", VI ALIO/EURO Workshop on Applied Combinatorial Optimization (2008).

Submitted Papers

J. Bensmail, L. Montero: "NSD Edge-Colourings with Strong Assignment Constraints", submitted to Graphs and Combinatorics.

J. Bensmail, L. Montero: "On the k-Clique Graph and the k-Clique Operator", submitted to Discrete Applied Mathematics.

Papers in Preparation

A. Jacq–Bodet, F. Lehuédé, L. Montero, O. Péton, N. Pierre: "An Efficient Algorithm for Cargo-Bike Routing in the Load-Dependent Pickup-and-Delivery Problem".

T. Delépine, F. Galliot, L. Montero, Y. Mogge, N. Schivre: "From Hex to Disjoint Separators".