Edward J. Farrell

25 papers Journal 24Unranked 1

Year	Rank	Type	Title / Venue / Authors
2016	J	`jnl`	D-Graphs For Graphs With Cyclomatic Number 1. Ars Comb. Edward J. Farrell, Andrew A. Hunte
1995	J	`jnl`	The matching polynomial of a regular graph. Discret. Math. Robert A. Beezer, Edward J. Farrell
1992	J	`jnl`	A Modeling Study of the North Atlantic with Emphasis on the Greenland-Iceland-Norwegian Sea. IBM Syst. J. Trond Aukrust, Josef M. Oberhuber, Edward J. Farrell, Peter M. Haugan
1991	J	`jnl`	On matching coefficients. Discret. Math. Edward J. Farrell, J. M. Guo, Gregory M. Constantine
1991	J	`jnl`	Preface. IBM J. Res. Dev. Edward J. Farrell
1991	J	`jnl`	Visual interpretation of multidimensional computations and transistor design. IBM J. Res. Dev. Edward J. Farrell, Perry A. Appino, Daniel Foty, Thomas D. Linton Jr.
1987	J	`jnl`	Visual Interpretation of Complex Data. IBM Syst. J. Edward J. Farrell
1985	J	`jnl`	Animated 3D CT Imaging. IEEE Computer Graphics and Applications Edward J. Farrell, Wen C. Yang, Rosario A. Zappulla
1985	J	`jnl`	Animation and 3D Color Display of Multiple-Variable Data: Application to Semiconductor Design. IBM J. Res. Dev. Edward J. Farrell, Steven E. Laux, Philip L. Corson, Edward M. Buturla
1984	J	`jnl`	Color 3-D Imaging of Normal and Pathologic Intracranial Structures. IEEE Computer Graphics and Applications Edward J. Farrell, Rosario A. Zappulla, Wen C. Yang
1984	J	`jnl`	Matchings in benzene chains. Discret. Appl. Math. Edward J. Farrell, S. A. Wahid
1984	J	`jnl`	Matchings in pentagonal chains. Discret. Appl. Math. Edward J. Farrell, S. A. Wahid
1983	J	`jnl`	Color Display and Interactive Interpretation of Three-Dimensional Data. IBM J. Res. Dev. Edward J. Farrell
1983	J	`jnl`	Forest decompositions of ladders. Discret. Math. Edward J. Farrell
1982	J	`jnl`	A note on the circuit polynomials and characteristic polynomials of wheels and ladders. Discret. Math. Edward J. Farrell
1982	J	`jnl`	Cycle decompositions of complete graphs. Discret. Math. Edward J. Farrell
1981	J	`jnl`	Defect-d matchings in graphs with cyclomatic numbers 0, 1 and 2. Discret. Math. Edward J. Farrell
1980	J	`jnl`	Chromatic roots - some observations and conjectures. Discret. Math. Edward J. Farrell
1980	J	`jnl`	On chromatic coefficients. Discret. Math. Edward J. Farrell
1979	J	`jnl`	An introduction to matching polynomials. J. Comb. Theory B Edward J. Farrell
1979	J	`jnl`	On a class of polynomials obtained from the circuits in a graph and its application to characteristics polynomials of graphs. Discret. Math. Edward J. Farrell
1979	J	`jnl`	On a general class of graph polynomials. J. Comb. Theory B Edward J. Farrell
1977	J	`jnl`	On graphical partitions and planarity. Discret. Math. Edward J. Farrell
1966	J	`jnl`	Minimum length matched filters for digital applications (Corresp.). IEEE Trans. Inf. Theory Edward J. Farrell
1962	—	`conf`	Computer design: Applications of redundancy to improve the accuracy of binary systems. ACM National Conference Edward J. Farrell