Arthur M. Farley

Publication Activity (10 Years)

Years Active: 1975-2023
Publications (10 Years): 3

Top Topics

Graph Theoretic

Quantitative Data

Graphical Representation

Top Venues

Discret. Appl. Math.

Expert Syst. J. Knowl. Eng.

Publications

Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
Defensive domination in proper interval graphs. Discret. Appl. Math. 331 (2023)
Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski
The complexity of the defensive domination problem in special graph classes. Discret. Math. 343 (2) (2020)
Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
Defensive Domination in Proper Interval Graphs. CoRR (2020)
Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
Obstructions for linear rank-width at most 1. Discret. Appl. Math. 168 (2014)
Héctor Rodríguez, Arthur M. Farley, Juan J. Flores, Andrzej Proskurowski
Qualitative bifurcation diagrams. Expert Syst. J. Knowl. Eng. 31 (4) (2014)
Paul S. Bonsma, Arthur M. Farley, Andrzej Proskurowski
Extremal graphs having no matching cuts. J. Graph Theory 69 (2) (2012)
Arthur M. Farley, Stuart R. Faulk, Virginia Lo, Andrzej Proskurowski, Michal Young
Intensive international Summer Schools in Global Distributed Software Development. FIE (2012)
Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
Obstructions for linear rankwidth at most 1 CoRR (2011)
Sarah A. Douglas, Arthur M. Farley, Ginnie Lo, Andrzej Proskurowski, Michal Young
Internationalization of computer science education. SIGCSE (2010)
Arthur M. Farley
Choice and development. GECCO (Companion) (2007)
Arthur M. Farley, Andrzej Proskurowski
Priority-Consistent Graphs. Electron. Notes Discret. Math. 22 (2005)
Arthur M. Farley
Population Structure and Artificial Evolution. Artificial Evolution (2005)
Arthur M. Farley
Minimal path broadcast networks. Networks 43 (2) (2004)
Arthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch
Spanners and message distribution in networks. Discret. Appl. Math. 137 (2) (2004)
Satoshi Fujita, Arthur M. Farley
Sparse Hypercube - Minimal k-line Broadcast Graph. Discret. Appl. Math. 127 (3) (2003)
Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards
Multi-Source Spanning Tree Problems. J. Interconnect. Networks 1 (1) (2000)
Arthur M. Farley, Andrzej Proskurowski, Miroslawa Skowronska, Maciej M. Syslo
Hamiltonicity of Amalgams. Graphs Comb. 15 (4) (1999)
Satoshi Fujita, Arthur M. Farley
Sparse Hypercube: A Minimal k-Line Broadcast Graph. IPPS/SPDP (1999)
Juan J. Flores, Arthur M. Farley
Reasoning about Linear Circuits: A Model-Based Approach. AI Commun. 12 (1-2) (1999)
Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards
Multi-Source Spanning Tree Problems. SIROCCO (1999)
Arthur M. Farley
Optimally Routable Networks. Parallel Process. Lett. 8 (4) (1998)
Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski
Minimum-time multidrop broadcast. Discret. Appl. Math. 83 (1-3) (1998)
Satoshi Fujita, Arthur M. Farley
Minimum-cost Line Broadcast in Paths. Discret. Appl. Math. 75 (3) (1997)
Arthur M. Farley, Andrzej Proskurowski
Minimum Self-Repairing Graphs. Graphs Comb. 13 (4) (1997)
Kathleen Freeman, Arthur M. Farley
A Model of Argumentation and Its Application to Legal Reasoning. Artif. Intell. Law 4 (3-4) (1996)
Arthur M. Farley, Kathleen Freeman
Burden of Proof in Legal Argumentation. ICAIL (1995)
Kuan-Pin Lin, Arthur M. Farley
Causal reasoning in econometric models. Decis. Support Syst. 15 (2) (1995)
Arthur M. Farley, Andrzej Proskurowski
Bounded-call broadcasting. Discret. Appl. Math. 53 (1-3) (1994)
Arthur M. Farley, Andrzej Proskurowski
Self-Repairing Networks. Parallel Process. Lett. 3 (1993)
Zheng-Yang Liu, Arthur M. Farley
Structural Aggregation in Common-Sense Reasoning. AAAI (1991)
Zheng-Yang Liu, Arthur M. Farley
Shifting Ontological Perspectives in Reasoning About Physical Systems. AAAI (1990)
Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski
Centering a Spanning Tree of a Biconnected Graph. Inf. Process. Lett. 32 (5) (1989)
Arthur M. Farley
Diagnostic Mechanism Modeling. Int. J. Pattern Recognit. Artif. Intell. 3 (2) (1989)
John S. Anderson, Arthur M. Farley
Plan Abstraction Based on Operator Generalization. AAAI (1988)
William S. Bergar, Arthur M. Farley, Garland Bayley
Knowledge sources for an intelligent algebra tutor. Comput. Intell. 2 (1986)
Arthur M. Farley
A probabilistic model for uncertain problem solving. IEEE Trans. Syst. Man Cybern. 13 (4) (1983)
Arthur M. Farley, Andrzej Proskurowski
Directed Maximal-Cut Problems. Inf. Process. Lett. 15 (5) (1982)
Arthur M. Farley, Andrzej Proskurowski
Networks immune to isolated line failures. Networks 12 (4) (1982)
William Bregar, Arthur M. Farley
An intelligent tutor for high school algebra problems: Oregon State University. SIGART Newsl. 79 (1982)
Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski
Partitioning trees: Matching, domination, and maximum diameter. Int. J. Parallel Program. 10 (1) (1981)
Arthur M. Farley
Networks immune to isolated failures. Networks 11 (3) (1981)
Arthur M. Farley
Levelling Terrain Trees: A Transshipment Problem. Inf. Process. Lett. 10 (4/5) (1980)
Arthur M. Farley
Issues in Knowledge-Based Problem Solving. IEEE Trans. Syst. Man Cybern. 10 (8) (1980)
Arthur M. Farley, Andrzej Proskurowski
Computation of the center and diameter of outerplanar graphs. Discret. Appl. Math. 2 (3) (1980)
Arthur M. Farley
On Waiting. AAAI (1980)
Arthur M. Farley
Minimum-time line broadcast networks. Networks 10 (1) (1980)
Arthur M. Farley, Stephen T. Hedetniemi, Sandra L. Mitchell
Rectilinear Steiner Trees in Rectangle Trees. SIAM J. Algebraic Discret. Methods 1 (1) (1980)
Arthur M. Farley, Stephen T. Hedetniemi, Sandra Mitchell Mitchell, Andrzej Proskurowski
Minimum broadcast graphs. Discret. Math. 25 (2) (1979)
Arthur M. Farley
The Coordination of Multiple Goal Satisfaction. IJCAI (1977)
Arthur M. Farley
Constructive Visual Imagery And Perception. IJCAI (1975)