A.Gupta, N.Nishimura,
A.Proskurowski and P. Ragde, Embeddings of
k-connected graphs of pathwidth k,
Proceedings of SWAT'00, M. Hálldórsson (Ed.),
Springer-Verlag, Lecture Notes in Computer Science 1851, pp. 111-124
(2000);
A. Dessmark, A. Lingas and A. Proskurowski,
Faster algorithms for subgraph
isomorphism of k-connected partial k-trees, Algorithmica 27
(2000), pp. 337-347.;
B. Aspvall, A. Proskurowski and J.A.
Telle, Memory requirements for table
computations in partial k-trees, Algoritmica 27 (2000),
pp. 382-394;
A. Dessmark, A. Lingas and A. Proskurowski,
Maximum packing for k-connected partial k-trees in polynomial time,
Theoretical Computer Science 236(1-2) (2000), pp. 179-191;
A. Proskurowski and J.A. Telle, Classes of graphs with restricted
interval models, Discrete Mathematics & Theoretical Computer
Science 3 4 (1999), pp. 167-176;
A. Proskurowski and J.A. Telle, From bandwidth k
to pathwidth k, Proceedings of 5th Italian Conference on
Theoretical Computer Science, ICTCS'98, Prato, Italy, World
Scientific Publishing, 1998, pp. 90-101;
B. Aspvall,
A. Proskurowski and J.A. Telle, Memory requirements for table
computations in partial k-tree algorithms, Proceedings of
SWAT'98, Springer-Verlag, Lecture Notes in Computer Science 1432
(1998), 222-233;
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;
J.A. Telle and A. Proskurowski, Algorithms
for vertex partitioning problems on partial k-trees, SIAM
Journal on Discrete Mathematics 10,4 (1997) 529-550;
A. Dessmark, A. Lingas and A. Proskurowski, Faster
algorithms for subgraph isomorphism of k-connected partial
k-trees, in Proceedings of ESA, Barcelona 1996,
Springer-Verlag, Lecture Notes in Computer Science 1136 (1996);
S. Arnborg and A. Proskurowski, A technique for recognizing graphs of
bounded treewidth with applications to subclasses of partial 2-trees,
in Proceedings of the Fifth International Workshop on Graph
Grammars and Their Applications to Computer Science, Williamsburg,
VA, 1994, J. Cuny, H. Ehrig, G. Engels, G. Rozenberg, Eds.,
Springer-Verlag, Lecture Notes in Computer Science 1073, 469-486
(1996);
A. Proskurowski, M.M. Syslo and P. Winter, Plane
embeddings of 2-trees and biconnected partial 2-trees, SIAM
Journal on Discrete Mathematics 9, 4(1996), 277-296;
A. Proskurowski and J.A. Telle, From bandwidth k to pathwidth k,
Department of Informatics, TR 124, Bergen University (1996);
S. Arnborg, S.T. Hedetniemi and A. Proskurowski, Efficient Algorithms
and Partial k-trees, guest editors, Special Issue of
Discrete Applied Mathematics 54 (2-3) (1994);
J. Kratochvil, A. Proskurowski and J.A. Telle, Complexity of
graph covering problems, in Proceedings of 25th Workshop on
Graph-Theoretic Concepts in Computer Science, WG'94, Herrsching,
Springer-Verlag, Lecture Notes in Computer Science 903, 93-105
(1995);
S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese, An algebraic theory
of graph reduction, JACM 40 (1993), 1134-1164;
J.A. Telle and A. Proskurowski, Efficient sets in partial
k-trees,
Discrete Applied Mathematics 44 (1993), 109-117;
A. Proskurowski, Graph reductions, and techniques for finding minimal
forbidden minors, Proceedings of AMS Workshop on Graph Minors,
Seattle 1991, Contemporary Mathematics, AMS, volume 147, "Graph
Structure Theory", 591-600 (1993);
A. Proskurowski and J.A. Telle, Practical algorithms in partial k-trees and domination-like problems, in Proceedings of Workshop on Algorithms and Data Structures, WADS'93, Montreal, Springer-Verlag, Lecture Notes in Computer Science 709, 610-621 (1993);
S.Arnborg and A. Proskurowski, Canonical representations of partial 2- and 3-trees, BIT 32, 2(1992), 197-214;
S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese, An algebraic theory of graph reduction, in Proceedings of the Fourth International Workshop on Graph Grammars and Their Applications to Computer Science, H. Ehrig, H.-J. Kreowski, G. Rozenberg, Eds., Springer-Verlag, Lecture Notes in Computer Science 532, 70-83 (1991);
S. Arnborg, A. Proskurowski and D. Seese, Monadic second order logic, tree automata and forbidden minors, in Proceedings of Computer Science Logic 1990, CSL'90, Heidelberg, Springer-Verlag, Lecture Notes in Computer Science 533, 1-16 (1991);
S.Arnborg and A. Proskurowski, Canonical representations of partial 2- and 3-trees, in Proceedings of the Second Scandinavian Workshop on Algorithm Theory, Springer-Verlag, Lecture Notes in Computer Science 477, 310-319 (1990);
S.Arnborg, A. Proskurowski and D.G.Corneil, Forbidden minors characterization of partial 3-trees, Discrete Mathematics 80, (1990), 1-19;
A. Proskurowski and M.M. Syslo, Efficient computations in tree-like graphs, Computing Supplementum 7 (1990), 1-15;
A. Proskurowski, Maximal graphs of path-width k or searching a partial k-caterpillar, UO-CIS-TR-89-17, University of Oregon (1989);
S.Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Mathematics 23, 1(1989), 11-24;
A.Lingas and A. Proskurowski, On parallel complexity of the subgraph homeomorphism and the subgraph isomorphism problems for classes of planar graphs, Theoretical Computer Science 68, 2(1989), 155-174;
S.Arnborg, A. Proskurowski and D.G.Corneil, Forbidden minors characterization of partial 3-trees, in Proceedings of the Seventh Hungarian Colloquium on Combinatorics,Colloquia Mathematica Societatis Janos Bolyai 52 (1988), 49-62;
A.Lingas and A. Proskurowski, Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problems for classes of planar graphs, Proceedings of the Seventh Conference on Foundations of Software Technology and Theoretical Computer Science, K.V.Nori, Ed., Springer--Verlag, Lecture Notes in Computer Science 287 (1987);
S.Arnborg, D.G.Corneil and A. Proskurowski, Complexity of finding embeddings in k-trees, SIAM Journal of Algebraic and Discrete Methods 8, 2(1987), 277-284;
S.Arnborg and A. Proskurowski, Characterization and recognition of partial 3-trees, SIAM Journal of Algebraic and Discrete Methods 7, 2(1986), 305-314;
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;
S.Arnborg and A. Proskurowski, Problems on graphs with bounded decomposability, in Proceedings of the 17th South--Eastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, Congressus Numerantium 53 (1986), 167-170;
S.Arnborg and A. Proskurowski, Problems on graphs with bounded decomposability, Bulletin of the European Association for Theoretical Computer Science (1985);
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;
S.Arnborg and A. Proskurowski, Recognition of partial k-trees, in Proceedings of the 16th South--Eastern International Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, Congressus Numerantium 47 (1985), 69-75;
A. Proskurowski, Separating subgraphs in k-trees: cables and caterpillars, Discrete Mathematics 49 (1984), 275-285;
A. Proskurowski, Distances in k-trees, in D.Sottau, ed., Problems on diameters, ERA 452 CNRS, Paris (1983);
M.M. Syslo and A. Proskurowski, On Halin graphs, in Proceedings of Lagow 1981 Graph Theory Conference, M.Borowiecki, J.W.Kennedy, M.M.Syslo, Eds., Springer--Verlag Lecture Notes in Mathematics 1018 (1983), 248-256;
M.M.Klawe, D.G.Corneil and A. Proskurowski, Isomorphism testing in hook-up graphs, SIAM Journal on Algebraic and Discrete Methods 3, 2(1982), 260-274;
A. Proskurowski, Recursive graphs, recursive labelings, and shortest paths, SIAM Journal of Computing 10, 2(1981), 391-397;
A. Proskurowski and M.M. Syslo, Minimum dominating cycles in outerplanar graphs, International Journal of Computer and Information Sciences 10, 2(1981), 127-139;
A. Proskurowski, K-trees: representation and distances, in Proceedings of the 11th South--Eastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, Congressus Numerantium 29 (1980), 785-794
A. Proskurowski, Centers of 2-trees, in Proceedings of the 2nd Combinatorial Conference France--Canada, Annals of Discrete Mathematics 9 (1980), 1-5;
A. Proskurowski, Centers of maximal outerplanar graphs, Journal of Graph Theory 4, 2(1980), 75-79;
A.M.Farley and A. Proskurowski, Computation of the center and diameter of outerplanar graphs, Discrete Applied Mathematics 2, (1980), 185-191;
A. Proskurowski, Centers of k-trees, CS-TR-79-9, University of Oregon (1979);
A. Proskurowski, Minimum dominating cycles in two-trees, International Journal of Computer and Information Science 8, 5(1979), 405-417;