Kenneth A. Berman

	2009
30		Kenneth A. Berman, Chad Yoshikawa: Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well. COCOON 2009: 368-377
	2007
29		Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa: Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. ALENEX 2007
28		Kenneth A. Berman: Locating Servers for Reliability and Affine Embeddings. SIAM J. Discrete Math. 21(3): 637-646 (2007)
	2006
27		Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan: Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. PerCom Workshops 2006: 91-95
26		Jerome L. Paul, Michal Kouril, Kenneth A. Berman: A template library to facilitate teaching message passing parallel computing. SIGCSE 2006: 464-468
25		Svetlana Strunjas-Yoshikawa, Fred S. Annexstein, Kenneth A. Berman: Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet. SOFSEM 2006: 511-520
24		Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic: Broadcasting in unstructured peer-to-peer overlay networks. Theor. Comput. Sci. 355(1): 25-36 (2006)
	2004
23		Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman: The lonely NATed node. ACM SIGOPS European Workshop 2004: 36
22		Fred S. Annexstein, Kenneth A. Berman: A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. P2PKM 2004
	2002
21		Kenneth A. Berman, Jerome L. Paul: Verifiable broadcasting and gossiping in communication networks. Discrete Applied Mathematics 118(3): 293-298 (2002)
	2001
20		Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic: Latency effects on reachability in large-scale peer-to-peer networks. SPAA 2001: 84-92
	2000
19		Fred S. Annexstein, Kenneth A. Berman: Distributed Models and Algorithms for Survivability in Network Routing. IPDPS 2000: 359-364
18		Noga Alon, Kenneth A. Berman, Daniel J. Kleitman: On a Problem in Shuffling. J. Comb. Theory, Ser. A 91(1-2): 5-14 (2000)
17		Fred S. Annexstein, Kenneth A. Berman: Directional Routing via Generalized st-Numberings. SIAM J. Discrete Math. 13(2): 268-279 (2000)
16		Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan: A multi-tree routing scheme using acyclic orientations. Theor. Comput. Sci. 240(2): 487-494 (2000)
	1998
15		Kenneth A. Berman, Xin Liu: Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem. J. Comb. Theory, Ser. B 74(1): 20-27 (1998)
	1997
14		Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan: A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. COCOON 1997: 18-22
13		Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan: On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. SIROCCO 1997: 12-23
12		Kenneth A. Berman, Yanpei Liu: Generalized Bicycles. Discrete Applied Mathematics 78(1-3): 27-40 (1997)
	1996
11		Kenneth A. Berman: Vulnerability of scheduled networks and a generalization of Menger's Theorem. Networks 28(3): 125-134 (1996)
	1995
10		Kenneth A. Berman, John S. Schlipf, John V. Franco: Computing Well-founded Semantics Faster. LPNMR 1995: 113-126
9		Kenneth A. Berman, John V. Franco, John S. Schlipf: Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. Discrete Applied Mathematics 60(1-3): 77-91 (1995)
	1992
8		Kenneth A. Berman, Jerome L. Paul: The bounded chromatic number for graphs of genus g. J. Comb. Theory, Ser. B 56(2): 183-196 (1992)
	1990
7		Kenneth A. Berman, Mokhtar H. Konsowa: Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains. SIAM J. Discrete Math. 3(3): 311-319 (1990)
	1987
6		Kenneth A. Berman: Balanced vertex weightings and arborescences. J. Comb. Theory, Ser. B 42(3): 274-301 (1987)
	1986
5		Kenneth A. Berman: Parity results on connected f-factors. Discrete Mathematics 59(1-2): 1-8 (1986)
4		Noga Alon, Kenneth A. Berman: Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory. J. Comb. Theory, Ser. A 43(1): 91-97 (1986)
	1983
3		Kenneth A. Berman: Proof of a conjecture of Häggkvist on cycles and independent edges. Discrete Mathematics 46(1): 9-13 (1983)
	1981
2		Kenneth A. Berman: Three-colourings of planar 4-valent maps. J. Comb. Theory, Ser. B 30(1): 82-88 (1981)
1		Kenneth A. Berman: Matchings and spanning trees in Boolean weighted graphs. J. Comb. Theory, Ser. B 30(3): 343-350 (1981)

Coauthor Index

1	Noga Alon	[4] [18]
2	Fred S. Annexstein	[13] [14] [16] [17] [19] [20] [22] [23] [24] [25] [27] [29]
3	Brent N. Chun	[23]
4	John V. Franco	[9] [10]
5	Tsan-sheng Hsu	[16]
6	Mihajlo A. Jovanovic	[20] [24]
7	Daniel J. Kleitman	[18]
8	Mokhtar H. Konsowa	[7]
9	Michal Kouril	[26]
10	Xin Liu	[15]
11	Yanpei Liu	[12]
12	Jerome L. Paul	[8] [21] [26]
13	Aravind Ranganathan	[27]
14	John S. Schlipf	[9] [10]
15	Svetlana Strunjas (Svetlana Strunjas-Yoshikawa)	[25] [29]
16	Ramjee P. Swaminathan	[13] [14] [16]
17	Amin Vahdat	[23]
18	Chad Yoshikawa	[23] [29] [30]

Colors in the list of coauthors