Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths. - Kenneth A. Berman (Discret. Math., 1978)

Directed faces in planar digraphs and unicoloured faces in edge 2-coloured planar Eulerian maps. - Kenneth A. Berman (Discret. Math., 1978)

Spanning arborescences, ingraphs, and outgraphs. - Kenneth A. Berman (J. Graph Theory, 1979)

Full 4-colorings of 4-regular maps. - Kenneth A. Berman; H. Shank (J. Graph Theory, 1979)

A note on coloured quadrangulations. - Kenneth A. Berman (Discret. Math., 1980)

A Proof of Tuite's Trinity Theorem and a New Determinant Formula. - Kenneth A. Berman (SIAM J. Algebraic Discret. Methods, 1980)

A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons. - Kenneth A. Berman (SIAM J. Algebraic Discret. Methods, 1980)

Three-colourings of planar 4-valent maps. - Kenneth A. Berman (J. Comb. Theory B, 1981)

Matchings and spanning trees in Boolean weighted graphs. - Kenneth A. Berman (J. Comb. Theory B, 1981)

Proof of a conjecture of Häggkvist on cycles and independent edges. - Kenneth A. Berman (Discret. Math., 1983)

A Generalization to Bases Common to r Binary Matroids A the Weighted Matrix-Tree Theorem in the Case when the Weights are Boolean. - Kenneth A. Berman (Eur. J. Comb., 1984)

Parity results on connected f-factors. - Kenneth A. Berman (Discret. Math., 1986)

Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory. - Noga Alon; Kenneth A. Berman (J. Comb. Theory A, 1986)

Balanced vertex weightings and arborescences. - Kenneth A. Berman (J. Comb. Theory B, 1987)

Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains. - Kenneth A. Berman; Mokhtar H. Konsowa (SIAM J. Discret. Math., 1990)

The bounded chromatic number for graphs of genus g. - Kenneth A. Berman; Jerome L. Paul (J. Comb. Theory B, 1992)

Computing Well-founded Semantics Faster. - Kenneth A. Berman; John S. Schlipf; John V. Franco (LPNMR, 1995)

Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. - Kenneth A. Berman; John V. Franco; John S. Schlipf (Discret. Appl. Math., 1995)

Vulnerability of scheduled networks and a generalization of Menger's Theorem. - Kenneth A. Berman (Networks, 1996)

A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. - Fred S. Annexstein; Kenneth A. Berman; Ramjee P. Swaminathan (COCOON, 1997)

On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. - Fred S. Annexstein; Kenneth A. Berman; Ramjee P. Swaminathan (SIROCCO, 1997)

Generalized Bicycles. - Kenneth A. Berman; Yanpei Liu (Discret. Appl. Math., 1997)

Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem. - Kenneth A. Berman; Xin Liu (J. Comb. Theory B, 1998)

Distributed Models and Algorithms for Survivability in Network Routing. - Fred S. Annexstein; Kenneth A. Berman (IPDPS, 2000)

On a Problem in Shuffling. - Noga Alon; Kenneth A. Berman; Daniel J. Kleitman (J. Comb. Theory A, 2000)

Directional Routing via Generalized st-Numberings. - Fred S. Annexstein; Kenneth A. Berman (SIAM J. Discret. Math., 2000)

A multi-tree routing scheme using acyclic orientations. - Fred S. Annexstein; Kenneth A. Berman; Tsan-sheng Hsu; Ramjee P. Swaminathan (Theor. Comput. Sci., 2000)

Latency effects on reachability in large-scale peer-to-peer networks. - Fred S. Annexstein; Kenneth A. Berman; Mihajlo A. Jovanovic (SPAA, 2001)

Indexing techniques for file sharing in scalable peer-to-peer networks. - Fred S. Annexstein; Kenneth A. Berman; Mihajlo A. Jovanovic; Kovendhan Ponnavaikko (ICCCN, 2002)

Verifiable broadcasting and gossiping in communication networks. - Kenneth A. Berman; Jerome L. Paul (Discret. Appl. Math., 2002)

A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. - Fred S. Annexstein; Kenneth A. Berman (P2PKM, 2004)

The lonely NATed node. - Chad Yoshikawa; Brent N. Chun; Amin Vahdat; Fred S. Annexstein; Kenneth A. Berman (ACM SIGOPS European Workshop, 2004)

Discovering Adaptive Heuristics for Ad-Hoc Sensor Networks by Mining Evolved Optimal Configurations. - Prasanna Ranganathan; Aravind Ranganathan; Kenneth A. Berman; Ali A. Minai (IEEE Congress on Evolutionary Computation, 2006)

Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. - Kenneth A. Berman; Fred S. Annexstein; Aravind Ranganathan (PerCom Workshops, 2006)

A template library to facilitate teaching message passing parallel computing. - Jerome L. Paul; Michal Kouril; Kenneth A. Berman (SIGCSE, 2006)

Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet. - Svetlana Strunjas-Yoshikawa; Fred S. Annexstein; Kenneth A. Berman (SOFSEM, 2006)

Broadcasting in unstructured peer-to-peer overlay networks. - Fred S. Annexstein; Kenneth A. Berman; Mihajlo A. Jovanovic (Theor. Comput. Sci., 2006)

Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. - Fred S. Annexstein; Kenneth A. Berman; Svetlana Strunjas-Yoshikawa; Chad Yoshikawa (ALENEX, 2007)

Locating Servers for Reliability and Affine Embeddings. - Kenneth A. Berman (SIAM J. Discret. Math., 2007)

Dynamic state-based routing for load balancing and efficient data gathering in wireless sensor networks. - Aravind Ranganathan; Kenneth A. Berman (CTS, 2010)

Why locally-fair maximal flows in client-server networks perform well. - Kenneth A. Berman; Chad Yoshikawa (J. Comb. Optim., 2011)

Synthesis ranking with critic resonance. - Fred S. Annexstein; Kenneth A. Berman (WebSci, 2012)