Constructive Visual Imagery And Perception. - Arthur M. Farley (IJCAI, 1975)

The Coordination of Multiple Goal Satisfaction. - Arthur M. Farley (IJCAI, 1977)

Minimum broadcast graphs. - Arthur M. Farley; Stephen T. Hedetniemi; Sandra Mitchell Mitchell; Andrzej Proskurowski (Discret. Math., 1979)

On Waiting. - Arthur M. Farley (AAAI, 1980)

Computation of the center and diameter of outerplanar graphs. - Arthur M. Farley; Andrzej Proskurowski (Discret. Appl. Math., 1980)

Levelling Terrain Trees: A Transshipment Problem. - Arthur M. Farley (Inf. Process. Lett., 1980)

Minimum-time line broadcast networks. - Arthur M. Farley (Networks, 1980)

Rectilinear Steiner Trees in Rectangle Trees. - Arthur M. Farley; Stephen T. Hedetniemi; Sandra L. Mitchell (SIAM J. Algebraic Discret. Methods, 1980)

Issues in Knowledge-Based Problem Solving. - Arthur M. Farley (IEEE Trans. Syst. Man Cybern., 1980)

Partitioning trees: Matching, domination, and maximum diameter. - Arthur M. Farley; Stephen T. Hedetniemi; Andrzej Proskurowski (Int. J. Parallel Program., 1981)

Networks immune to isolated failures. - Arthur M. Farley (Networks, 1981)

Directed Maximal-Cut Problems. - Arthur M. Farley; Andrzej Proskurowski (Inf. Process. Lett., 1982)

Networks immune to isolated line failures. - Arthur M. Farley; Andrzej Proskurowski (Networks, 1982)

An intelligent tutor for high school algebra problems: Oregon State University. - William Bregar; Arthur M. Farley (SIGART Newsl., 1982)

A probabilistic model for uncertain problem solving. - Arthur M. Farley (IEEE Trans. Syst. Man Cybern., 1983)

Knowledge sources for an intelligent algebra tutor. - William S. Bergar; Arthur M. Farley; Garland Bayley (Comput. Intell., 1986)

Plan Abstraction Based on Operator Generalization. - John S. Anderson; Arthur M. Farley (AAAI, 1988)

Diagnostic Mechanism Modeling. - Arthur M. Farley (Int. J. Pattern Recognit. Artif. Intell., 1989)

Centering a Spanning Tree of a Biconnected Graph. - Grant A. Cheston; Arthur M. Farley; Stephen T. Hedetniemi; Andrzej Proskurowski (Inf. Process. Lett., 1989)

Shifting Ontological Perspectives in Reasoning About Physical Systems. - Zheng-Yang Liu; Arthur M. Farley (AAAI, 1990)

Structural Aggregation in Common-Sense Reasoning. - Zheng-Yang Liu; Arthur M. Farley (AAAI, 1991)

Self-Repairing Networks. - Arthur M. Farley; Andrzej Proskurowski (Parallel Process. Lett., 1993)

Bounded-call broadcasting. - Arthur M. Farley; Andrzej Proskurowski (Discret. Appl. Math., 1994)

Burden of Proof in Legal Argumentation. - Arthur M. Farley; Kathleen Freeman (ICAIL, 1995)

Causal reasoning in econometric models. - Kuan-Pin Lin; Arthur M. Farley (Decis. Support Syst., 1995)

A Model of Argumentation and Its Application to Legal Reasoning. - Kathleen Freeman; Arthur M. Farley (Artif. Intell. Law, 1996)

Minimum-cost Line Broadcast in Paths. - Satoshi Fujita; Arthur M. Farley (Discret. Appl. Math., 1997)

Minimum Self-Repairing Graphs. - Arthur M. Farley; Andrzej Proskurowski (Graphs Comb., 1997)

Minimum-time multidrop broadcast. - Arthur M. Farley; Andrzej Pelc; Andrzej Proskurowski (Discret. Appl. Math., 1998)

Optimally Routable Networks. - Arthur M. Farley (Parallel Process. Lett., 1998)

Reasoning about Linear Circuits: A Model-Based Approach. - Juan J. Flores; Arthur M. Farley (AI Commun., 1999)

Hamiltonicity of Amalgams. - Arthur M. Farley; Andrzej Proskurowski; Miroslawa Skowronska; Maciej M. Syslo (Graphs Comb., 1999)

Multi-Source Spanning Tree Problems. - Arthur M. Farley; Paraskevi Fragopoulou; David W. Krumme; Andrzej Proskurowski; Dana Richards (J. Interconnect. Networks, 2000)

Sparse Hypercube - Minimal k-line Broadcast Graph. - Satoshi Fujita; Arthur M. Farley (Discret. Appl. Math., 2003)

Spanners and message distribution in networks. - Arthur M. Farley; Andrzej Proskurowski; Daniel Zappala; Kurt J. Windisch (Discret. Appl. Math., 2004)

Minimal path broadcast networks. - Arthur M. Farley (Networks, 2004)

Population Structure and Artificial Evolution. - Arthur M. Farley (Artificial Evolution, 2005)

Priority-Consistent Graphs. - Arthur M. Farley; Andrzej Proskurowski (Electron. Notes Discret. Math., 2005)

Choice and development. - Arthur M. Farley (GECCO (Companion), 2007)

Internationalization of computer science education. - Sarah A. Douglas; Arthur M. Farley; Ginnie Lo; Andrzej Proskurowski; Michal Young (SIGCSE, 2010)

Obstructions for linear rankwidth at most 1 - Isolde Adler; Arthur M. Farley; Andrzej Proskurowski (CoRR, 2011)

Intensive international Summer Schools in Global Distributed Software Development. - Arthur M. Farley; Stuart R. Faulk; Virginia Lo; Andrzej Proskurowski; Michal Young (FIE, 2012)

Extremal graphs having no matching cuts. - Paul S. Bonsma; Arthur M. Farley; Andrzej Proskurowski (J. Graph Theory, 2012)

Obstructions for linear rank-width at most 1. - Isolde Adler; Arthur M. Farley; Andrzej Proskurowski (Discret. Appl. Math., 2014)

Qualitative bifurcation diagrams. - Héctor Rodríguez 001; Arthur M. Farley; Juan J. Flores; Andrzej Proskurowski (Expert Syst. J. Knowl. Eng., 2014)

The complexity of the defensive domination problem in special graph classes. - Tínaz Ekim; Arthur M. Farley; Andrzej Proskurowski (Discret. Math., 2020)

Defensive domination in proper interval graphs. - Tínaz Ekim; Arthur M. Farley; Andrzej Proskurowski; Mordechai Shalom (Discret. Appl. Math., 2023)