Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Nícolas A. Martins"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Drug Delivery Science and Technology. :104527
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef9e853374ba652b45b29ae52d08157a
https://doi.org/10.1016/j.jddst.2023.104527
https://doi.org/10.1016/j.jddst.2023.104527
Autor:
Nícolas Fernandes Martins
Publikováno v:
Fronteiras: Journal of Social, Technological and Environmental Science, Vol 1, Iss 1, Pp 40-52 (2013)
O presente trabalho tratará do desenvolvimento de um protótipo de estação detratamento de esgoto (ETE), sendo um protótipo onde foram analisados dadosquímicos e levantamento da microfauna do lodo ativado. Foram analisados antes eapós o tratame
Externí odkaz:
https://doaj.org/article/28b46172ad85486db4f689cf7e238bb8
Publikováno v:
Revista Verde de Agroecologia e Desenvolvimento Sustentável, Vol 7, Iss 4, Pp 50-55 (2013)
A deposição contínua de diversos poluentes no ambiente é uma preocupação cada vez maior devido aos potenciais efeitos, diretos ou indiretos, na ecologia dos ambientes e na saúde humana. Dentre os poluentes, os metais podem atingir concentraç
Externí odkaz:
https://doaj.org/article/2a7a93c944e64b0e84831a934e7b8cc9
Autor:
Nathann Cohen, Nicolas Nisse, Rudini Menezes Sampaio, Nícolas A. Martins, Stéphane Pérennes, Fionn Mc Inerney
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2018, 725, pp.1-15. ⟨10.1016/j.tcs.2017.11.015⟩
Theoretical Computer Science, 2018, 725, pp.1-15. ⟨10.1016/j.tcs.2017.11.015⟩
Theoretical Computer Science, Elsevier, 2018, 725, pp.1-15. ⟨10.1016/j.tcs.2017.11.015⟩
Theoretical Computer Science, 2018, 725, pp.1-15. ⟨10.1016/j.tcs.2017.11.015⟩
International audience; We define and study the following two-player game on a graph G. Let k ∈ N *. A set of k guards is occupying some vertices of G while one spy is standing at some node. At each turn, first the spy may move along at most s edge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a64974811e161b71d5237ac83006e95e
https://doi.org/10.1016/j.tcs.2017.11.015
https://doi.org/10.1016/j.tcs.2017.11.015
Publikováno v:
Theoretical Computer Science. 707:69-76
A lid-coloring (locally identifying coloring) of a graph is a proper coloring such that, for any edge uv, if u and v have distinct closed neighborhoods, then the set of colors used on vertices of the closed neighborhoods of u and v are distinct. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b9fdf982bf5a01c662352b8d6043c31
https://doi.org/10.1016/j.tcs.2017.10.015
https://doi.org/10.1016/j.tcs.2017.10.015
Publikováno v:
Discrete Optimization. 20:1-10
Given a simple graph G , an L ( 2 , 1 ) -labelling (or λ -labelling) of G is a function c : V ( G ) → N such that | c ( x ) − c ( y ) | ≥ 2 , if x and y are neighbors and | c ( x ) − c ( y ) | ≥ 1 if x and y have a common neighbor. The spa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4fd7661dcdff732d45bc762544167049
https://doi.org/10.1016/j.disopt.2016.01.006
https://doi.org/10.1016/j.disopt.2016.01.006
Publikováno v:
Electronic Notes in Discrete Mathematics. 50:121-126
A lid-coloring (locally identifying coloring) of a graph is a proper coloring such that, for any edge uv where u and v have distinct closed neighborhoods, the set of colors used on vertices of the closed neighborhoods of u and v are also distinct. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b41f2501f7b0f5e56497ebd0c977320
https://doi.org/10.1016/j.endm.2015.07.021
https://doi.org/10.1016/j.endm.2015.07.021
Autor:
Victor Campos, Ana Silva, Leonardo Sampaio, Nícolas A. Martins, Carlos F. R. A. C. Lima, Marcio Costa Santos
Publikováno v:
Discrete Mathematics. 338:2072-2079
A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to at least one vertex in each other color class. The b-chromatic number of G is the maximum integer b ( G ) for which G has a b-c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7132b667f5021983e404913a43b3cbec
https://doi.org/10.1016/j.disc.2015.04.026
https://doi.org/10.1016/j.disc.2015.04.026
Publikováno v:
Annals of Operations Research. 217:385-397
In this paper, we obtain linear time algorithms to determine the acyclic chromatic number, the star chromatic number, the non repetitive chromatic number and the clique chromatic number of P4-tidy graphs and (q, q − 4)-graphs, for every fixed q, wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3911d055b090a81692ae2c947cbab328
https://doi.org/10.1007/s10479-014-1537-2
https://doi.org/10.1007/s10479-014-1537-2