AAAAAA
Results:
1-10
|
Results: 10
Authors:
FARLEY AM
PELC A
PROSKUROWSKI A
Citation: Am. Farley et al., MINIMUM-TIME MULTIDROP BROADCAST, Discrete applied mathematics, 83(1-3), 1998, pp. 61-77
Authors:
PROSKUROWSKI A
RUSKEY F
SMITH M
Citation: A. Proskurowski et al., ANALYSIS OF ALGORITHMS FOR LISTING EQUIVALENCE CLASSES OF K-ARY STRINGS, SIAM journal on discrete mathematics, 11(1), 1998, pp. 94-109
Authors:
TELLE JA
PROSKUROWSKI A
Citation: Ja. Telle et A. Proskurowski, FOR VERTEX PARTITIONING PROBLEMS ON PARTIAL K-TREES, SIAM journal on discrete mathematics, 10(4), 1997, pp. 529-550
Authors:
KRATOCHVIL J
PROSKUROWSKI A
TELLE JA
Citation: J. Kratochvil et al., COVERING REGULAR GRAPHS, J COMB TH B, 71(1), 1997, pp. 1-16
Authors:
PROSKUROWSKI A
SYSLO MM
WINTER P
Citation: A. Proskurowski et al., PLANE EMBEDDINGS OF 2-TREES AND BICONNECTED PARTIAL 2-TREES, SIAM journal on discrete mathematics, 9(4), 1996, pp. 577-596
Authors:
CAI LZ
CORNEIL D
PROSKUROWSKI A
Citation: Lz. Cai et al., A GENERALIZATION OF LINE GRAPHS - (X,Y)-INTERSECTION GRAPHS, Journal of graph theory, 21(3), 1996, pp. 267-287
Authors:
ENGELFRIET J
HARJU T
PROSKUROWSKI A
ROZENBERG G
Citation: J. Engelfriet et al., CHARACTERIZATION AND COMPLEXITY OF UNIFORMLY NONPRIMITIVE LABELED 2-STRUCTURES, Theoretical computer science, 154(2), 1996, pp. 247-282
Authors:
FARLEY AM
PROSKUROWSKI A
Citation: Am. Farley et A. Proskurowski, BOUNDED-CALL BROADCASTING, Discrete applied mathematics, 53(1-3), 1994, pp. 37-53
Authors:
TELLE JA
PROSKUROWSKI A
Citation: Ja. Telle et A. Proskurowski, EFFICIENT SETS IN PARTIAL K-TREES, Discrete applied mathematics, 44(1-3), 1993, pp. 109-117
Authors:
ARNBORG S
COURCELLE B
PROSKUROWSKI A
SEESE D
Citation: S. Arnborg et al., AN ALGEBRAIC-THEORY OF GRAPH REDUCTION, Journal of the Association for Computing Machinery, 40(5), 1993, pp. 1134-1164
Risultati:
1-10
|