default search action

combined dblp search
author search
venue search
publication search

ask others

Jane N. Hagstrom

Jane Nichols Hagstrom

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

1998
[j9]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/dam/BallHP98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BallHP98
Michael O. Ball, Jane N. Hagstrom, J. Scott Provan:
Two-path Subsets: Efficient Counting and Applications to Performability Analysis. Discret. Appl. Math. 85(1): 25-45 (1998)
1995
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/BallHP95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BallHP95
Michael O. Ball, Jane N. Hagstrom, J. Scott Provan:
Threshold reliability of networks with small failure sets. Networks 25(3): 101-115 (1995)
1994
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/HagstromHOPS94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/HagstromHOPS94
Jane N. Hagstrom, Ray Hagstrom, Ross A. Overbeek, Morgan Price, Linus Schrage:
Maximum likelihood genetic sequence reconstruction from oligo content. Networks 24(5): 297-302 (1994)
1991
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/Hagstrom91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Hagstrom91
Jane N. Hagstrom:
Computing rooted communication reliability in an almost acyclic digraph. Networks 21(5): 581-593 (1991)
1990
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/Hagstrom90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Hagstrom90
Jane Nichols Hagstrom:
Directed network reliability: Domination and computing coefficients of the success-marginal expansion. Networks 20(1): 65-78 (1990)
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/Hagstrom90a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Hagstrom90a
Jane N. Hagstrom:
Computing the probability distribution of project duration in a PERT network. Networks 20(2): 231-244 (1990)
1988
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/Hagstrom88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Hagstrom88
Jane N. Hagstrom:
Computational complexity of PERT problems. Networks 18(2): 139-147 (1988)
1984
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/Hagstrom84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Hagstrom84
Jane N. Hagstrom:
Note on independence of arcs in antiparallel for network flow problems. Networks 14(4): 567-570 (1984)
1981
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/SatyanarayanaH81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/SatyanarayanaH81
A. Satyanarayana, Jane N. Hagstrom:
Combinatorial properties of directed graphs useful in computing network reliability. Networks 11(4): 357-366 (1981)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.