A.M. Farley, P. Fragopoulou, D. Krumme, A. Proskurowski, and D. Richards, Multi-source spanning tree problems, J. of Interconnection Networks 1 (2000), 61-71;
A.M. Farley, A. Proskurowski, M. Skowronska and M.M. Syslo, Hamiltonicity of amalgams, Graphs and Combinatorics 15(4) (1999), 393-405;
A.M. Farley and A. Pelc, and A. Proskurowski, Minimum-time multidrop broadcast,
Discrete Applied Mathematics 82 1-3(1998), 59-75;
A.M. Farley and A. Proskurowski, Minimum self-repairing graphs, Graphs and Combinatorics 13 (1997), 345-351;
A. M. Farley and A. Proskurowski, Limited-penalty immune networks, Proceedings of the 25th SouthEastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, Congressus Numerantium 103 (1994), 33-39;
A.M. Farley and A. Proskurowski, Self-repairing networks, Parallel
Processing Letters 3, 4(1994), 381-391;
A.M. Farley and A. Proskurowski, Bounded-call broadcasting, Discrete
Applied Mathematics 53 (1994), 37-53;
A.M.Farley and A. Proskurowski, Isolated template immunity,
UO-TR-92-01, University of Oregon (1992);
A.M.Farley and A. Proskurowski, Broadcasting: between whispering and
shouting, Proceedings of the 20th South-Eastern Conference on
Combinatorics, Graph Theory and Computing, Utilitas Mathematica,
Winnipeg, Congressus Numerantium 72, 209-212 (1990);
A.M.Farley and A. Proskurowski, The design of template immune
networks: path immunity, Proceedings of the 20th South-Eastern
Conference on Combinatorics, Graph Theory and Computing, Utilitas
Mathematica, Winnipeg, Congressus Numerantium 71, 5-16 (1990);
A.M.Farley and A. Proskurowski, Immunity to subgraph failures in
communication networks, Proceedings of the 18th South-Eastern
Conference on Combinatorics, Graph Theory and Computing, Utilitas
Mathematica, Winnipeg, Congressus Numerantium 62 (1988),
49-58;
A.M.Farley and A. Proskurowski, Extremal graphs with no disconnecting
matching, Proceedings of the 14th
South-Eastern Conference on Combinatorics, Graph Theory and
Computing, Utilitas Mathematica, Winnipeg, Congressus Numerantium 41
(1984), 153-165;
A.M.Farley and A. Proskurowski, Computing the maximum order of an open
irredundant set in a tree, Proceedings of the
2nd West Coast Conference on Computing in Graph Theory, Utilitas
Mathematica, Winnipeg, Congressus Numerantium 41 (1984), 219-228;
C.J.Colbourn and A. Proskurowski, Concurrent transmissions in
broadcast networks, Proceedings of the 11th International
Colloquium on Automata, Languages, and Programming, J.Paredaens, Ed.,
Springer-Verlag Lecture Notes in Computer Science 172 (1984),
128-136;
A.M.Farley and A. Proskurowski, Networks immune to isolated line
failures, Networks 12, 4(1982), 393-403;
A. Proskurowski, Minimum broadcast trees, IEEE Transactions on
Computers C-30, 5(1981), 363-366;
A.M.Farley and A. Proskurowski, Broadcasting in trees with multiple
originators, SIAM Journal of Algebraic and
Discrete Methods 2, 4(1981), 381-386;
A.M.Farley and A. Proskurowski, Gossiping in grid graphs, Journal of
Combinatorics, Information and System Science 5 , 2(1980), 161-172;
A.M.Farley, S.Hedetniemi, S.Mitchell and A. Proskurowski, Minimum
broadcast graphs, Discrete Mathematics 25, 2(1979), 189-193;