Search Results - "Charon, I."

Identifying and locating-dominating codes: NP-completeness results for directed graphs by Charon, I., Hudry, O., Lobstein, A.

“…Let G=(V, A) be a directed, asymmetric graph and C a subset of vertices, and let B/sub r//sup -/(v) denote the set of all vertices x such that there exists a…”
Get full text

Protective effect of neurotrophic factors, neuropoietic cytokines and dibutyryl cyclic amp on hydrogen peroxide-induced cytotoxicity on PC12 cells: a possible link with the state of differentiation by Charon, I, Zuin-Kornmann, G, Bataille, S, Schorderet, M

“…We present evidence that the survival of PC12 cells exposed to hydroxyl radicals generated by hydrogen peroxide applied for 30 min at 1 mM was effective when…”
Get full text

Self-tuning of the noising methods by Charon, I., Hudry, O.

“…Self-tuning of the noising methods…”
Get full text

Discriminating codes in bipartite graphs by Charbit, E., Charon, I., Cohen, G., Hudry, O.

“…We study some combinatorial and algorithmic properties of discriminating codes in bipartite graphs. In particular, we provide bounds on minimum discriminating…”
Get full text

A linear algorithm for minimum 1-identifying codes in oriented trees by Charon, Irène, Gravier, Sylvain, Hudry, Olivier, Lobstein, Antoine, Mollard, Michel, Moncel, Julien

“…Consider an oriented graph G = ( V , A ) , a subset of vertices C ⊆ V , and an integer r ⩾ 1 ; for any vertex v ∈ V , let B r - ( v ) denote the set of all…”
Get full text

Application of the "descent with mutations" metaheuristic to a clique partitioning problem by Charon, I., Hudry, O.

“…We study here the application of a metaheuristic, issued from the noising methods and that we call "descent with mutations", to a problem arising in the field…”
Get full text

New results on the computation of median orders by Charon, I., Guénoche, A., Hudry, O., Woirgard, F.

“…In this paper, we deal with the following problem: given a weighted tournament T, determine a minimum-weighted set of arcs of T such that reversing these arcs…”
Get full text

A 16-vertex tournament for which Banks set and Slater set are disjoint by CHARON, I, HUDRY, O, WOIRGARD, F

Get full text

Valeur du rehaussement annulaire pour le diagnostic des lesions fonctionnelles ovariennes en IRM by Mazet, N., Charon, I., Hoa, D., Viala-Trentini, M., Filhastre, M., Maubon, A., Rouanet, J.P.

“…Evaluer le rehaussement pariétal d’une lésion ovarienne en IRM pour essayer de différencier les caractères fonctionnel et organique. Revue rétrospective de 225…”
Get full text

Constructing covering codes via noising by Charon, I., Hudry, O., Lobstein, A.

“…We show how a combinatorial optimization method, the noising method, can be used for constructing covering codes. The noising method is based on descent…”
Get full text