AAAAAA

   
Results: 1-25 | 26-50 | 51-70
Results: 1-25/70
T-CHOOSABILITY IN GRAPHS
Authors: ALON N ZAKS A
Citation: N. Alon et A. Zaks, T-CHOOSABILITY IN GRAPHS, Discrete applied mathematics, 82(1-3), 1998, pp. 1-13
LAMOTRIGINE IN THE TREATMENT OF PAINFUL DIABETIC NEUROPATHY
Authors: EISENBERG E ALON N ISHAY A DAOUD D YARNITSKY D
Citation: E. Eisenberg et al., LAMOTRIGINE IN THE TREATMENT OF PAINFUL DIABETIC NEUROPATHY, European journal of neurology, 5(2), 1998, pp. 167-173
THE FANCONI-ANEMIA GROUP-G GENE FANCG IS IDENTICAL WITH XRCC9
Authors: DEWINTER JP WAISFISZ Q ROOIMANS MA VANBERKEL CGM BOSNOYANCOLLINS L ALON N CARREAU M BENDER O DEMUTH I SCHINDLER D PRONK JC ARWERT F HOEHN H DIGWEED M BUCHWALD M JOENJE H
Citation: Jp. Dewinter et al., THE FANCONI-ANEMIA GROUP-G GENE FANCG IS IDENTICAL WITH XRCC9, Nature genetics, 20(3), 1998, pp. 281-283
FINDING A LARGE HIDDEN CLIQUE IN A RANDOM GRAPH
Authors: ALON N KRIVELEVICH M SUDAKOV B
Citation: N. Alon et al., FINDING A LARGE HIDDEN CLIQUE IN A RANDOM GRAPH, Random structures & algorithms, 13(3-4), 1998, pp. 457-466
AN ASYMPTOTIC ISOPERIMETRIC INEQUALITY
Authors: ALON N BOPPANA R SPENCER J
Citation: N. Alon et al., AN ASYMPTOTIC ISOPERIMETRIC INEQUALITY, Geometric and functional analysis, 8(3), 1998, pp. 411-436
PIERCING D-INTERVALS
Authors: ALON N
Citation: N. Alon, PIERCING D-INTERVALS, Discrete & computational geometry, 19(3), 1998, pp. 333-334
ONLINE AND OFF-LINE APPROXIMATION ALGORITHMS FOR VECTOR COVERING PROBLEMS
Authors: ALON N AZAR Y CSIRIK J EPSTEIN L SEVASTIANOV SV VESTJENS APA WOEGINGER GJ
Citation: N. Alon et al., ONLINE AND OFF-LINE APPROXIMATION ALGORITHMS FOR VECTOR COVERING PROBLEMS, Algorithmica, 21(1), 1998, pp. 104-118
PROGRESSIONS IN SEQUENCES OF NEARLY CONSECUTIVE INTEGERS
Authors: ALON N ZAKS A
Citation: N. Alon et A. Zaks, PROGRESSIONS IN SEQUENCES OF NEARLY CONSECUTIVE INTEGERS, J COMB TH A, 84(1), 1998, pp. 99-109
APPROXIMATING THE INDEPENDENCE NUMBER VIA THE THETA-FUNCTION
Authors: ALON N KAHALE N
Citation: N. Alon et N. Kahale, APPROXIMATING THE INDEPENDENCE NUMBER VIA THE THETA-FUNCTION, Mathematical programming, 80(3), 1998, pp. 253-264
PROPERLY COLORED HAMILTON CYCLES IN EDGE-COLORED COMPLETE GRAPHS
Authors: ALON N GUTIN G
Citation: N. Alon et G. Gutin, PROPERLY COLORED HAMILTON CYCLES IN EDGE-COLORED COMPLETE GRAPHS, Random structures & algorithms, 11(2), 1997, pp. 179-186
SCALE-SENSITIVE DIMENSIONS, UNIFORM-CONVERGENCE, AND LEARNABILITY
Authors: ALON N BENDAVID S CESABIANCHI N HAUSSLER D
Citation: N. Alon et al., SCALE-SENSITIVE DIMENSIONS, UNIFORM-CONVERGENCE, AND LEARNABILITY, Journal of the ACM, 44(4), 1997, pp. 615-631
CLONING OF THE BOVINE AND RAT FANCONI-ANEMIA GROUP-C CDNA
Authors: WONG JCY ALON N BUCHWALD M
Citation: Jcy. Wong et al., CLONING OF THE BOVINE AND RAT FANCONI-ANEMIA GROUP-C CDNA, Mammalian genome, 8(7), 1997, pp. 522-525
SUBGRAPHS WITH A LARGE COCHROMATIC NUMBER
Authors: ALON N KRIVELEVICH M SUDAKOV B
Citation: N. Alon et al., SUBGRAPHS WITH A LARGE COCHROMATIC NUMBER, Journal of graph theory, 25(4), 1997, pp. 295-297
THE CONCENTRATION OF THE CHROMATIC NUMBER OF RANDOM GRAPHS
Authors: ALON N KRIVELEVICH M
Citation: N. Alon et M. Krivelevich, THE CONCENTRATION OF THE CHROMATIC NUMBER OF RANDOM GRAPHS, Combinatorica, 17(3), 1997, pp. 303-313
COINS WITH ARBITRARY WEIGHTS
Authors: ALON N KOZLOV DN
Citation: N. Alon et Dn. Kozlov, COINS WITH ARBITRARY WEIGHTS, Journal of algorithms, 25(1), 1997, pp. 162-176
IMPROVED PARALLEL APPROXIMATION OF A CLASS OF INTEGER PROGRAMMING-PROBLEMS
Authors: ALON N SRINIVASAN A
Citation: N. Alon et A. Srinivasan, IMPROVED PARALLEL APPROXIMATION OF A CLASS OF INTEGER PROGRAMMING-PROBLEMS, Algorithmica, 17(4), 1997, pp. 449-462
FINDING AND COUNTING GIVEN LENGTH CYCLES
Authors: ALON N YUSTER R ZWICK U
Citation: N. Alon et al., FINDING AND COUNTING GIVEN LENGTH CYCLES, Algorithmica, 17(3), 1997, pp. 209-223
A SPECTRAL TECHNIQUE FOR COLORING RANDOM 3-COLORABLE GRAPHS
Authors: ALON N KAHALE N
Citation: N. Alon et N. Kahale, A SPECTRAL TECHNIQUE FOR COLORING RANDOM 3-COLORABLE GRAPHS, SIAM journal on computing, 26(6), 1997, pp. 1733-1748
ANTI-HADAMARD MATRICES, COIN WEIGHING, THRESHOLD GATES, AND INDECOMPOSABLE HYPERGRAPHS
Authors: ALON N VU VH
Citation: N. Alon et Vh. Vu, ANTI-HADAMARD MATRICES, COIN WEIGHING, THRESHOLD GATES, AND INDECOMPOSABLE HYPERGRAPHS, J COMB TH A, 79(1), 1997, pp. 133-160
ON THE DEGREE, SIZE, AND CHROMATIC INDEX OF A UNIFORM HYPERGRAPH
Authors: ALON N KIM JH
Citation: N. Alon et Jh. Kim, ON THE DEGREE, SIZE, AND CHROMATIC INDEX OF A UNIFORM HYPERGRAPH, J COMB TH A, 77(1), 1997, pp. 165-170
COVERING THE EDGES OF A GRAPH BY A PRESCRIBED TREE WITH MINIMUM OVERLAP
Authors: ALON N CARO Y YUSTER R
Citation: N. Alon et al., COVERING THE EDGES OF A GRAPH BY A PRESCRIBED TREE WITH MINIMUM OVERLAP, J COMB TH B, 71(2), 1997, pp. 144-161
A NOTE ON GRAPH COLORINGS AND GRAPH POLYNOMIALS
Authors: ALON N TARSI M
Citation: N. Alon et M. Tarsi, A NOTE ON GRAPH COLORINGS AND GRAPH POLYNOMIALS, J COMB TH B, 70(1), 1997, pp. 197-201
ON THE EXPONENT OF THE ALL PAIRS SHORTEST-PATH PROBLEM
Authors: ALON N GALIL Z MARGALIT O
Citation: N. Alon et al., ON THE EXPONENT OF THE ALL PAIRS SHORTEST-PATH PROBLEM, Journal of computer and system sciences, 54(2), 1997, pp. 255-262
NEARLY PERFECT MATCHINGS IN REGULAR SIMPLE HYPERGRAPHS
Authors: ALON N KIM JH SPENCER J
Citation: N. Alon et al., NEARLY PERFECT MATCHINGS IN REGULAR SIMPLE HYPERGRAPHS, Israel Journal of Mathematics, 100, 1997, pp. 171-187
THE FANCONI-ANEMIA GROUP-A PROTEIN LOCALIZES PRIMARILY TO THE NUCLEUS
Authors: LIGHTFOOT J ALON N BUCHWALD M
Citation: J. Lightfoot et al., THE FANCONI-ANEMIA GROUP-A PROTEIN LOCALIZES PRIMARILY TO THE NUCLEUS, American journal of human genetics, 61(4), 1997, pp. 34-34
Risultati: 1-25 | 26-50 | 51-70