Items Authored by Chaiken, Seth

This query took 0.787 seconds

Items Authored by Chaiken, Seth

[PREV

Items: 1 - 12 of 12

Select format:

[1]

97e:05058 Chaiken, Seth Oriented matroid pairs, theory and an electric application. Matroid theory (Seattle, WA, 1995), 313--331, Contemp. Math., 197, Amer. Math. Soc., Providence, RI, 1996. (Reviewer: Jesús A. de Loera) 05B35 (15A06 52B40 94C05)

[2]

95k:68232 Wee, Y. C.; Chaiken, S.; Ravi, S. S. Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors. Algorithmica 12 (1994), no. 6, 421--435. 68U05 (68Q25 68R10)

[3]

91e:68033 Wee, Young C.; Chaiken, Seth; Willard, Dan E. On the angle restricted nearest neighbor problem. Inform. Process. Lett. 34 (1990), no. 2, 71--76. 68P10 (68U05)

[4]

90d:05066 Chaiken, Seth The Tutte polynomial of a ported matroid. J. Combin. Theory Ser. B 46 (1989), no. 1, 96--117. (Reviewer: Ulrich Faigle) 05B35

[5]

89k:90165 Chaiken, Seth Extremal length and width of blocking polyhedra, Kirchhoff spaces and multiport networks. SIAM J. Algebraic Discrete Methods 8 (1987), no. 4, 635--645. (Reviewer: Kenji Onaga) 90C35 (05B35 90B10 94C30)

[6]

85i:05069 Chaiken, Seth A matroid abstraction of the Bott\mhy Duffin constrained inverse. SIAM J. Algebraic Discrete Methods 4 (1983), no. 4, 467--475. 05B35

[7]

84b:68084 Chaiken, S.; Dewdney, A. K.; Slater, P. J. An optimal diagonal tree code. SIAM J. Algebraic Discrete Methods 4 (1983), no. 1, 42--49. 68E10 (05C05)

[8]

83h:05062 Chaiken, Seth A combinatorial proof of the all minors matrix tree theorem. SIAM J. Algebraic Discrete Methods 3 (1982), no. 3, 319--329. (Reviewer: W.-K. Chen) 05C50 (05C05)

[9]

82m:52007 Chaiken, Seth; Kleitman, Daniel J.; Saks, Michael; Shearer, James Covering regions by rectangles. SIAM J. Algebraic Discrete Methods 2 (1981), no. 4, 394--410. (Reviewer: Steven R. Lay) 52A45 (05B40 52A10 94C99)

[10]

81m:05070 Chaiken, S.; Kleitman, D. J.; Li, S.-Y. R. Possible degrees of strongly $2$-connected graphs. Second International Conference on Combinatorial Mathematics (New York, 1978), pp. 119--129, Ann. New York Acad. Sci., 319, New York Acad. Sci., New York, 1979. (Reviewer: A. K. Kelmans) 05C20 (05C40)

[11]

58 #314 Chaiken, S.; Kleitman, D. J. Matrix tree theorems. J. Combinatorial Theory Ser. A 24 (1978), no. 3, 377--381. (Reviewer: R. C. Read) 05C05

[12]

1 018 614 Chaiken, Seth; Murray, Neil V.; Rosenthal, Erik An application of $P\sb 4$-free graphs in theorem-proving. Combinatorial Mathematics: Proceedings of the Third International Conference (New York, 1985), 106--121, Ann. New York Acad. Sci., 555, New York Acad. Sci., New York, 1989. 68T15 (05C99)

Items: 1 - 12 of 12