AAAAAA

   
Results: 1-25 | 26-50 | 51-75 | 76-100 | >>

Table of contents of journal: *SIAM journal on discrete mathematics

Results: 26-50/301
SORTING BY TRANSPOSITIONS
Authors: BAFNA V PEVZNER PA
Citation: V. Bafna et Pa. Pevzner, SORTING BY TRANSPOSITIONS, SIAM journal on discrete mathematics, 11(2), 1998, pp. 224-240
PERFECT FACTORS FROM CYCLIC CODES AND INTERLEAVING
Authors: MITCHELL CJ PATERSON KG
Citation: Cj. Mitchell et Kg. Paterson, PERFECT FACTORS FROM CYCLIC CODES AND INTERLEAVING, SIAM journal on discrete mathematics, 11(2), 1998, pp. 241-264
ISOMORPHISM-CLASSES OF CONCRETE GRAPH COVERINGS
Authors: FENG RQ KWAK JH KIM J LEE J
Citation: Rq. Feng et al., ISOMORPHISM-CLASSES OF CONCRETE GRAPH COVERINGS, SIAM journal on discrete mathematics, 11(2), 1998, pp. 265-272
ENUMERATION OF REGULAR GRAPH COVERINGS HAVING FINITE ABELIAN COVERINGTRANSFORMATION GROUPS
Authors: KWAK JH CHUN JH LEE J
Citation: Jh. Kwak et al., ENUMERATION OF REGULAR GRAPH COVERINGS HAVING FINITE ABELIAN COVERINGTRANSFORMATION GROUPS, SIAM journal on discrete mathematics, 11(2), 1998, pp. 273-285
A NOTE ON COUNTING CONNECTED GRAPH COVERING PROJECTIONS
Authors: HOFMEISTER M
Citation: M. Hofmeister, A NOTE ON COUNTING CONNECTED GRAPH COVERING PROJECTIONS, SIAM journal on discrete mathematics, 11(2), 1998, pp. 286-292
A GENERALIZED DISTANCE IN GRAPHS AND CENTERED PARTITIONS
Authors: LENART C
Citation: C. Lenart, A GENERALIZED DISTANCE IN GRAPHS AND CENTERED PARTITIONS, SIAM journal on discrete mathematics, 11(2), 1998, pp. 293-304
CAYLEY DIGRAPHS BASED ON THE DE-BRUIJN NETWORKS
Authors: ESPONA M SERRA O
Citation: M. Espona et O. Serra, CAYLEY DIGRAPHS BASED ON THE DE-BRUIJN NETWORKS, SIAM journal on discrete mathematics, 11(2), 1998, pp. 305-317
A GREEDY ALGORITHM ESTIMATING THE HEIGHT OF RANDOM TREES
Authors: LUCZAK T
Citation: T. Luczak, A GREEDY ALGORITHM ESTIMATING THE HEIGHT OF RANDOM TREES, SIAM journal on discrete mathematics, 11(2), 1998, pp. 318-329
CIRCULANTS AND SEQUENCES
Authors: COLLINS KL
Citation: Kl. Collins, CIRCULANTS AND SEQUENCES, SIAM journal on discrete mathematics, 11(2), 1998, pp. 330-339
SEMIKERNELS AND (K,L)-KERNELS IN DIGRAPHS
Authors: GALEANASANCHEZ H LI XL
Citation: H. Galeanasanchez et Xl. Li, SEMIKERNELS AND (K,L)-KERNELS IN DIGRAPHS, SIAM journal on discrete mathematics, 11(2), 1998, pp. 340-346
THE RING LOADING PROBLEM
Authors: SCHRIJVER A SEYMOUR P WINKLER P
Citation: A. Schrijver et al., THE RING LOADING PROBLEM, SIAM journal on discrete mathematics, 11(1), 1998, pp. 1-14
INTERFERENCE-MINIMIZING COLORINGS OF REGULAR GRAPHS
Authors: FISHBURN PC KIM JH LAGARIAS JC WRIGHT PE
Citation: Pc. Fishburn et al., INTERFERENCE-MINIMIZING COLORINGS OF REGULAR GRAPHS, SIAM journal on discrete mathematics, 11(1), 1998, pp. 15-40
COMBINATORIAL PROPERTIES AND CONSTRUCTIONS OF TRACEABILITY SCHEMES AND FRAMEPROOF CODES
Authors: STINSON DR WEI R
Citation: Dr. Stinson et R. Wei, COMBINATORIAL PROPERTIES AND CONSTRUCTIONS OF TRACEABILITY SCHEMES AND FRAMEPROOF CODES, SIAM journal on discrete mathematics, 11(1), 1998, pp. 41-53
THE NUMBER OF INDEPENDENT SETS IN A GRID GRAPH
Authors: CALKIN NJ WILF HS
Citation: Nj. Calkin et Hs. Wilf, THE NUMBER OF INDEPENDENT SETS IN A GRID GRAPH, SIAM journal on discrete mathematics, 11(1), 1998, pp. 54-60
A RANDOMNESS-ROUNDS TRADEOFF IN PRIVATE COMPUTATION
Authors: KUSHILEVITZ E ROSEN A
Citation: E. Kushilevitz et A. Rosen, A RANDOMNESS-ROUNDS TRADEOFF IN PRIVATE COMPUTATION, SIAM journal on discrete mathematics, 11(1), 1998, pp. 61-80
SOMETIMES TRAVELING IS EASY - THE MASTER TOUR PROBLEM
Authors: DEINEKO VG RUDOLF R WOEGINGER GJ
Citation: Vg. Deineko et al., SOMETIMES TRAVELING IS EASY - THE MASTER TOUR PROBLEM, SIAM journal on discrete mathematics, 11(1), 1998, pp. 81-93
ANALYSIS OF ALGORITHMS FOR LISTING EQUIVALENCE CLASSES OF K-ARY STRINGS
Authors: PROSKUROWSKI A RUSKEY F SMITH M
Citation: A. Proskurowski et al., ANALYSIS OF ALGORITHMS FOR LISTING EQUIVALENCE CLASSES OF K-ARY STRINGS, SIAM journal on discrete mathematics, 11(1), 1998, pp. 94-109
AN ORDERING ON THE EVEN DISCRETE TORUS
Authors: RIORDAN O
Citation: O. Riordan, AN ORDERING ON THE EVEN DISCRETE TORUS, SIAM journal on discrete mathematics, 11(1), 1998, pp. 110-127
COMPETITION GRAPHS OF HAMILTONIAN DIGRAPHS
Authors: GUICHARD DR
Citation: Dr. Guichard, COMPETITION GRAPHS OF HAMILTONIAN DIGRAPHS, SIAM journal on discrete mathematics, 11(1), 1998, pp. 128-134
THE NUMBER OF INTERSECTION POINTS MADE BY THE DIAGONALS OF A REGULAR POLYGON
Authors: POONEN B RUBINSTEIN M
Citation: B. Poonen et M. Rubinstein, THE NUMBER OF INTERSECTION POINTS MADE BY THE DIAGONALS OF A REGULAR POLYGON, SIAM journal on discrete mathematics, 11(1), 1998, pp. 135-156
GEOMETRY AND DIAMETER BOUNDS OF DIRECTED CAYLEY-GRAPHS OF ABELIAN-GROUPS
Authors: FIDUCCIA CM FORCADE RW ZITO JS
Citation: Cm. Fiduccia et al., GEOMETRY AND DIAMETER BOUNDS OF DIRECTED CAYLEY-GRAPHS OF ABELIAN-GROUPS, SIAM journal on discrete mathematics, 11(1), 1998, pp. 157-167
RANKINGS OF GRAPHS
Authors: BODLAENDER HL DEOGUN JS JANSEN K KLOKS T KRATSCH D MULLER H TUZA Z
Citation: Hl. Bodlaender et al., RANKINGS OF GRAPHS, SIAM journal on discrete mathematics, 11(1), 1998, pp. 168-181
THE ORDER DIMENSION OF PLANAR MAPS
Authors: BRIGHTWELL GR TROTTER WT
Citation: Gr. Brightwell et Wt. Trotter, THE ORDER DIMENSION OF PLANAR MAPS, SIAM journal on discrete mathematics, 10(4), 1997, pp. 515-528
FOR VERTEX PARTITIONING PROBLEMS ON PARTIAL K-TREES
Authors: TELLE JA PROSKUROWSKI A
Citation: Ja. Telle et A. Proskurowski, FOR VERTEX PARTITIONING PROBLEMS ON PARTIAL K-TREES, SIAM journal on discrete mathematics, 10(4), 1997, pp. 529-550
GLOBAL PRICE UPDATES HELP
Authors: GOLDBERG AV KENNEDY R
Citation: Av. Goldberg et R. Kennedy, GLOBAL PRICE UPDATES HELP, SIAM journal on discrete mathematics, 10(4), 1997, pp. 551-572
Risultati: 1-25 | 26-50 | 51-75 | 76-100 | >>