AAAAAA
Results:
1-16
|
Results: 16
Authors:
VITHALANI KK
PARENT CA
THORN EM
PENN M
LAROCHELLE DA
DEVREOTES PN
DELOZANNE A
Citation: Kk. Vithalani et al., IDENTIFICATION OF DARLIN, A DICTYOSTELIUM PROTEIN WITH ARMADILLO-LIKEREPEATS THAT BINDS TO SMALL GTPASES AND IS IMPORTANT FOR THE PROPER AGGREGATION OF DEVELOPING CELLS, Molecular biology of the cell, 9(11), 1998, pp. 3095-3106
Authors:
AVRIEL M
PENN M
SHPIRER N
WITTEBOON S
Citation: M. Avriel et al., STOWAGE PLANNING FOR CONTAINER SHIPS TO REDUCE THE NUMBER OF SHIFTS, Annals of operations research, 76, 1998, pp. 55-71
Authors:
MANOR R
PENN M
Citation: R. Manor et M. Penn, AN EXTENDED PLANAR ALGORITHM FOR MAXIMUM INTEGRAL 2-FLOW, Networks, 32(1), 1998, pp. 67-76
Authors:
NUTOV Z
PENN M
SINREICH D
Citation: Z. Nutov et al., ON MOBILE ROBOTS FLOW IN LOCALLY UNIFORM NETWORKS, INFOR. Information systems and operational research, 35(4), 1997, pp. 297-308
Authors:
PENN M
SHASHAKRUPNIK H
Citation: M. Penn et H. Shashakrupnik, IMPROVED APPROXIMATION ALGORITHMS FOR WEIGHTED 2-VERTEX AND 3-VERTEX CONNECTIVITY AUGMENTATION PROBLEMS, Journal of algorithms, 22(1), 1997, pp. 187-196
Authors:
NUTOV Z
PENN M
Citation: Z. Nutov et M. Penn, FASTER APPROXIMATION ALGORITHMS FOR WEIGHTED TRICONNECTIVITY AUGMENTATION PROBLEMS, Operations research letters, 21(5), 1997, pp. 219-223
Authors:
GRANOT F
PENN M
Citation: F. Granot et M. Penn, POLYNOMIAL ALGORITHMS FOR (INTEGRAL) MAXIMUM 2-FLOWS IN VERTEX EDGE-CAPACITATED PLANAR GRAPHS/, Discrete applied mathematics, 70(3), 1996, pp. 267-283
Authors:
GRANOT F
PENN M
QUEYRANNE M
Citation: F. Granot et al., DISCONNECTING SETS IN SINGLE AND 2-TERMINAL-PAIR NETWORKS, Networks, 27(2), 1996, pp. 117-123
Authors:
PENN M
Citation: M. Penn, EASTERN-EUROPE IN THE GLOBAL MICROELECTRONICS WORLD, Microelectronics, 27(8), 1996, pp. 767-775
Authors:
BOROBIA A
NUTOV Z
PENN M
Citation: A. Borobia et al., DOUBLY STOCHASTIC MATRICES AND DICYCLE COVERS AND PACKINGS IN EULERIAN DIGRAPHS, Linear algebra and its applications, 246, 1996, pp. 361-371
Authors:
NUTOV Z
PENN M
Citation: Z. Nutov et M. Penn, ON NON-(0,1 2,1) EXTREME-POINTS OF THE GENERALIZED TRANSITIVE TOURNAMENT POLYTOPE/, Linear algebra and its applications, 233, 1996, pp. 149-159
Authors:
NUTOV Z
PENN M
Citation: Z. Nutov et M. Penn, ON THE INTEGRAL DICYCLE PACKINGS AND COVERS AND THE LINEAR ORDERING POLYTOPE, Discrete applied mathematics, 60(1-3), 1995, pp. 293-309
Authors:
HERER YT
PENN M
Citation: Yt. Herer et M. Penn, CHARACTERIZATIONS OF NATURAL SUBMODULAR GRAPHS - A POLYNOMIALLY SOLVABLE CLASS OF THE TSP, Proceedings of the American Mathematical Society, 123(3), 1995, pp. 673-679
Authors:
PENN M
HASSON D
AVRIEL M
Citation: M. Penn et al., SOLVING THE 0-1 PROPORTIONAL KNAPSACK-PROBLEM BY SAMPLING, Journal of optimization theory and applications, 80(2), 1994, pp. 289-297
Authors:
KORACH E
PENN M
Citation: E. Korach et M. Penn, A FAST ALGORITHM FOR MAXIMUM INTEGRAL 2-COMMODITY FLOW IN PLANAR GRAPHS, Discrete applied mathematics, 47(1), 1993, pp. 77-83
Authors:
AVRIEL M
PENN M
Citation: M. Avriel et M. Penn, EXACT AND APPROXIMATE SOLUTIONS OF THE CONTAINER SHIP STOWAGE PROBLEM, Computers & industrial engineering, 25(1-4), 1993, pp. 271-274
Risultati:
1-16
|