Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Myriam Preiss"'
Publikováno v:
Sustainability; Volume 14; Issue 21; Pages: 13976
Western Europe’s agrifood systems are highly developed, extremely complex, and dependably produce food for billions. Securing their functionality is imperative whilst dealing with varieties of major challenges and opportunities in the future. Multi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=multidiscipl::5948acae8a5dce3f5b116c74adf7c1c4
Autor:
Irini Pateraki, Myriam Preiss, Albert Boronat, Emilio Centeno, Carmen Romero-Segura, Thomas J. Bach, Edith Forestier, Hubert Schaller, Sylvain Darnet, Vincent Compagnon, Anne Berna
Publikováno v:
Digital.CSIC. Repositorio Institucional del CSIC
instname
Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona
Scientific Reports
Scientific Reports, Nature Publishing Group, 2019, 9, pp.4840. ⟨10.1038/s41598-019-40905-y⟩
Scientific Reports, Vol 9, Iss 1, Pp 1-12 (2019)
instname
Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona
Scientific Reports
Scientific Reports, Nature Publishing Group, 2019, 9, pp.4840. ⟨10.1038/s41598-019-40905-y⟩
Scientific Reports, Vol 9, Iss 1, Pp 1-12 (2019)
Euphorbia lathyris was proposed about fifty years ago as a potential agroenergetic crop. The tremendous amounts of triterpenes present in its latex has driven investigations for transforming this particular biological fluid into an industrial hydroca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56c2c62ad600f129ffa064971791351a
https://doi.org/10.1038/s41598-019-40905-y
https://doi.org/10.1038/s41598-019-40905-y
Exact values for three domination-like problems in circular and infinite grid graphs of small height
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 21 no. 3, Iss Graph Theory (2019)
In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs o
Externí odkaz:
https://doaj.org/article/a934efee596a4867804dd16d5219879e
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no. 1, Iss Graph Theory (2015)
Graph Theory
Externí odkaz:
https://doaj.org/article/9c1f4c05cc864845895ffc7b0133db3c