Le informazioni sugli articoli di fonte ISI sono coperte da copyright

Per ulteriori informazioni selezionare i riferimenti di interesse.

1. Meghabghab, G
   Discovering authorities and hubs in different topological web graph structures
   INFORMATION PROCESSING & MANAGEMENT
   
   G. Meghabghab, "Discovering authorities and hubs in different topological web graph structures", INF PR MAN, 38(1), 2002, pp. 111-140
2. Vasko, FJ; Barbieri, RS; Rieksts, BQ; Reitmeyer, KL; Stott, KL
   The cable trench problem: combining the shortest path and minimum spanningtree problems
   COMPUTERS & OPERATIONS RESEARCH
   
   F.J. Vasko et al., "The cable trench problem: combining the shortest path and minimum spanningtree problems", COMPUT OPER, 29(5), 2002, pp. 441-458
3. Curet, ND; DeVinney, J; Gaston, ME
   An efficient network flow code for finding all minimum cost s-t cutsets
   COMPUTERS & OPERATIONS RESEARCH
   
   N.D. Curet et al., "An efficient network flow code for finding all minimum cost s-t cutsets", COMPUT OPER, 29(3), 2002, pp. 205-219
4. Bonchev, D; Markel, EJ; Dekmezian, AH
   Long chain branch polymer chain dimensions: application of topology to theZimm-Stockmayer model
   POLYMER
   
   D. Bonchev et al., "Long chain branch polymer chain dimensions: application of topology to theZimm-Stockmayer model", POLYMER, 43(1), 2002, pp. 203-222
5. Shi, P; McPhee, J; Heppler, GR
   A deformation field for Euler-Bernoulli beams with applications to flexible multibody dynamics
   MULTIBODY SYSTEM DYNAMICS
   
   P. Shi et al., "A deformation field for Euler-Bernoulli beams with applications to flexible multibody dynamics", MULTIB S D, 5(1), 2001, pp. 79-104
6. Rao, RV; Gandhi, OP
   Digraph and matrix method for the selection, identification and comparisonof metal-cutting fluids
   PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART J-JOURNAL OF ENGINEERING TRIBOLOGY
   
   R.V. Rao e O.P. Gandhi, "Digraph and matrix method for the selection, identification and comparisonof metal-cutting fluids", P I MEC E J, 215(J1), 2001, pp. 25-33
7. Sae-Tang, A; Igoshi, M; Aomura, S; Arai, E
   Determination of operation sequences with minimum tool-changes in mechanical machining
   JSME INTERNATIONAL JOURNAL SERIES C-MECHANICAL SYSTEMS MACHINE ELEMENTS AND MANUFACTURING
   
   A. Sae-Tang et al., "Determination of operation sequences with minimum tool-changes in mechanical machining", JSME C, 44(1), 2001, pp. 254-260
8. Gopal, RD; Ramesh, R; Zionts, S
   Cascade graphs: Design, analysis and algorithms for relational joins
   INFORMS JOURNAL ON COMPUTING
   
   R.D. Gopal et al., "Cascade graphs: Design, analysis and algorithms for relational joins", INFORMS J C, 13(1), 2001, pp. 2-28
9. Lang, SYT; Kesavan, HK
   Graph theoretic modeling and analysis of multibody planar mechanical systems
   IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS
   
   S.Y.T. Lang e H.K. Kesavan, "Graph theoretic modeling and analysis of multibody planar mechanical systems", IEEE SYST A, 31(2), 2001, pp. 97-111
10. Tsogo, L; Masson, MH; Bardot, A
    Recovery of the metric structure of a pattern of points using minimal information
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS
    
    L. Tsogo et al., "Recovery of the metric structure of a pattern of points using minimal information", IEEE SYST A, 31(1), 2001, pp. 30-42
11. Bridson, R; Tang, WP
    A structural diagnosis of some IC orderings
    SIAM JOURNAL ON SCIENTIFIC COMPUTING
    
    R. Bridson e W.P. Tang, "A structural diagnosis of some IC orderings", SIAM J SC C, 22(5), 2001, pp. 1527-1532
12. Awerbuch, B; Shavitt, Y
    Topology aggregation for directed graphs
    IEEE-ACM TRANSACTIONS ON NETWORKING
    
    B. Awerbuch e Y. Shavitt, "Topology aggregation for directed graphs", IEEE ACM TN, 9(1), 2001, pp. 82-90
13. Gentleman, R; Vandal, AC
    Computational algorithms for censored-data problems using intersection graphs
    JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS
    
    R. Gentleman e A.C. Vandal, "Computational algorithms for censored-data problems using intersection graphs", J COMPU G S, 10(3), 2001, pp. 403-421
14. Jha, PK
    Optimal L(2,1)-labeling of strong products of cycles
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS
    
    P.K. Jha, "Optimal L(2,1)-labeling of strong products of cycles", IEEE CIRC-I, 48(4), 2001, pp. 498-500
15. Tamara, H; Sengoku, M; Shinoda, S; Abe, T
    On a realization problem from non-terminal capacity matrices on undirectedflow networks
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE
    
    H. Tamara et al., "On a realization problem from non-terminal capacity matrices on undirectedflow networks", ELEC C JP 3, 84(12), 2001, pp. 28-39
16. Tamura, H; Sugawara, H; Sengoku, M; Shinoda, S
    Multiple cover problem on undirected flow networks
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE
    
    H. Tamura et al., "Multiple cover problem on undirected flow networks", ELEC C JP 3, 84(1), 2001, pp. 67-74
17. Lee, C; Shih, CS; Chen, YH
    Optimizing large join queries using a graph-based approach
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
    
    C. Lee et al., "Optimizing large join queries using a graph-based approach", IEEE KNOWL, 13(2), 2001, pp. 298-315
18. Wagner, A; Fell, DA
    The small world inside large metabolic networks
    PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES B-BIOLOGICAL SCIENCES
    
    A. Wagner e D.A. Fell, "The small world inside large metabolic networks", P ROY SOC B, 268(1478), 2001, pp. 1803-1810
19. Kaveh, A; Bondarabady, HAR
    Spectral trisection of finite element models
    INTERNATIONAL JOURNAL OF NUMERICAL METHODS FOR HEAT & FLUID FLOW
    
    A. Kaveh e H.A.R. Bondarabady, "Spectral trisection of finite element models", INT J N M H, 11(4), 2001, pp. 358-370
20. Tang, J
    Mechanical system reliability analysis using a combination of graph theoryand Boolean function
    RELIABILITY ENGINEERING & SYSTEM SAFETY
    
    J. Tang, "Mechanical system reliability analysis using a combination of graph theoryand Boolean function", RELIAB ENG, 72(1), 2001, pp. 21-30
21. Kalfakakou, R; Tsouros, CC
    Determining the size and location of suppliers for a minimum total distribution route problem
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
    
    R. Kalfakakou e C.C. Tsouros, "Determining the size and location of suppliers for a minimum total distribution route problem", INT J PRO E, 71(1-3), 2001, pp. 401-405
22. Cardoso, DM
    Convex quadratic programming approach
    JOURNAL OF GLOBAL OPTIMIZATION
    
    D.M. Cardoso, "Convex quadratic programming approach", J GLOB OPT, 19(3), 2001, pp. 291-306
23. Chen, YN; He, ZS; Tian, YF
    Efficient reliability modeling of the heterogeneous autonomous decentralized systems
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
    
    Y.N. Chen et al., "Efficient reliability modeling of the heterogeneous autonomous decentralized systems", IEICE T INF, E84D(10), 2001, pp. 1360-1367
24. Shinomiya, N; Tamura, H; Watanabe, H
    A study of minimum-cost tree problem with response-time bound in information network
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    
    N. Shinomiya et al., "A study of minimum-cost tree problem with response-time bound in information network", IEICE T FUN, E84A(2), 2001, pp. 638-646
25. Grubsch, M; David, O
    How to divide a catchment to conquer its parallel processing. An efficientalgorithm for the partitioning of water catchments
    MATHEMATICAL AND COMPUTER MODELLING
    
    M. Grubsch e O. David, "How to divide a catchment to conquer its parallel processing. An efficientalgorithm for the partitioning of water catchments", MATH COMP M, 33(6-7), 2001, pp. 723-731
26. Shi, WP; West, DB
    Structural diagnosis of wiring networks: Finding connected components of unknown subgraphs
    SIAM JOURNAL ON DISCRETE MATHEMATICS
    
    W.P. Shi e D.B. West, "Structural diagnosis of wiring networks: Finding connected components of unknown subgraphs", SIAM J DISC, 14(4), 2001, pp. 510-523
27. Kannan, N; Selvaraj, S; Gromiha, MM; Vishveshwara, S
    Clusters in alpha/beta barrel proteins: Implications for protein structure, function, and folding: A graph theoretical approach
    PROTEINS-STRUCTURE FUNCTION AND GENETICS
    
    N. Kannan et al., "Clusters in alpha/beta barrel proteins: Implications for protein structure, function, and folding: A graph theoretical approach", PROTEINS, 43(2), 2001, pp. 103-112
28. Sowell, EE; Haves, P
    Efficient solution strategies for building energy system simulation
    ENERGY AND BUILDINGS
    
    E.E. Sowell e P. Haves, "Efficient solution strategies for building energy system simulation", ENERG BLDG, 33(4), 2001, pp. 309-317
29. Morita, S; Oshio, K; Osana, Y; Funabashi, Y; Oka, K; Kawamura, K
    Geometrical structure of the neuronal network of Caenorhabditis elegans
    PHYSICA A
    
    S. Morita et al., "Geometrical structure of the neuronal network of Caenorhabditis elegans", PHYSICA A, 298(3-4), 2001, pp. 553-561
30. Kriesell, M
    Induced paths in 5-connected graphs
    JOURNAL OF GRAPH THEORY
    
    M. Kriesell, "Induced paths in 5-connected graphs", J GRAPH TH, 36(1), 2001, pp. 52-58
31. Cvetkovic, D; Simic, S; Caporossi, G; Hansen, P
    Variable neighborhood search for extremal graphs 3. On the largest eigenvalue of color-constrained trees
    LINEAR & MULTILINEAR ALGEBRA
    
    D. Cvetkovic et al., "Variable neighborhood search for extremal graphs 3. On the largest eigenvalue of color-constrained trees", LINEAR MULT, 49(2), 2001, pp. 143-160
32. Koch, I
    Enumerating all connected maximal common subgraphs in two graphs
    THEORETICAL COMPUTER SCIENCE
    
    I. Koch, "Enumerating all connected maximal common subgraphs in two graphs", THEOR COMP, 250(1-2), 2001, pp. 1-30
33. Wang, LY; Lai, YT
    Graph-theory-based simplex algorithm for VLSI layout spacing problems withmultiple variable constraints
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
    
    L.Y. Wang e Y.T. Lai, "Graph-theory-based simplex algorithm for VLSI layout spacing problems withmultiple variable constraints", IEEE COMP A, 20(8), 2001, pp. 967-979
34. Habsieger, L
    Integer zeros of q-Krawtchouk polynomials in classical combinatorics
    ADVANCES IN APPLIED MATHEMATICS
    
    L. Habsieger, "Integer zeros of q-Krawtchouk polynomials in classical combinatorics", ADV APPL MA, 27(2-3), 2001, pp. 427-437
35. Golumbic, MC; Hirst, T; Lewenstein, M
    Uniquely restricted matchings
    ALGORITHMICA
    
    M.C. Golumbic et al., "Uniquely restricted matchings", ALGORITHMIC, 31(2), 2001, pp. 139-154
36. Shinomiya, N; Koide, T; Watanabe, H
    A theory of tie-set graph and its application to information network management
    INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS
    
    N. Shinomiya et al., "A theory of tie-set graph and its application to information network management", INT J CIRCU, 29(4), 2001, pp. 367-379
37. Mohar, B; Robertson, N
    Flexibility of polyhedral embeddings of graphs in surfaces
    JOURNAL OF COMBINATORIAL THEORY SERIES B
    
    B. Mohar e N. Robertson, "Flexibility of polyhedral embeddings of graphs in surfaces", J COMB TH B, 83(1), 2001, pp. 38-57
38. Nino, M; Daza, EE; Tello, M
    A criteria to classify biological activity of benzimidazoles from a model of structural similarity
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES
    
    M. Nino et al., "A criteria to classify biological activity of benzimidazoles from a model of structural similarity", J CHEM INF, 41(3), 2001, pp. 495-504
39. Golbraikh, A; Bonchev, D; Tropsha, A
    Novel chirality descriptors derived from molecular topology
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES
    
    A. Golbraikh et al., "Novel chirality descriptors derived from molecular topology", J CHEM INF, 41(1), 2001, pp. 147-158
40. Yavari, A; Kaveh, A; Sarkani, S; Bondarabady, HAR
    Topological aspects of meshless methods and nodal ordering for meshless discretizations
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING
    
    A. Yavari et al., "Topological aspects of meshless methods and nodal ordering for meshless discretizations", INT J NUM M, 52(9), 2001, pp. 921-938
41. Xiang, Y
    Cooperative triangulation in MSBNs without revealing subnet structures
    NETWORKS
    
    Y. Xiang, "Cooperative triangulation in MSBNs without revealing subnet structures", NETWORKS, 37(1), 2001, pp. 53-65
42. Gutman, I; Tomovic, Z
    Total pi-electron energy of phenylenes: Bounds and approximate expressions
    MONATSHEFTE FUR CHEMIE
    
    I. Gutman e Z. Tomovic, "Total pi-electron energy of phenylenes: Bounds and approximate expressions", MONATS CHEM, 132(9), 2001, pp. 1023-1029
43. Jordan, C; Torregrosa, JR; Urbano, AM
    Graphs and controllability completion problems
    LINEAR ALGEBRA AND ITS APPLICATIONS
    
    C. Jordan et al., "Graphs and controllability completion problems", LIN ALG APP, 332, 2001, pp. 355-370
44. Shai, O
    Deriving structural theorems and methods using Tellegen's theorem and combinatorial representations
    INTERNATIONAL JOURNAL OF SOLIDS AND STRUCTURES
    
    O. Shai, "Deriving structural theorems and methods using Tellegen's theorem and combinatorial representations", INT J SOL S, 38(44-45), 2001, pp. 8037-8052
45. Barbosa-Povoa, AP; Mateus, R; Novais, AQ
    Optimal two-dimensional layout of industrial facilities
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
    
    A.P. Barbosa-Povoa et al., "Optimal two-dimensional layout of industrial facilities", INT J PROD, 39(12), 2001, pp. 2567-2593
46. Igarashi, H
    On the property of the curl-curl matrix in finite element analysis with edge elements
    IEEE TRANSACTIONS ON MAGNETICS
    
    H. Igarashi, "On the property of the curl-curl matrix in finite element analysis with edge elements", IEEE MAGNET, 37(5), 2001, pp. 3129-3132
47. Urban, D; Keitt, T
    Landscape connectivity: A graph-theoretic perspective
    ECOLOGY
    
    D. Urban e T. Keitt, "Landscape connectivity: A graph-theoretic perspective", ECOLOGY, 82(5), 2001, pp. 1205-1218
48. Rubinstein, J; Schatzman, M
    Variational problems on multiply connected thin strips III: Integration ofthe Ginzburg-Landau equations over graphs
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
    
    J. Rubinstein e M. Schatzman, "Variational problems on multiply connected thin strips III: Integration ofthe Ginzburg-Landau equations over graphs", T AM MATH S, 353(10), 2001, pp. 4173-4187
49. Faria, L; de Figueiredo, CMH; Mendonca, CFX
    SPLITTING NUMBER is NP-complete
    DISCRETE APPLIED MATHEMATICS
    
    L. Faria et al., "SPLITTING NUMBER is NP-complete", DISCR APP M, 108(1-2), 2001, pp. 65-83
50. Carpanzano, E
    Order reduction of general nonlinear DAE systems by automatic tearing
    MATHEMATICAL AND COMPUTER MODELLING OF DYNAMICAL SYSTEMS
    
    E. Carpanzano, "Order reduction of general nonlinear DAE systems by automatic tearing", MATH CO M D, 6(2), 2000, pp. 145-168
51. Shi, PF; McPhee, J
    Dynamics of flexible multibody systems using virtual work and linear graphtheory
    MULTIBODY SYSTEM DYNAMICS
    
    P.F. Shi e J. McPhee, "Dynamics of flexible multibody systems using virtual work and linear graphtheory", MULTIB S D, 4(4), 2000, pp. 355-381
52. Wang, DJ
    The diagnosability of hypercubes with arbitrarily missing links
    JOURNAL OF SYSTEMS ARCHITECTURE
    
    D.J. Wang, "The diagnosability of hypercubes with arbitrarily missing links", J SYST ARCH, 46(6), 2000, pp. 519-527
53. Satratzemi, M; Tsouros, C; Harary, F
    An heuristic algorithm for handling multiple responses
    JOURNAL OF HEURISTICS
    
    M. Satratzemi et al., "An heuristic algorithm for handling multiple responses", J HEURISTIC, 6(2), 2000, pp. 269-282
54. Kaveh, A; Bondarabady, HAR
    Finite element mesh decomposition using complementary Laplacian matrix
    COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING
    
    A. Kaveh e H.A.R. Bondarabady, "Finite element mesh decomposition using complementary Laplacian matrix", COMMUN NUM, 16(6), 2000, pp. 379-389
55. Chow, E
    A priori sparsity patterns for parallel sparse approximate inverse preconditioners
    SIAM JOURNAL ON SCIENTIFIC COMPUTING
    
    E. Chow, "A priori sparsity patterns for parallel sparse approximate inverse preconditioners", SIAM J SC C, 21(5), 2000, pp. 1804-1822
56. Benzi, M; Tuma, M
    Orderings for factorized sparse approximate inverse preconditioners
    SIAM JOURNAL ON SCIENTIFIC COMPUTING
    
    M. Benzi e M. Tuma, "Orderings for factorized sparse approximate inverse preconditioners", SIAM J SC C, 21(5), 2000, pp. 1851-1868
57. Jha, PK
    Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS
    
    P.K. Jha, "Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination", IEEE CIRC-I, 47(10), 2000, pp. 1531-1534
58. Gimenez-Martinez, V
    A modified Hopfield auto-associative memory with improved capacity
    IEEE TRANSACTIONS ON NEURAL NETWORKS
    
    V. Gimenez-Martinez, "A modified Hopfield auto-associative memory with improved capacity", IEEE NEURAL, 11(4), 2000, pp. 867-878
59. Randic, M; Guo, XF
    Giant benzenoid hydrocarbons. Superphenalene resonance energy
    POLYCYCLIC AROMATIC COMPOUNDS
    
    M. Randic e X.F. Guo, "Giant benzenoid hydrocarbons. Superphenalene resonance energy", POLYCYCL AR, 18(1), 2000, pp. 49-69
60. Pierre, S; Nouisser, N
    Reusing software components in telecommunications network engineering
    ADVANCES IN ENGINEERING SOFTWARE
    
    S. Pierre e N. Nouisser, "Reusing software components in telecommunications network engineering", ADV EN SOFT, 31(3), 2000, pp. 159-172
61. Stephan, KE; Hilgetag, CC; Burns, GAPC; O'Neill, MA; Young, MP; Kotter, R
    Computational analysis of functional connectivity between areas of primatecerebral cortex
    PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY OF LONDON SERIES B-BIOLOGICAL SCIENCES
    
    K.E. Stephan et al., "Computational analysis of functional connectivity between areas of primatecerebral cortex", PHI T ROY B, 355(1393), 2000, pp. 111-126
62. Helma, C; Gottmann, E; Kramer, S
    Knowledge discovery and data mining in toxicology
    STATISTICAL METHODS IN MEDICAL RESEARCH
    
    C. Helma et al., "Knowledge discovery and data mining in toxicology", STAT ME M R, 9(4), 2000, pp. 329-358
63. Hsu, CH; Hsu, JJ
    Epicyclic gear trains for automotive automatic transmissions
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART D-JOURNAL OF AUTOMOBILE ENGINEERING
    
    C.H. Hsu e J.J. Hsu, "Epicyclic gear trains for automotive automatic transmissions", P I MEC E D, 214(D5), 2000, pp. 523-532
64. Stein, B; Vier, E
    Structural analysis in control systems design of hydraulic drives
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
    
    B. Stein e E. Vier, "Structural analysis in control systems design of hydraulic drives", ENG APP ART, 13(6), 2000, pp. 741-750
65. Khoo, LP; Ang, CL; Zhang, J
    A fuzzy-based genetic approach to the diagnosis of manufacturing systems
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
    
    L.P. Khoo et al., "A fuzzy-based genetic approach to the diagnosis of manufacturing systems", ENG APP ART, 13(3), 2000, pp. 303-310
66. Sudbo, J; Marcelpoil, R; Reith, A
    Caveats: Numerical requirements in graph theory based quantitation of tissue architecture
    ANALYTICAL CELLULAR PATHOLOGY
    
    J. Sudbo et al., "Caveats: Numerical requirements in graph theory based quantitation of tissue architecture", ANAL CELL P, 21(2), 2000, pp. 59-69
67. Sudbo, J; Marcelpoil, R; Reith, A
    New algorithms based on the Voronoi Diagram applied in a pilot study on normal mucosa and carcinomas
    ANALYTICAL CELLULAR PATHOLOGY
    
    J. Sudbo et al., "New algorithms based on the Voronoi Diagram applied in a pilot study on normal mucosa and carcinomas", ANAL CELL P, 21(2), 2000, pp. 71-86
68. Nakano, S
    Planar drawings of plane graphs
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
    
    S. Nakano, "Planar drawings of plane graphs", IEICE T INF, E83D(3), 2000, pp. 384-391
69. Lee, CY; Yeh, YS; Chen, DJ; Ku, KL
    A share assignment method to maximize the probability of secret sharing reconstruction under the Internet
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
    
    C.Y. Lee et al., "A share assignment method to maximize the probability of secret sharing reconstruction under the Internet", IEICE T INF, E83D(2), 2000, pp. 190-199
70. Watanabe, K; Sengoku, M; Tamura, H; Nakano, K; Shinoda, S
    A scheduling problem in multihop networks
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    
    K. Watanabe et al., "A scheduling problem in multihop networks", IEICE T FUN, E83A(6), 2000, pp. 1222-1227
71. Shen, ZZ
    The average diameter and its estimation in nonlinear structures
    COMPUTERS & MATHEMATICS WITH APPLICATIONS
    
    Z.Z. Shen, "The average diameter and its estimation in nonlinear structures", COMPUT MATH, 40(2-3), 2000, pp. 261-276
72. Zakarya, D; Nohair, M; Nyassi, H
    On the DZ(P)(K) molecular descriptors
    LABORATORY ROBOTICS AND AUTOMATION
    
    D. Zakarya et al., "On the DZ(P)(K) molecular descriptors", LAB ROBOT A, 12(1), 2000, pp. 37-40
73. Cera, M; Dianez, A; Marquez, A
    The size of a graph without topological complete subgraphs
    SIAM JOURNAL ON DISCRETE MATHEMATICS
    
    M. Cera et al., "The size of a graph without topological complete subgraphs", SIAM J DISC, 13(3), 2000, pp. 295-301
74. Qin, BL; Guzman-Casillas, A; Schweitzer, EO
    A new method for protection zone selection in microprocessor-based bus relays
    IEEE TRANSACTIONS ON POWER DELIVERY
    
    B.L. Qin et al., "A new method for protection zone selection in microprocessor-based bus relays", IEEE POW D, 15(3), 2000, pp. 876-887
75. Morton, AB; Mareels, IMY
    An efficient brute-force solution to the network reconfiguration problem
    IEEE TRANSACTIONS ON POWER DELIVERY
    
    A.B. Morton e I.M.Y. Mareels, "An efficient brute-force solution to the network reconfiguration problem", IEEE POW D, 15(3), 2000, pp. 996-1000
76. Wu, FF; Ni, YX; Wei, P
    Power transfer allocation for open access using graph theory - Fundamentals and applications in systems without loopflow
    IEEE TRANSACTIONS ON POWER SYSTEMS
    
    F.F. Wu et al., "Power transfer allocation for open access using graph theory - Fundamentals and applications in systems without loopflow", IEEE POW SY, 15(3), 2000, pp. 923-929
77. Kuo, TC
    Disassembly sequence and cost analysis for electromechanical products
    ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING
    
    T.C. Kuo, "Disassembly sequence and cost analysis for electromechanical products", ROBOT CIM, 16(1), 2000, pp. 43-54
78. Brown, TX
    Cellular performance bounds via shotgun cellular systems
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
    
    T.X. Brown, "Cellular performance bounds via shotgun cellular systems", IEEE J SEL, 18(11), 2000, pp. 2443-2455
79. Buonsante, PF; Burioni, R; Cassi, D; Meccoli, I; Regina, S; Vezzani, A
    Quantum particles and Gaussian model on graphs
    PHYSICA A
    
    P.F. Buonsante et al., "Quantum particles and Gaussian model on graphs", PHYSICA A, 280(1-2), 2000, pp. 131-135
80. Cornwell, E
    A new vector for the structure the H. P. Schultz topological index.
    BOLETIN DE LA SOCIEDAD CHILENA DE QUIMICA
    
    E. Cornwell, "A new vector for the structure the H. P. Schultz topological index.", BOL SOC CH, 45(4), 2000, pp. 649-653
81. Johann, P
    On the structure of graphs with a unique k-factor
    JOURNAL OF GRAPH THEORY
    
    P. Johann, "On the structure of graphs with a unique k-factor", J GRAPH TH, 35(4), 2000, pp. 227-243
82. Kuyumcu, A; Garcia-Diaz, A
    A polyhedral graph theory approach to revenue management in the airline industry
    COMPUTERS & INDUSTRIAL ENGINEERING
    
    A. Kuyumcu e A. Garcia-Diaz, "A polyhedral graph theory approach to revenue management in the airline industry", COM IND ENG, 38(3), 2000, pp. 375-396
83. Gorman, SP; Malecki, EJ
    The networks of the Internet: an analysis of provider networks in the USA
    TELECOMMUNICATIONS POLICY
    
    S.P. Gorman e E.J. Malecki, "The networks of the Internet: an analysis of provider networks in the USA", TELECOMM PO, 24(2), 2000, pp. 113-134
84. Petrovic, M; Gutman, I; Lepovic, M; Milekic, B
    On bipartite graphs with small number of Laplacian eigenvalues greater than two and three
    LINEAR & MULTILINEAR ALGEBRA
    
    M. Petrovic et al., "On bipartite graphs with small number of Laplacian eigenvalues greater than two and three", LINEAR MULT, 47(3), 2000, pp. 205-215
85. Hassan, MMD
    Toward re-engineering models and algorithms of facility layout
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
    
    M.M.D. Hassan, "Toward re-engineering models and algorithms of facility layout", OMEGA-INT J, 28(6), 2000, pp. 711-723
86. Bunn, AG; Urban, DL; Keitt, TH
    Landscape connectivity: A conservation application of graph theory
    JOURNAL OF ENVIRONMENTAL MANAGEMENT
    
    A.G. Bunn et al., "Landscape connectivity: A conservation application of graph theory", J ENVIR MGM, 59(4), 2000, pp. 265-278
87. Lin, HM; Jou, JY
    On computing the minimum feedback vertex set of a directed graph by contraction operations
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
    
    H.M. Lin e J.Y. Jou, "On computing the minimum feedback vertex set of a directed graph by contraction operations", IEEE COMP A, 19(3), 2000, pp. 295-307
88. Caldwell, AE; Kahng, AB; Markov, IL
    Optimal partitioners and end-case placers for standard-cell layout
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
    
    A.E. Caldwell et al., "Optimal partitioners and end-case placers for standard-cell layout", IEEE COMP A, 19(11), 2000, pp. 1304-1313
89. Mitchell, I; Bavan, AS
    A connectionist inference model for pattern-directed knowledge representation
    EXPERT SYSTEMS
    
    I. Mitchell e A.S. Bavan, "A connectionist inference model for pattern-directed knowledge representation", EXPERT SYS, 17(2), 2000, pp. 106-113
90. Khadikar, PV; Karmarkar, S; Agrawal, VK; Mandloi, M; Joshi, S
    On the Szeged indices of [N]-cycles and monocycles containing acylic side chains
    NATIONAL ACADEMY SCIENCE LETTERS-INDIA
    
    P.V. Khadikar et al., "On the Szeged indices of [N]-cycles and monocycles containing acylic side chains", NATL ACAD S, 23(3-4), 2000, pp. 50-56
91. Chaudhuri, S; Zaroliagis, CD
    Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms
    ALGORITHMICA
    
    S. Chaudhuri e C.D. Zaroliagis, "Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms", ALGORITHMIC, 27(3-4), 2000, pp. 212-226
92. Aviles, R; Ajuria, G; Amezua, E; Gomez-Garay, V
    A finite element approach to the position problems in open-loop variable geometry trusses
    FINITE ELEMENTS IN ANALYSIS AND DESIGN
    
    R. Aviles et al., "A finite element approach to the position problems in open-loop variable geometry trusses", FINITE EL A, 34(3-4), 2000, pp. 233-255
93. El-Basil, S
    Clar sextet theory of buckminsterfullerene (C-60)
    JOURNAL OF MOLECULAR STRUCTURE-THEOCHEM
    
    S. El-Basil, "Clar sextet theory of buckminsterfullerene (C-60)", J MOL ST-TH, 531, 2000, pp. 9-21
94. Imai, H; Okahara, Y; Miyakoshi, M
    The period of powers of a fuzzy matrix
    FUZZY SETS AND SYSTEMS
    
    H. Imai et al., "The period of powers of a fuzzy matrix", FUZ SET SYS, 109(3), 2000, pp. 405-408
95. Cloppet, F; Oliva, JM; Stamon, G
    Angular bisector network, a simplified generalized voronoi diagram: Application to processing complex intersections in biomedical images
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
    
    F. Cloppet et al., "Angular bisector network, a simplified generalized voronoi diagram: Application to processing complex intersections in biomedical images", IEEE PATT A, 22(1), 2000, pp. 120-128
96. Castro, EA; Tueros, M; Toropov, AA
    Maximum topological distances based indices as molecular descriptors for QSPR - 2 - Application to aromatic hydrocarbons
    COMPUTERS & CHEMISTRY
    
    E.A. Castro et al., "Maximum topological distances based indices as molecular descriptors for QSPR - 2 - Application to aromatic hydrocarbons", COMPUT CHEM, 24(5), 2000, pp. 571-576
97. Liu, SS; Cai, SX; Cao, CZ; Li, ZL
    Molecular electronegative distance vector (MEDV) related to 15 properties of alkanes
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES
    
    S.S. Liu et al., "Molecular electronegative distance vector (MEDV) related to 15 properties of alkanes", J CHEM INF, 40(6), 2000, pp. 1337-1348
98. Nikolic, S; Trinajstic, N; Tolic, IM
    Complexity of molecules
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES
    
    S. Nikolic et al., "Complexity of molecules", J CHEM INF, 40(4), 2000, pp. 920-926
99. Schultz, HP; Schultz, TP
    Topological organic chemistry. 12. whole-molecule Schultz topological indices of alkanes
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES
    
    H.P. Schultz e T.P. Schultz, "Topological organic chemistry. 12. whole-molecule Schultz topological indices of alkanes", J CHEM INF, 40(1), 2000, pp. 107-112
100. Liang, WF; Shen, XJ
     Improved lightpath (wavelength) routing in large WDM networks
     IEEE TRANSACTIONS ON COMMUNICATIONS
     
     W.F. Liang e X.J. Shen, "Improved lightpath (wavelength) routing in large WDM networks", IEEE COMMUN, 48(9), 2000, pp. 1571-1579