D. Kral, J. Kratochvil, A. Proskurowski and H.-J. Voss, Coloring mixed
hypertrees, in Proceedings of26th International Workshop WG 2000,,
U. Brandes and D. Wagner (Eds.), Springer-Verlag, Lecture Notes in
Computer Science 1928, 279-289 (2000);
A.M. Farley, P. Fragopoulou, D. Krumme, A.
Proskurowski and D. Richards, Multi-source
spanning tree problems, J. of Interconnection Networks 1
(2000), pp. 61-71;
A.M. Farley, A.
Proskurowski, M. Skowronska, and M.M. Syslo, Hamiltonicity
of amalgams, Graphs and Combinatorics 15(4) (1999) pp.
393-404;
M. Hálldórsson, G. Kortsarz, A.
Proskurowski, R. Salman, H. Shachnai and J.A. Telle, Multicoloring
trees, in Proceedings of 5th Annual International Conference on
Computing and Combinatorics, COCOON'99, Tokyo, Japan, July 1999,
T. Asano, H. Imai, D.T. Lee, S. Nakano, T. Tokuyama (Eds.),
Springer-Verlag, Lecture Notes in Computer Science 1627, pp.
271-280;
A.M. Farley, P. Fragopoulou, D. Krumme, A.
Proskurowski and D. Richards, Multi-Source Spanning Tree Problems, in
Proceedings of SIROCCO'99 (Proceedings in Informatics 5), C.
Gavoile, J.-C. Bermond, A. Raspaud, eds. (Carleton Scientific), pp.
126-136;
A.M. Farley and A.
Proskurowski, Graph Theory and Communication Networks, guest editors,
Special
Issue of Parallel Processing Letters 8(2) (1998);
J. Kratochvil, A. Proskurowski and J.A. Telle, Complexity of graph
covering problems, Nordic Journal of Computing 5 (1998),
173-195;
J. Kratochvil, P. Manuel, M. Miller and A.
Proskurowski, Disjoint and fold domination in graphs, Australasian
Journal of Combinatorics, 18 (1998), 277-292;
A. Proskurowski, F. Ruskey and M. Smith,
Analysis of algorithms for listing equivalence classes of k-ary
strings, SIAM J. on Discrete Mathematics 11, 1(1998), 94-109;
A.M. Farley, 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;
J. Kratochvil, A. Proskurowski and J.A. Telle, Covering regular graphs,
Journal of Combinatorial Theory (B) 71 1(1997), 1-16;
J. Kratochvil, A. Proskurowski and J.A. Telle, Complexity of
colored graph covers, Proceedings of 28th Workshop on
Graph-Theoretic Concepts in Computer Science, WG'97, Berlin,
Springer-Verlag, Lecture Notes in Computer Science 1335 (1997),
242-257;
J. Kratochvil, A. Proskurowski and J.A. Telle, Complexity of
colored graph covers, in Proceedings of 23rd Workshop on Graph-Theoretic
Concepts in Computer Science, WG'97, Berlin, Springer-Verlag, Lecture
Notes in Computer Science (1997);
L. Cai, D.G. Corneil and A. Proskurowski, A generalization of line
graphs, J. of Graph Theory 21, 3(1996), 267-287;
J. Engelfriet, T. Harju, A. Proskurowski and G. Rozenberg,
Characterization and complexity of uniformly non-primitive labeled
2-structures, Theoretical Computer Science 154, 2(1996),
247-282;
A. Proskurowski and F.Ruskey, Generating binary trees by transpositions, Journal of Algorithms 11, 1(1990), 68-84;
G. Cheston, A.M. Farley, S.T. Hedetniemi and A. Proskurowski, Centering a spanning tree of a biconnected graph, Information Processing Letters 32 (1989), 247-250;
A. Proskurowski and F.Ruskey, Generating binary trees by transpositions, in Proceedings of the Scandinavian Workshop on Algorithm Theory, Springer--Verlag, Lecture Notes in Computer Science 318 (1988), 199-207;
A. Proskurowski and M.M.Syslo, Efficient vertex- and edge-coloring of outerplanar graphs, SIAM Journal of Algebraic and Discrete Methods 7, 1(1986), 131-136;
A. Proskurowski and F. Ruskey, Binary tree Gray codes, Journal of Algorithms 6, 2(1985), 225-238;
S.M. Hedetniemi, A. Proskurowski and M.M. Syslo, Interior graphs of maximal outerplanar graphs, Journal of Combinatorial Theory (series B) 38, 2(1985), 156-167;
A.M. Farley and A. Proskurowski, Extremal graphs with no disconnecting matching, in 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, in 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, in 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;
W. Proskurowski and A. Proskurowski, Construction of pandiagonal magic squares from circulant constant sum matrices, Ars Combinatoria 15 (1983), 153-162;
A. Proskurowski and E. Laiman, Fast enumeration, ranking, and unranking of binary trees, in Proceedings of the 13th South--Eastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, Congressus Numerantium 35 (1982), 401-413;
T.Beyer, S.M.Hedetniemi, S.T.Hedetniemi and A. Proskurowski, Tree traversal with minimum stack depth, in Proceedings of the 12th South--Eastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, Congressus Numerantium 32 (1981), 121-130;
A.M. Farley and A. Proskurowski, Computing the line index of a signed outerplanar graph, in Proceedings of the 12th South--Eastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, Congressus Numerantium 32 (1981), 159-162;
A. Proskurowski, Recursive graphs, recursive labelings, and shortest paths, SIAM Journal of Computing 10, 2(1981), 391-397;
A. Proskurowski, Minimum broadcast trees, IEEE Transactions on Computers C-30, 5(1981), 363-366;
A.M. Farley, S.T. Hedetniemi and A. Proskurowski, Partitioning trees: matching, domination, and maximum diameter, International Journal of Computer and Information Sciences 10, 1(1981), 55-61;
A. Proskurowski, On the generation of binary trees, JACM 27, 1(1980), 1-2;
A. Proskurowski and A.M. Farley, Two directed maximal-cut problems, in Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, Congressus Numerantium 26 (1980), 159-162;
M.L. Overton and A. Proskurowski, Canonical incidence matrices of graphs, BIT 19, 2(1979), 271-273;
T. Beyer, S. Hedetniemi, and S. Mitchell and A. Proskurowski, Independent domination in trees, in Proceedings of the 8th South--Eastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, (1977), 321-328;
T. Beyer and A. Proskurowski, Symmetries in graph coding, in Proceedings of Northwest 1976 ACM--CIPS Pacific Regional Symposium, 198-203 (1976);
A. Proskurowski, Search for unique incidence matrix of a graph, BIT 14 (1974), 209-226;
A. Proskurowski, Automatic generation of graphs, Ericsson Technics 29, 2(1973), 65-105;
A. Proskurowski, Graph symmetries in the search for the maximal incidence matrix, RIT-TTT-TR-75, The Royal Institute of Technology (1974);
A. Proskurowski, Automatic generation of graphs and the graph identification problem (PhD. Thesis), RIT-TTT-TR-76, The Royal Institute of Technology (1974);
A. Proskurowski, Centers of k-trees, CS-TR-79-9, University of Oregon (1979);
A.M.Farley and A. Proskurowski, Permutation machines, CIS-TR-80-3, University of Oregon (1980);
A.M.Farley and A. Proskurowski, Complexity of computing line index of a signed graph, CIS-TR-80-19, University of Oregon (1980);
A.M.Farley and A. Proskurowski, Minimum size matching immune graphs with no matching immune subgraphs, UO-CIS-TR-83-2, University of Oregon (1983);
A. Proskurowski and F. Ruskey, Research problem, Discrete Mathematics 65 (1987), 321-322;
Jan Kratochvil, A. Proskurowski and Jan Arne Telle, Complexity of graph covering problems, KAM 95-278, Charles University (1995);
L. Cai, D.G. Corneil and A. Proskurowski, Stable 2-pairs and (X,Y)-intersection graphs, Dept. of Comp. Sci. CS-TR-96-12, The Chinese University of Hong Kong (1996);