Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Daniel M. Martin"'
Autor:
Patricio G. Schlottmann, José D. Luna, Natalia Labat, María Belén Yadarola, Silvina Bainttein, Evangelina Esposito, Agustina Ibañez, Evangelina Ivón Barbaro, Alejandro Álvarez Mendiara, Carolina P. Picotti, Andrea Chirino Misisian, Luciana Andreussi, Julieta Gras, Luciana Capalbo, Mauro Visotto, José E. Dipierri, Emilio Alcoba, Laura Fernández Gabrielli, Silvia Ávila, María Emilia Aucar, Daniel M. Martin, Gerardo Juan Ormaechea, M. Eugenia Inga, Aníbal A. Francone, Martin Charles, Tamara Zompa, Pablo Javier Pérez, Vanesa Lotersztein, Pedro J. Nuova, Ivana B. Canonero, Omar A. Mahroo, Michel Michaelides, Gavin Arno, Malena Daich Varela
Publikováno v:
npj Genomic Medicine, Vol 8, Iss 1, Pp 1-9 (2023)
Abstract This study corresponds to the first large-scale genetic analysis of inherited eye diseases (IED) in Argentina and describes the comprehensive genetic profile of a large cohort of patients. Medical records of 22 ophthalmology and genetics ser
Externí odkaz:
https://doaj.org/article/a4196dab4d534e369ef825091e1bfe14
Publikováno v:
The Minerals, Metals & Materials Series ISBN: 9783031062117
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::722ad7b9fd8f09860339c81b0d7d44e4
https://doi.org/10.1007/978-3-031-06212-4_60
https://doi.org/10.1007/978-3-031-06212-4_60
Publikováno v:
Graphs and Combinatorics. 34:1147-1158
Let k be a positive integer and let F and $$H_{1}, H_{2}, \ldots , H_{k}$$ be simple graphs. The proper-Ramsey number $$pr_{k}(F; H_{1}, H_{2}, \ldots , H_{k})$$ is the minimum integer n such that any k-coloring of the edges of $$K_{n}$$ contains eit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5ac99224b0c3db9b06f11726fda0d9f
https://doi.org/10.1007/s00373-018-1955-z
https://doi.org/10.1007/s00373-018-1955-z
Autor:
Domingos Dellamonica, Vojtěch Rödl, Subrahmanyam Kalyanasundaram, Daniel M. Martin, Asaf Shapira
Publikováno v:
Combinatorics, Probability and Computing. 24:407-437
In this paper we prove that two local conditions involving the degrees and co-degrees in a graph can be used to determine whether a given vertex partition is Frieze–Kannan regular. With a more refined version of these two local conditions we provid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c34b9d88ad40f70582196dd1dd76248a
https://doi.org/10.1017/s0963548314000200
https://doi.org/10.1017/s0963548314000200
Publikováno v:
Discrete Applied Mathematics. 164:400-405
We study a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B construct a triangulation on a given planar point set V. Starting from no edges, they take turns drawing one straight edge that connects two point
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18203ad676f195740b6b4b838e42878b
https://doi.org/10.1016/j.dam.2012.08.033
https://doi.org/10.1016/j.dam.2012.08.033
Publikováno v:
Discrete Applied Mathematics. 161:1805-1817
In this paper we investigate an extremal problem on binary phylogenetic trees. Given two such trees $T_1$ and $T_2$, both with leaf-set ${1,2,...,n}$, we are interested in the size of the largest subset $S \subseteq {1,2,...,n}$ of leaves in a common
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5222459011db2455e8dccb6507bf7aa8
https://doi.org/10.1016/j.dam.2013.02.037
https://doi.org/10.1016/j.dam.2013.02.037
Publikováno v:
Graphs and Combinatorics. 29:1391-1402
For a collection of graphs $${\fancyscript{G}}$$ , the distance graph of $${\fancyscript{G}}$$ is defined to be the graph containing a vertex for each graph in $${\fancyscript{G}}$$ , and an edge if the two corresponding graphs differ by exactly one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6069273976e6202a6fb06c1c42cbc0a
https://doi.org/10.1007/s00373-012-1213-8
https://doi.org/10.1007/s00373-012-1213-8
Autor:
Vojtěch Rödl, Domingos Dellamonica, Subrahmanyam Kalyanasundaram, Daniel M. Martin, Asaf Shapira
Publikováno v:
SIAM Journal on Discrete Mathematics. 26:15-29
The Frieze-Kannan regularity lemma is a powerful tool in combinatorics. It has also found applications in the design of approximation algorithms and recently in the design of fast combinatorial algorithms for boolean matrix multiplication. The algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d97f9b1f0c5e8b881f54532dbdcfd67
https://doi.org/10.1137/110846373
https://doi.org/10.1137/110846373
Publikováno v:
Electronic Notes in Discrete Mathematics. 38:743-748
In 1966, Gallai asked whether every connected graph has a vertex that is common to all its longest paths. The answer to this question is negative. We prove that the answer is positive for outerplanar graphs. Another related question was raised in 199
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1654b2e033ddc0844190e8e1e6460465
https://doi.org/10.1016/j.endm.2011.10.024
https://doi.org/10.1016/j.endm.2011.10.024
Publikováno v:
Electronic Notes in Discrete Mathematics. 37:105-110
We study a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B construct a triangulation on a given planar point set V. Starting from no edges, players R and B take turns drawing one edge that connects two poi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55fd2046d4a24d42d4367a17835818d8
https://doi.org/10.1016/j.endm.2011.05.019
https://doi.org/10.1016/j.endm.2011.05.019