Zobrazeno 1 - 10
of 480
pro vyhledávání: '"Olivier Durand"'
Publikováno v:
Sciences, Eaux & Territoires, Iss 40 (2022)
En Maine-et-Loire, un partenariat Chambre d’agriculture, Fédération de chasse, Centre permanent d’initiative pour l’environnement, École supérieure d’agricultures et Conseil départemental agit depuis plus de dix ans en faveur d’une mei
Externí odkaz:
https://doaj.org/article/acc9cb5bf9044046ace4b8e85c663f4a
Autor:
Bienlo Flora Zerbo, Mircea Modreanu, Ian Povey, Jun Lin, Antoine Létoublon, Alain Rolland, Laurent Pédesseau, Jacky Even, Bruno Lépine, Pascal Turban, Philippe Schieffer, Alain Moréac, Olivier Durand
Publikováno v:
Crystals, Vol 12, Iss 10, p 1363 (2022)
Silicon-based heterojunction (SHJ) solar cells demonstrate high efficiencies over their homojunction counterparts, revealing the potential of such technologies. We present here the first steps towards the development of molybdenum disulfide (MoS2)/c-
Externí odkaz:
https://doaj.org/article/887267700e23466da84f3d01a9d76452
Autor:
Jacky Even, Laurent Pedesseau, Eric Tea, Samy Almosni, Alain Rolland, Cédric Robert, Jean-Marc Jancu, Charles Cornet, Claudine Katan, Jean-François Guillemoles, Olivier Durand
Publikováno v:
International Journal of Photoenergy, Vol 2014 (2014)
Potentialities of density functional theory (DFT) based methodologies are explored for photovoltaic materials through the modeling of the structural and optoelectronic properties of semiconductor hybrid organic-inorganic perovskites and GaAs/GaP hete
Externí odkaz:
https://doaj.org/article/7613b63b15c9464aa5e2312924e305e2
Autor:
de Gevigney, Olivier Durand
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees with orientation constraints is NP-complete. If P $\neq$ NP then this disproves a conjecture of Recski.
Comment: 5 pages, 2 figures
Comment: 5 pages, 2 figures
Externí odkaz:
http://arxiv.org/abs/1304.3613
Autor:
de Gevigney, Olivier Durand
We disprove a conjecture of Frank stating that each weakly 2k-connected has a k-vertex-connected orientation. For k at least 3, we also prove that the problem of deciding whether a graph has a k-vertex-connected orientation is NP-complete.
Externí odkaz:
http://arxiv.org/abs/1212.4086
A graph G is called (2k, k)-connected if G is 2k-edge-connected and G-v is k-edge-connected for every vertex v. The study of (2k, k)-connected graphs is motivated by a conjecture of Frank which states that a graph has a 2-vertex-connected orientation
Externí odkaz:
http://arxiv.org/abs/1207.5357
We provide the directed counterpart of a slight extension of Katoh and Tanigawa's result on rooted-tree decompositions with matroid constraints. Our result characterises digraphs having a packing of arborescences with matroid constraints. It is a pro
Externí odkaz:
http://arxiv.org/abs/1207.1985
We prove that every (6k + 2l, 2k)-connected simple graph contains k rigid and l connected edge-disjoint spanning subgraphs. This implies a theorem of Jackson and Jord\'an [4] and a theorem of Jord\'an [6] on packing of rigid spanning subgraphs. Both
Externí odkaz:
http://arxiv.org/abs/1201.3727
Autor:
de Gévigney, Olivier Durand, Meunier, Frédéric, Popa, Christian, Reygner, Julien, Romero, Ayrin
In the present paper, we study algorithmic questions for the arc-intersection graph of directed paths on a tree. Such graphs are known to be perfect (proved by Monma and Wei in 1986). We present faster algorithms than all previously known algorithms
Externí odkaz:
http://arxiv.org/abs/0902.1182
Autor:
Gary-Bobo, Haneen Omar, Sara Jakimoska, Julia Guillot, Edreese Alsharaeh, Clarence Charnay, Frédérique Cunin, Aurélie Bessière, Jean-Olivier Durand, Laurence Raehm, Laure Lichon, Mélanie Onofre, Magali
Publikováno v:
Molecules; Volume 28; Issue 14; Pages: 5335
Dendritic mesoporous organosilica nanoparticles (DMON) are a new class of biodegradable nanoparticles suitable for biomolecule delivery. We studied the photochemical internalization (PCI) and photodynamic therapy (PDT) of DMON to investigate new ways