AAAAAA

   
Results: 1-21 |
Results: 21
TREATMENT OF ALLERGIC RHINOCONJUNCTIVITIS SEEN FROM HEALTH ECONOMICALPOINT-OF-VIEW
Authors: GOLDSCHMIDT O MOSGES R LAUTERBACH K
Citation: O. Goldschmidt et al., TREATMENT OF ALLERGIC RHINOCONJUNCTIVITIS SEEN FROM HEALTH ECONOMICALPOINT-OF-VIEW, Allergologie, 21(4), 1998, pp. 68-72
THE REACTION OF NASAL-MUCOSA ON HISTAMINE PROVOCATION IN HEALTHY-SUBJECTS - A MULTICENTER-STUDY ON NASAL REACTIVITY
Authors: GOLDSCHMIDT O MOSGES R KLIMEK L HAUSWALD B SCHAPOWAL A
Citation: O. Goldschmidt et al., THE REACTION OF NASAL-MUCOSA ON HISTAMINE PROVOCATION IN HEALTHY-SUBJECTS - A MULTICENTER-STUDY ON NASAL REACTIVITY, Allergologie, 21(4), 1998, pp. 141-149
COMBINATORIAL ISSUES IN AIR-TRAFFIC OPTIMIZATION
Authors: FONDACCI R GOLDSCHMIDT O LETROUIT V
Citation: R. Fondacci et al., COMBINATORIAL ISSUES IN AIR-TRAFFIC OPTIMIZATION, Transportation science, 32(3), 1998, pp. 256-267
QUALITY ASSESSMENT USING INDICATORS FOR HOSPITAL MANAGEMENT OF OTORHINOLARYNGOLOGY PATIENTS
Authors: STREPPEL M ECKEL HE GOLDSCHMIDT O SCHRAPPE M
Citation: M. Streppel et al., QUALITY ASSESSMENT USING INDICATORS FOR HOSPITAL MANAGEMENT OF OTORHINOLARYNGOLOGY PATIENTS, HNO. Hals-, Nasen-, Ohrenarzte, 46(10), 1998, pp. 864-869
ONSET OF ACTION, EFFECTIVENESS AND TOLERANCE OF LEVOCABASTINE AND NEDOCROMIL IN TOPICAL THERAPY OF SEASONAL ALLERGIC RHINOCONJUNCTIVITIS
Authors: KREMER B TUNDERMANN A GOLDSCHMIDT O BEGINEN U GERING R KLIMEK L MODI R MOSGES R PETERS F SALBRANDT R SONDERMANN M
Citation: B. Kremer et al., ONSET OF ACTION, EFFECTIVENESS AND TOLERANCE OF LEVOCABASTINE AND NEDOCROMIL IN TOPICAL THERAPY OF SEASONAL ALLERGIC RHINOCONJUNCTIVITIS, Arzneimittel-Forschung, 48(9), 1998, pp. 924-930
K-EDGE SUBGRAPH PROBLEMS
Authors: GOLDSCHMIDT O HOCHBAUM DS
Citation: O. Goldschmidt et Ds. Hochbaum, K-EDGE SUBGRAPH PROBLEMS, Discrete applied mathematics, 74(2), 1997, pp. 159-169
LOCAL OPTIMALITY AND ITS APPLICATION ON INDEPENDENT SETS FOR K-CLAW FREE GRAPHS
Authors: GANG Y GOLDSCHMIDT O
Citation: Y. Gang et O. Goldschmidt, LOCAL OPTIMALITY AND ITS APPLICATION ON INDEPENDENT SETS FOR K-CLAW FREE GRAPHS, Journal of combinatorial optimization, 1(2), 1997, pp. 151-164
COMPLEXITY RESULTS FOR MIXED-MODEL ASSEMBLY LINES WITH APPROXIMATION ALGORITHMS FOR THE SINGLE STATION CASE
Authors: GOLDSCHMIDT O BARD JF TAKVORIAN A
Citation: O. Goldschmidt et al., COMPLEXITY RESULTS FOR MIXED-MODEL ASSEMBLY LINES WITH APPROXIMATION ALGORITHMS FOR THE SINGLE STATION CASE, International journal of flexible manufacturing systems, 9(3), 1997, pp. 251-272
A NEW AND IMPROVED ALGORITHM FOR THE 3-CUT PROBLEM
Authors: BURLET M GOLDSCHMIDT O
Citation: M. Burlet et O. Goldschmidt, A NEW AND IMPROVED ALGORITHM FOR THE 3-CUT PROBLEM, Operations research letters, 21(5), 1997, pp. 225-227
SPECIFIC ANTIINFECTIVE IMMUNE THERAPY - AN EFFECTIVE WAY TO TREAT RECURRENT TONSILLITIS IN CHILDHOOD
Authors: GOLDSCHMIDT O KAHL L KLIMEK L BENE MC FAURE GC MOSGES R
Citation: O. Goldschmidt et al., SPECIFIC ANTIINFECTIVE IMMUNE THERAPY - AN EFFECTIVE WAY TO TREAT RECURRENT TONSILLITIS IN CHILDHOOD, Drugs, 54, 1997, pp. 38-38
APPROXIMATION ALGORITHMS FOR THE K-CLIQUE COVERING PROBLEM
Authors: GOLDSCHMIDT O HOCHBAUM DS HURKENS C YU G
Citation: O. Goldschmidt et al., APPROXIMATION ALGORITHMS FOR THE K-CLIQUE COVERING PROBLEM, SIAM journal on discrete mathematics, 9(3), 1996, pp. 492-509
ON LOCALLY OPTIMAL INDEPENDENT SETS AND VERTEX COVERS
Authors: YU G GOLDSCHMIDT O
Citation: G. Yu et O. Goldschmidt, ON LOCALLY OPTIMAL INDEPENDENT SETS AND VERTEX COVERS, Naval research logistics, 43(5), 1996, pp. 737-748
ON FINDING A BICONNECTED SPANNING PLANAR SUBGRAPH WITH APPLICATIONS TO THE FACILITIES LAYOUT PROBLEM
Authors: GOLDSCHMIDT O TAKVORIAN A YU G
Citation: O. Goldschmidt et al., ON FINDING A BICONNECTED SPANNING PLANAR SUBGRAPH WITH APPLICATIONS TO THE FACILITIES LAYOUT PROBLEM, European journal of operational research, 94(1), 1996, pp. 97-105
RANDOMIZED METHODS FOR THE NUMBER PARTITIONING PROBLEM
Authors: ARGUELLO MF FEO TA GOLDSCHMIDT O
Citation: Mf. Arguello et al., RANDOMIZED METHODS FOR THE NUMBER PARTITIONING PROBLEM, Computers & operations research, 23(2), 1996, pp. 103-111
AN EFFICIENT ALGORITHM FOR FINDING A MAXIMUM WEIGHT INDEPENDENT SET OF A CIRCLE GRAPH
Authors: GOLDSCHMIDT O TAKVORIAN A
Citation: O. Goldschmidt et A. Takvorian, AN EFFICIENT ALGORITHM FOR FINDING A MAXIMUM WEIGHT INDEPENDENT SET OF A CIRCLE GRAPH, IEICE transactions on fundamentals of electronics, communications and computer science, E77A(10), 1994, pp. 1672-1674
AN EFFICIENT ALGORITHM FOR FINDING A MAXIMUM WEIGHT INDEPENDENT SET OF A CIRCLE GRAPH
Authors: GOLDSCHMIDT O TAKVORIAN A
Citation: O. Goldschmidt et A. Takvorian, AN EFFICIENT ALGORITHM FOR FINDING A MAXIMUM WEIGHT INDEPENDENT SET OF A CIRCLE GRAPH, IEICE transactions on fundamentals of electronics, communications and computer science, E77A(10), 1994, pp. 1672-1674
ON THE SET-UNION KNAPSACK-PROBLEM
Authors: GOLDSCHMIDT O NEHME D YU G
Citation: O. Goldschmidt et al., ON THE SET-UNION KNAPSACK-PROBLEM, Naval research logistics, 41(6), 1994, pp. 833-842
A POLYNOMIAL ALGORITHM FOR THE KAPPA-CUT PROBLEM FOR FIXED KAPPA
Authors: GOLDSCHMIDT O HOCHBAUM DS
Citation: O. Goldschmidt et Ds. Hochbaum, A POLYNOMIAL ALGORITHM FOR THE KAPPA-CUT PROBLEM FOR FIXED KAPPA, Mathematics of operations research, 19(1), 1994, pp. 24-37
ON RELIABILITY OF GRAPHS WITH NODE FAILURES
Authors: GOLDSCHMIDT O JAILLET P LASOTA R
Citation: O. Goldschmidt et al., ON RELIABILITY OF GRAPHS WITH NODE FAILURES, Networks, 24(4), 1994, pp. 251-259
AN EFFICIENT GRAPH PLANARIZATION 2-PHASE HEURISTIC
Authors: GOLDSCHMIDT O TAKVORIAN A
Citation: O. Goldschmidt et A. Takvorian, AN EFFICIENT GRAPH PLANARIZATION 2-PHASE HEURISTIC, Networks, 24(2), 1994, pp. 69-73
A MODIFIED GREEDY HEURISTIC FOR THE SET COVERING PROBLEM WITH IMPROVED WORST-CASE BOUND
Authors: GOLDSCHMIDT O HOCHBAUM DS YU G
Citation: O. Goldschmidt et al., A MODIFIED GREEDY HEURISTIC FOR THE SET COVERING PROBLEM WITH IMPROVED WORST-CASE BOUND, Information processing letters, 48(6), 1993, pp. 305-310
Risultati: 1-21 |