BOSNIA AND

,Q WKH ILUVW SDUW RI WKH WKHVLV ZH GHPRQVWUDWH WKH H[LVWHQFH RI WKUHH UHJLPHV RI WKH 153 GLVFKDUJH LQ DLU DW DWPRVSKHULF SUHVVXUH DQG DW D IL[HG WHPSHUDWXUH RI. DQG WKHQ ZH

Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of

$IWHUVHYHUDOIHUPHQWDWLRQVWKHORVVHVRIPDVVEHWZHHQWKH EHJLQQLQJDQGWKHHQGRIWKHIHUPHQWDWLRQHYROYHLQWKHVDPH SURSRUWLRQV LQGHSHQGHQWO\ RI WKH TXDQWLW\ XVHG

Aujourd’hui, l’Inra et le Cirad sont confrontés à des interrogations de nature éthique qui portent sur les principes permettant de guider leurs choix en matière de thèmes et

MPI’s remote memory access interface defines one-sided communication operations, data consistency, and synchronization models for accessing memory regions that are exposed through

2ZLQJ WR WKH GUDPDWLF LPSURYHPHQWV LQ LPDJLQJ WHFKQRORJ\ LW LV QRZ SRVVLEOH WR PHDVXUH NLQH PDWLF ILHOGV DW D ODUJH QXPEHU RI SRLQWV RYHU VSHFLPHQ VXUIDFH RIWHQ UHIHUUHG WR

$EVWUDFW $)0 DQG UHODWHG HOHFWULFDO SUREH WHFKQLTXHVDVHOHFWURVWDWLFIRUFHPLFURVFRSH()0 FDQ SHUIRUP LQMHFWLRQ DQG GHWHFWLRQ RI HOHFWULF FKDUJHV LQ QDQRVWUXFWXUHV RU R[LGH OD\HU DW

In this subsection, we prove that computing the proper orientation number of a graph is still NP -hard for planar bipartite graphs of bounded degree.. The idea of our reduction