default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArthur M. Farley
Person information
- affiliation: University of Oregon, Eugene, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j35]Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
:
Defensive domination in proper interval graphs. Discret. Appl. Math. 331: 59-69 (2023)- 2020
- [j34]Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski:
The complexity of the defensive domination problem in special graph classes. Discret. Math. 343(2): 111665 (2020) - [i2]Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom:
Defensive Domination in Proper Interval Graphs. CoRR abs/2010.03865 (2020)
2010 – 2019
- 2014
- [j33]Isolde Adler, Arthur M. Farley, Andrzej Proskurowski:
Obstructions for linear rank-width at most 1. Discret. Appl. Math. 168: 3-13 (2014) - [j32]Héctor Rodríguez, Arthur M. Farley, Juan J. Flores, Andrzej Proskurowski:
Qualitative bifurcation diagrams. Expert Syst. J. Knowl. Eng. 31(4): 319-334 (2014) - 2012
- [j31]Paul S. Bonsma, Arthur M. Farley, Andrzej Proskurowski:
Extremal graphs having no matching cuts. J. Graph Theory 69(2): 206-222 (2012) - [c13]Arthur M. Farley, Stuart R. Faulk, Virginia Lo, Andrzej Proskurowski, Michal Young:
Intensive international Summer Schools in Global Distributed Software Development. FIE 2012: 1-6 - 2011
- [i1]Isolde Adler, Arthur M. Farley, Andrzej Proskurowski:
Obstructions for linear rankwidth at most 1. CoRR abs/1106.2533 (2011) - 2010
- [c12]Sarah A. Douglas, Arthur M. Farley, Ginnie Lo, Andrzej Proskurowski, Michal Young:
Internationalization of computer science education. SIGCSE 2010: 411-415
2000 – 2009
- 2007
- [c11]Arthur M. Farley:
Choice and development. GECCO (Companion) 2007: 2468-2474 - 2005
- [j30]Arthur M. Farley, Andrzej Proskurowski:
Priority-Consistent Graphs. Electron. Notes Discret. Math. 22: 521-526 (2005) - [c10]Arthur M. Farley:
Population Structure and Artificial Evolution. Artificial Evolution 2005: 213-225 - 2004
- [j29]Arthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch:
Spanners and message distribution in networks. Discret. Appl. Math. 137(2): 159-171 (2004) - [j28]Arthur M. Farley:
Minimal path broadcast networks. Networks 43(2): 61-70 (2004) - 2003
- [j27]Satoshi Fujita, Arthur M. Farley:
Sparse Hypercube - Minimal k-line Broadcast Graph. Discret. Appl. Math. 127(3): 431-446 (2003) - 2000
- [j26]Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards:
Multi-Source Spanning Tree Problems. J. Interconnect. Networks 1(1): 61-71 (2000)
1990 – 1999
- 1999
- [j25]Juan J. Flores, Arthur M. Farley:
Reasoning about Linear Circuits: A Model-Based Approach. AI Commun. 12(1-2): 61-77 (1999) - [j24]Arthur M. Farley, Andrzej Proskurowski, Miroslawa Skowronska, Maciej M. Syslo:
Hamiltonicity of Amalgams. Graphs Comb. 15(4): 393-404 (1999) - [c9]Satoshi Fujita, Arthur M. Farley:
Sparse Hypercube: A Minimal k-Line Broadcast Graph. IPPS/SPDP 1999: 320-324 - [c8]Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards:
Multi-Source Spanning Tree Problems. SIROCCO 1999: 126-136 - 1998
- [j23]Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski:
Minimum-time multidrop broadcast. Discret. Appl. Math. 83(1-3): 61-77 (1998) - [j22]Arthur M. Farley:
Optimally Routable Networks. Parallel Process. Lett. 8(4): 567-575 (1998) - 1997
- [j21]Satoshi Fujita, Arthur M. Farley:
Minimum-cost Line Broadcast in Paths. Discret. Appl. Math. 75(3): 255-268 (1997) - [j20]Arthur M. Farley, Andrzej Proskurowski:
Minimum Self-Repairing Graphs. Graphs Comb. 13(4): 345-351 (1997) - 1996
- [j19]Kathleen Freeman, Arthur M. Farley:
A Model of Argumentation and Its Application to Legal Reasoning. Artif. Intell. Law 4(3-4): 163-197 (1996) - 1995
- [j18]Kuan-Pin Lin, Arthur M. Farley:
Causal reasoning in econometric models. Decis. Support Syst. 15(2): 167-177 (1995) - [c7]Arthur M. Farley, Kathleen Freeman:
Burden of Proof in Legal Argumentation. ICAIL 1995: 156-164 - 1994
- [j17]Arthur M. Farley, Andrzej Proskurowski:
Bounded-call broadcasting. Discret. Appl. Math. 53(1-3): 37-53 (1994) - 1993
- [j16]Arthur M. Farley, Andrzej Proskurowski:
Self-Repairing Networks. Parallel Process. Lett. 3: 381-391 (1993) - 1991
- [c6]Zheng-Yang Liu, Arthur M. Farley:
Structural Aggregation in Common-Sense Reasoning. AAAI 1991: 868-873 - 1990
- [c5]Zheng-Yang Liu, Arthur M. Farley:
Shifting Ontological Perspectives in Reasoning About Physical Systems. AAAI 1990: 395-400
1980 – 1989
- 1989
- [j15]Arthur M. Farley:
Diagnostic Mechanism Modeling. Int. J. Pattern Recognit. Artif. Intell. 3(2): 237-260 (1989) - [j14]Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski:
Centering a Spanning Tree of a Biconnected Graph. Inf. Process. Lett. 32(5): 247-250 (1989) - 1988
- [c4]John S. Anderson, Arthur M. Farley:
Plan Abstraction Based on Operator Generalization. AAAI 1988: 100-104 - 1986
- [j13]William S. Bergar, Arthur M. Farley, Garland Bayley:
Knowledge sources for an intelligent algebra tutor. Comput. Intell. 2: 117-129 (1986) - 1983
- [j12]Arthur M. Farley:
A probabilistic model for uncertain problem solving. IEEE Trans. Syst. Man Cybern. 13(4): 568-579 (1983) - 1982
- [j11]Arthur M. Farley, Andrzej Proskurowski:
Directed Maximal-Cut Problems. Inf. Process. Lett. 15(5): 238-241 (1982) - [j10]Arthur M. Farley, Andrzej Proskurowski:
Networks immune to isolated line failures. Networks 12(4): 393-403 (1982) - [j9]William Bregar, Arthur M. Farley:
An intelligent tutor for high school algebra problems: Oregon State University. SIGART Newsl. 79: 78 (1982) - 1981
- [j8]Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski:
Partitioning trees: Matching, domination, and maximum diameter. Int. J. Parallel Program. 10(1): 55-61 (1981) - [j7]Arthur M. Farley:
Networks immune to isolated failures. Networks 11(3): 255-268 (1981) - 1980
- [j6]Arthur M. Farley, Andrzej Proskurowski:
Computation of the center and diameter of outerplanar graphs. Discret. Appl. Math. 2(3): 185-191 (1980) - [j5]Arthur M. Farley:
Levelling Terrain Trees: A Transshipment Problem. Inf. Process. Lett. 10(4/5): 189-192 (1980) - [j4]Arthur M. Farley:
Minimum-time line broadcast networks. Networks 10(1): 59-70 (1980) - [j3]Arthur M. Farley, Stephen T. Hedetniemi, Sandra L. Mitchell:
Rectilinear Steiner Trees in Rectangle Trees. SIAM J. Algebraic Discret. Methods 1(1): 70-81 (1980) - [j2]Arthur M. Farley:
Issues in Knowledge-Based Problem Solving. IEEE Trans. Syst. Man Cybern. 10(8): 446-459 (1980) - [c3]Arthur M. Farley:
On Waiting. AAAI 1980: 128-130
1970 – 1979
- 1979
- [j1]Arthur M. Farley, Stephen T. Hedetniemi, Sandra Mitchell Mitchell, Andrzej Proskurowski:
Minimum broadcast graphs. Discret. Math. 25(2): 189-193 (1979) - 1977
- [c2]Arthur M. Farley:
The Coordination of Multiple Goal Satisfaction. IJCAI 1977: 495 - 1975
- [c1]Arthur M. Farley:
Constructive Visual Imagery And Perception. IJCAI 1975: 885-892
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
