The Tutte polynomial of a ported matroid. - Seth Chaiken (J. Comb. Theory B, 1989)

Computing Geographic Nearest Neighbors Using Monotone Matrix Searching (Preliminary Version). - Young C. Wee; Seth Chaiken; Dan E. Willard (ACM Conference on Computer Science, 1990)

On the Angle Restricted Nearest Neighbor Problem. - Young C. Wee; Seth Chaiken; Dan E. Willard (Inf. Process. Lett., 1990)

Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors. - Young C. Wee; Seth Chaiken; S. S. Ravi (Algorithmica, 1994)

The All-Minors VCCS Matrix Tree Theorem, Half-Resistors and Applications in Symbolic Simulation. - Seth Chaiken; Paliath Narendran (ISCAS, 1995)

Validated observation and reporting of microscopic performance using Pentium II counter facilities. - Haleh Najafzadeh; Seth Chaiken (WOSP, 2004)

Towards a framework for source code instrumentation measurement validation. - Haleh Najafzadeh; Seth Chaiken (WOSP, 2005)

A q-Queens Problem. I. General Theory. - Seth Chaiken; Christopher R. H. Hanusa; Thomas Zaslavsky (Electron. J. Comb., 2014)

A q-queens problem III. Nonattacking partial queens. - Seth Chaiken; Christopher R. H. Hanusa; Thomas Zaslavsky (Australas. J Comb., 2019)

A q-queens problem. VI. The bishops' period. - Seth Chaiken; Christopher R. H. Hanusa; Thomas Zaslavsky (Ars Math. Contemp., 2019)

A q-Queens Problem IV. Attacking configurations and their denominators. - Seth Chaiken; Christopher R. H. Hanusa; Thomas Zaslavsky (Discret. Math., 2020)

A Theory for Coloring Walks in a Digraph. - Seth Chaiken (CoRR, 2024)