Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Leandro Montero"'
Autor:
Sebastian David Duque Muñoz, Byron Leandro Montero Muñoz, Henry Raúl González Brito, Yaimí Trujillo Casañola
Publikováno v:
Serie Científica de la Universidad de las Ciencias Informáticas, Vol 17, Iss 7, Pp 144-157 (2024)
El objetivo de la investigación fue explorar las vulnerabilidades de ataques de inyección SQL, visto desde las temáticas trabajadas en investigaciones recientes y los reportes internacionales. La metodología consistió en la revisión sistemátic
Externí odkaz:
https://doaj.org/article/65b06bbeff0541999651cb25ab1ced84
Autor:
Leandro Montero, Sylvain Legay
Publikováno v:
Journal of Graph Theory
Journal of Graph Theory, Wiley, 2021, ⟨10.1002/jgt.22775⟩
Journal of Graph Theory, Wiley, 2021, ⟨10.1002/jgt.22775⟩
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa3025a2e0d9937904be191a241dff55
https://hal.archives-ouvertes.fr/hal-03460810
https://hal.archives-ouvertes.fr/hal-03460810
Autor:
Leandro Montero
A \textit{biclique} is a maximal induced complete bipartite subgraph. The \textit{biclique graph} of a graph $H$, denoted by $KB(H)$, is the intersection graph of the family of all bicliques of $H$. In this work we address the following question: Giv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dcdde6a79d8fc05e7c3a56b281c20e57
http://arxiv.org/abs/2006.04583
http://arxiv.org/abs/2006.04583
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2017, 340 (8), pp.1897-1902. ⟨10.1016/j.disc.2017.03.013⟩
Discrete Mathematics, Elsevier, 2017, 340 (8), pp.1897-1902. ⟨10.1016/j.disc.2017.03.013⟩
A $c$-edge-colored multigraph has each edge colored with one of the $c$ available colors and no two parallel edges have the same color. A proper Hamiltonian cycle is a cycle containing all the vertices of the multigraph such that no two adjacent edge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::320525c8c798106580858f0da7b971e8
https://doi.org/10.1016/j.disc.2017.03.013
https://doi.org/10.1016/j.disc.2017.03.013
Autor:
Raquel Águeda, Yannis Manoussakis, Marina Groshaus, Valentin Borozan, Gervais Mendy, Leandro Montero
Publikováno v:
Graphs and Combinatorics. 33:617-633
Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an edge-coloured mult
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d4d7db8268c05c4dff5f9e52781b230
https://doi.org/10.1007/s00373-017-1803-6
https://doi.org/10.1007/s00373-017-1803-6
Autor:
Leandro Montero, Sylvain Legay
Publikováno v:
Electronic Notes in Theoretical Computer Science
Electronic Notes in Theoretical Computer Science, Elsevier, 2019, 346, pp.577-587. ⟨10.1016/j.entcs.2019.08.051⟩
LAGOS
Electronic Notes in Theoretical Computer Science, Elsevier, 2019, 346, pp.577-587. ⟨10.1016/j.entcs.2019.08.051⟩
LAGOS
A biclique of a graph G is a maximal induced complete bipartite subgraph of G. The edge-biclique graph of G, KBe(G), is the edge-intersection graph of the bicliques of G. A graph G diverges (resp. converges or is periodic) under an operator H wheneve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ccada29cce72136ed37816f1c8c4ede0
https://hal.archives-ouvertes.fr/hal-02972036
https://hal.archives-ouvertes.fr/hal-02972036
Autor:
Marina Groshaus, Leandro Montero
Publikováno v:
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
A \emph{biclique} is a maximal bipartite complete induced subgraph of $G$. Bicliques have been studied in the last years motivated by the large number of applications. In particular, enumeration of the maximal bicliques has been of interest in data a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd6b7cc31f435222e7c32718783d5598
https://doi.org/10.1016/j.tcs.2016.05.027
https://doi.org/10.1016/j.tcs.2016.05.027
Publikováno v:
ICDM Workshops
Banks and financial institutions around the world must comply with several policies for the prevention of money laundering and in order to combat the financing of terrorism. Nowadays, there is a raise in the popularity of novel financial technologies
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::974f4681d2343551a33889cc8a521b9e
https://doi.org/10.1109/icdmw.2017.109
https://doi.org/10.1109/icdmw.2017.109
Autor:
Nathann Cohen, Yota Otachi, Sylvain Legay, Raquel Águeda, Renyu Xu, Yannis Manoussakis, Shinya Fujita, Yasuko Matsui, Leandro Montero, Tadashi Sakuma, Hirotaka Ono, Zsolt Tuza, Reza Naserasr
Publikováno v:
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization, Springer Verlag, 2017, pp.1-22. ⟨10.1007/s10878-017-0205-2⟩
Journal of Combinatorial Optimization, Springer Verlag, 2017, pp.1-22. ⟨10.1007/s10878-017-0205-2⟩
A safe set of a graph \(G=(V,E)\) is a non-empty subset S of V such that for every component A of G[S] and every component B of \(G[V \setminus S]\), we have \(|A| \ge |B|\) whenever there exists an edge of G between A and B. In this paper, we show t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e6341c8c4c2d1185d78e5343448c4f1
https://hal.archives-ouvertes.fr/hal-01644491
https://hal.archives-ouvertes.fr/hal-01644491
Autor:
Leandro Montero, Zsolt Tuza, Csilia Bujtás, Hakim El Maftouhi, Laurent Rosaz, N. Narayanan, Johan Thapper, Marek Karpinski, Yannis Manoussakis, Jean Alexandre Anglés D’Auriac
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783319301389
WALCOM
WALCOM
Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating sets from structural and algorithmic points of view. First, we prove that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::635d51f5a2c1410a50d34412c72295ce
https://doi.org/10.1007/978-3-319-30139-6_2
https://doi.org/10.1007/978-3-319-30139-6_2