Arthur M. Farley

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2012
j21		Paul Bonsma, Arthur M. Farley, Andrzej Proskurowski: Extremal graphs having no matching cuts. Journal of Graph Theory 69(2): 206-222 (2012)
	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
	2007
c11		Arthur M. Farley: Choice and development. GECCO (Companion) 2007: 2468-2474
	2005
j20		Arthur M. Farley, Andrzej Proskurowski: Priority-Consistent Graphs. Electronic Notes in Discrete Mathematics 22: 521-526 (2005)
c10		Arthur M. Farley: Population Structure and Artificial Evolution. Artificial Evolution 2005: 213-225
	2004
j19		Arthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch: Spanners and message distribution in networks. Discrete Applied Mathematics 137(2): 159-171 (2004)
j18		Arthur M. Farley: Minimal path broadcast networks. Networks 43(2): 61-70 (2004)
	2003
j17		Satoshi Fujita, Arthur M. Farley: Sparse Hypercube - Minimal k-line Broadcast Graph. Discrete Applied Mathematics 127(3): 431-446 (2003)
	2000
j16		Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards: Multi-Source Spanning Tree Problems. Journal of Interconnection Networks 1(1): 61-71 (2000)
	1999
j15		Juan J. Flores, Arthur M. Farley: Reasoning about Linear Circuits: A Model-Based Approach. AI Commun. 12(1-2): 61-77 (1999)
j14		Arthur M. Farley, Andrzej Proskurowski, Miroslawa Skowronska, Maciej M. Syslo: Hamiltonicity of Amalgams. Graphs and Combinatorics 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
j13		Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski: Minimum-time multidrop broadcast. Discrete Applied Mathematics 83(1-3): 61-77 (1998)
j12		Arthur M. Farley: Optimally Routable Networks. Parallel Processing Letters 8(4): 567-575 (1998)
	1997
j11		Satoshi Fujita, Arthur M. Farley: Minimum-cost Line Broadcast in Paths. Discrete Applied Mathematics 75(3): 255-268 (1997)
	1996
j10		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
c7		Arthur M. Farley, Kathleen Freeman: Burden of Proof in Legal Argumentation. ICAIL 1995: 156-164
	1994
j9		Arthur M. Farley, Andrzej Proskurowski: Bounded-call broadcasting. Discrete Applied Mathematics 53(1-3): 37-53 (1994)
	1993
j8		Arthur M. Farley, Andrzej Proskurowski: Self-Repairing Networks. Parallel Processing Letters 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
	1989
j7		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
j6		William S. Bergar, Arthur M. Farley, Garland Bayley: Knowledge sources for an intelligent algebra tutor. Computational Intelligence 2: 117-129 (1986)
	1982
j5		Arthur M. Farley, Andrzej Proskurowski: Directed Maximal-Cut Problems. Inf. Process. Lett. 15(5): 238-241 (1982)
j4		Arthur M. Farley, Andrzej Proskurowski: Networks immune to isolated line failures. Networks 12(4): 393-403 (1982)
	1981
j3		Arthur M. Farley: Networks immune to isolated failures. Networks 11(3): 255-268 (1981)
	1980
j2		Arthur M. Farley: Levelling Terrain Trees: A Transshipment Problem. Inf. Process. Lett. 10(4/5): 189-192 (1980)
j1		Arthur M. Farley: Minimum-time line broadcast networks. Networks 10(1): 59-70 (1980)
c3		Arthur M. Farley: On Waiting. AAAI 1980: 128-130
	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

1	Isolde Adler	[i1]
2	John S. Anderson	[c4]
3	Garland Bayley	[j6]
4	William S. Bergar	[j6]
5	Paul Bonsma (Paul S. Bonsma)	[j21]
6	Grant A. Cheston	[j7]
7	Sarah A. Douglas	[c12]
8	Juan J. Flores	[j15]
9	Paraskevi Fragopoulou	[j16] [c8]
10	Kathleen Freeman	[j10] [c7]
11	Satoshi Fujita	[j17] [c9] [j11]
12	Stephen T. Hedetniemi	[j7]
13	David W. Krumme	[j16] [c8]
14	Zheng-Yang Liu	[c6] [c5]
15	Ginnie Lo	[c12]
16	Andrzej Pelc	[j13]
17	Andrzej Proskurowski	[j21] [i1] [c12] [j20] [j19] [j16] [j14] [c8] [j13] [j9] [j8] [j7] [j5] [j4]
18	Dana S. Richards (Dana Richards)	[j16] [c8]
19	Miroslawa Skowronska	[j14]
20	Maciej M. Syslo	[j14]
21	Kurt J. Windisch	[j19]
22	Michal Young	[c12]
23	Daniel Zappala	[j19]

Colors in the list of coauthors

Last update Thu May 23 22:29:49 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page