Leandro Montero

According to our database, Leandro Montero authored at least 20 papers between 2009 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

On the edge-biclique graph and the iterated edge-biclique operator.

Leandro Montero, Sylvain Legay

J. Graph Theory, 2022

Vertex removal in biclique graphs.

Leandro Montero

Discret. Appl. Math., 2022

2019

On the Iterated Edge-Biclique Operator.

Sylvain Legay, Leandro Montero

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

Tropical dominating sets in vertex-coloured graphs.

Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Abdelhakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza

J. Discrete Algorithms, 2018

Safe sets in graphs: Graph classes and structural parameters.

Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu

J. Comb. Optim., 2018

2017

Proper Hamiltonian Paths in Edge-Coloured Multigraphs.

Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero

Graphs Comb., 2017

Proper Hamiltonian cycles in edge-colored multigraphs.

Raquel Águeda, Valentin Borozan, Raquel Díaz, Yannis Manoussakis, Leandro Montero

Discret. Math., 2017

Distances between bicliques and structural properties of bicliques in graphs.

Marina Groshaus, Leandro Montero

CoRR, 2017

Finding Suspicious Activities in Financial Transactions and Distributed Ledgers.

Ramiro Daniel Camino, Radu State, Leandro Montero, Petko Valtchev

Proceedings of the 2017 IEEE International Conference on Data Mining Workshops, 2017

2016

Almost every graph is divergent under the biclique operator.

Marina Groshaus, André Luiz Pires Guedes, Leandro Montero

Discret. Appl. Math., 2016

Tropical Dominating Sets in Vertex-Coloured Graphs.

Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, Narayanan Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.

Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Tight lower bounds on the number of bicliques in false-twin-free graphs.

Marina Groshaus, Leandro Montero

Electron. Notes Discret. Math., 2015

Further results on strong edge-colourings in outerplanar graphs.

Valentin Borozan, Leandro Montero, Narayanan Narayanan

Australas. J Comb., 2015

2014

Linear time algorithm for deciding the behavior of a graph under the iterated biclique operator.

Marina Groshaus, André Luiz Pires Guedes, Leandro Montero

CoRR, 2014

2013

On the Iterated Biclique Operator.

Marina Groshaus, Leandro Montero

J. Graph Theory, 2013

2012

Graphs and colors : edge-colored graphs, edge-colorings and proper connections. (Graphes et couleurs : graphes arêtes-coloriés, coloration d'arêtes et connexité propre).

Leandro Pedro Montero

PhD thesis, 2012

Proper connection of graphs.

Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza

Discret. Math., 2012

2011

Proper Hamiltonian Paths in Edge-Colored Multigraphs.

Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero

Electron. Notes Discret. Math., 2011

2009

The number of convergent graphs under the biclique operator with no twin vertices is finite.

Marina Groshaus, Leandro Pedro Montero

Electron. Notes Discret. Math., 2009