Arthur M. Farley - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 47 from 47

2023

Defensive domination in proper interval graphsTínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom. DAM, 331:59-69, May 2023. [doi]

2020

The complexity of the defensive domination problem in special graph classesTínaz Ekim, Arthur M. Farley, Andrzej Proskurowski. DM, 343(2):111665, 2020. [doi]

2014

Obstructions for linear rank-width at most 1Isolde Adler, Arthur M. Farley, Andrzej Proskurowski. DAM, 168:3-13, 2014. [doi]

Qualitative bifurcation diagramsHéctor Rodríguez, Arthur M. Farley, Juan J. Flores, Andrzej Proskurowski. es, 31(4):319-334, 2014. [doi]

2012

Extremal graphs having no matching cutsPaul Bonsma, Arthur M. Farley, Andrzej Proskurowski. jgt, 69(2):206-222, 2012. [doi]

Intensive international Summer Schools in Global Distributed Software DevelopmentArthur M. Farley, Stuart R. Faulk, Virginia Lo, Andrzej Proskurowski, Michal Young. mcs 2012: 1-6 [doi]

2010

Internationalization of computer science educationSarah A. Douglas, Arthur M. Farley, Ginnie Lo, Andrzej Proskurowski, Michal Young. sigcse 2009: 411-415 [doi]

2007

Choice and developmentArthur M. Farley. gecco 2007: 2468-2474 [doi]

2005

Population Structure and Artificial EvolutionArthur M. Farley. ae 2006: 213-225 [doi]

Priority-Consistent GraphsArthur M. Farley, Andrzej Proskurowski. endm, 22:521-526, 2005. [doi]

2004

Spanners and message distribution in networksArthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch. DAM, 137(2):159-171, 2004. [doi]

Minimal path broadcast networksArthur M. Farley. networks, 43(2):61-70, 2004. [doi]

2003

Sparse Hypercube - Minimal k-line Broadcast GraphSatoshi Fujita, Arthur M. Farley. DAM, 127(3):431-446, 2003. [doi]

2000

Multi-Source Spanning Tree ProblemsArthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards. join, 1(1):61-71, 2000.

1999

1998

Optimally Routable NetworksArthur M. Farley. ppl, 8(4):567-575, 1998.

Minimum-time multidrop broadcastArthur M. Farley, Andrzej Pelc, Andrzej Proskurowski. DAM, 83(1-3):61-77, 1998. [doi]

1997

Minimum Self-Repairing GraphsArthur M. Farley, Andrzej Proskurowski. gc, 13(4):345-351, 1997. [doi]

Minimum-cost Line Broadcast in PathsSatoshi Fujita, Arthur M. Farley. DAM, 75(3):255-268, 1997. [doi]

1996

A Model of Argumentation and Its Application to Legal ReasoningKathleen Freeman, Arthur M. Farley. ail, 4(3-4):163-197, 1996.

1995

Burden of Proof in Legal ArgumentationArthur M. Farley, Kathleen Freeman. icail 1995: 156-164 [doi]

Causal reasoning in econometric modelsKuan-Pin Lin, Arthur M. Farley. dss, 15(2):167-177, 1995. [doi]

1994

Bounded-call broadcastingArthur M. Farley, Andrzej Proskurowski. DAM, 53(1-3):37-53, 1994.

1993

Self-Repairing NetworksArthur M. Farley, Andrzej Proskurowski. ppl, 3:381-391, 1993.

1991

Structural Aggregation in Common-Sense ReasoningZheng-Yang Liu, Arthur M. Farley. AAAI 1991: 868-873

1990

Shifting Ontological Perspectives in Reasoning About Physical SystemsZheng-Yang Liu, Arthur M. Farley. AAAI 1990: 395-400

1989

Centering a Spanning Tree of a Biconnected GraphGrant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski. ipl, 32(5):247-250, 1989.

Diagnostic Mechanism ModelingArthur M. Farley. ijprai, 3(2):237-260, 1989. [doi]

1988

Plan Abstraction Based on Operator GeneralizationJohn S. Anderson, Arthur M. Farley. AAAI 1988: 100-104

1986

Knowledge sources for an intelligent algebra tutorWilliam S. Bergar, Arthur M. Farley, Garland Bayley. ci, 2:117-129, 1986.

1983

A probabilistic model for uncertain problem solvingArthur M. Farley. tsmc, 13(4):568-579, 1983. [doi]

1982

An intelligent tutor for high school algebra problems: Oregon State UniversityWilliam Bregar, Arthur M. Farley. sigart, 79:78, 1982. [doi]

Directed Maximal-Cut ProblemsArthur M. Farley, Andrzej Proskurowski. ipl, 15(5):238-241, 1982.

Networks immune to isolated line failuresArthur M. Farley, Andrzej Proskurowski. networks, 12(4):393-403, 1982. [doi]

1981

Networks immune to isolated failuresArthur M. Farley. networks, 11(3):255-268, 1981. [doi]

1980

Levelling Terrain Trees: A Transshipment ProblemArthur M. Farley. ipl, 10(4/5):189-192, 1980.

On WaitingArthur M. Farley. AAAI 1980: 128-130

Minimum-time line broadcast networksArthur M. Farley. networks, 10(1):59-70, 1980. [doi]

Issues in Knowledge-Based Problem SolvingArthur M. Farley. tsmc, 10(8):446-459, 1980. [doi]

Computation of the center and diameter of outerplanar graphsArthur M. Farley, Andrzej Proskurowski. DAM, 2(3):185-191, 1980. [doi]

Rectilinear Steiner Trees in Rectangle TreesArthur M. Farley, Stephen T. Hedetniemi, Sandra L. Mitchell. siammax, 1(1):70-81, 1980. [doi]

1979

Minimum broadcast graphsArthur M. Farley, Stephen T. Hedetniemi, Sandra Mitchell Mitchell, Andrzej Proskurowski. DM, 25(2):189-193, 1979. [doi]

1977

The Coordination of Multiple Goal SatisfactionArthur M. Farley. IJCAI 1977: 495

1975

Constructive Visual Imagery And PerceptionArthur M. Farley. IJCAI 1975: 885-892

Sign in or sign up to see more results.

runs on WebDSL