The complexity of reliability computations in planar and acyclic graphs

Path set selection in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing

Assessing Reliability of Multistage Interconnection Networks

IEEE Transactions on Computers

CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks

IEEE Transactions on Parallel and Distributed Systems

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes

Theoretical Computer Science

SIGACT News complexity theory column 41

ACM SIGACT News

Probability of connection in regular stochastic networks

ACM SIGMETRICS Performance Evaluation Review

Evaluation of all one-to-many reliabilities for acyclic multistate-node distributed computing system under cost and capacity constraints

Computer Communications

Inequalities on the Number of Connected Spanning Subgraphs in a Multigraph

IEICE - Transactions on Information and Systems

A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ⌈(3-22)n2+n-7-2222⌉ edges

Discrete Applied Mathematics

Stochastic minimum spanning trees in euclidean spaces

Proceedings of the twenty-seventh annual symposium on Computational geometry

Analysis and synthesis problems for network resilience

Mathematical and Computer Modelling: An International Journal

A factoring approach for the stochastic shortest path problem

Operations Research Letters