Kenneth A Berman

Ph.D:

Networks and applied graph theory, algorithms, Internet technologies, parallel and distributed computing, knowledge management.

Grant: #CCR-9877139-NCE Investigators:Berman, Kenneth 07-01-1999 -06-30-2003 National Science Foundation Algorithms and Routing Schemes for Scalable Networks Role:PI $283,799.00 Closed Level:Federal

Grant: #ECA - Master for 11 Students Investigators:Agrawal, Dharma; Bakshi, Arjun; Berman, Kenneth; Bhatnagar, Raj; Bhattacharya, Prabir; Borowczak, Mike; Chaganti, Shikha; Davis, Karen; Guo, Minzhe; Helmicki, Arthur; Kohram, Mojtaba; Li, Hailong; Mukherjee, Tuhin; Ralescu, Anca; Ren, Zhaowei; Tan, Lirong; Vemuri, Ranganadha; Wu, Chao; Zhu, Cheng 09-01-2012 -08-31-2013 Cincinnati Children's Hospital Medical Center Education Collaboration Agreement with CCHMC - 11 Students Role:Collaborator $246,693.00 Active Level:Private Non-Profit

Peer Reviewed Publications

Langwell, K M; Rossiter, L F; Hadley, J P; Nelson, S L; Nelson, L M; Berman, K A HMOs in the Medicare market. Part 2--Operational issues. Medical group management, , 34 (1 ) ,37-44

Langwell, K M; Rossiter, L F; Hadley, J P; Nelson, S L; Nelson, L M; Berman, K A HMOs in the Medicare market. Part 1. Medical group management, , 33 (6 ) ,32-7, 44-5

Hawrylycz M.;Miller J.A.;Menon V.;Feng D.;Dolbeare T.;Guillozet-Bongaarts A.L.;Jegga A.G.;Aronow B.J.;Lee C.K.;Bernard A.;Glasser M.F.;Dierker D.L.;Menche J.;Szafer A.;Collman F.;Grange P.;Berman K.A.;Mihalas S.;Yao Z.;Stewart L.;Barabási A.L.;Schulkin J.;Phillips J.;Ng L.;Dang C.;R Haynor D.;Jones A.;Van Essen D.C.;Koch C.;Lein E. (11-25-2015. ) Canonical genetic signatures of the adult human brain.Nature Neuroscience, , 18 (12 ) ,1832-1844 More Information

Zhu C.;Kushwaha A.;Berman K.;Jegga A.G. (12-17-2012. ) A vertex similarity-based framework to discover and rank orphan disease-related genes.BMC Systems Biology, , 6 (SUPPL3 ) , More Information

Annexstein F.S.;Berman K.A. (01-01-2012. ) Synthesis ranking with critic resonance.Proceedings of the 4th Annual ACM Web Science Conference, WebSci'12, , volume ,15-23 More Information

Berman K.;Yoshikawa C. (10-01-2011. ) Why locally-fair maximal flows in client-server networks perform well.Journal of Combinatorial Optimization, , 22 (3 ) ,426-437 More Information

Ranganathan A.;Berman K. (07-16-2010. ) Dynamic state-based routing for load balancing and efficient data gathering in wireless sensor netwo.2010 International Symposium on Collaborative Technologies and Systems, CTS 2010, , 103-112 More Information

Berman K.;Yoshikawa C. (12-01-2009. ) Why locally-fair maximal flows in client-server networks perform well.Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), , 5609 LNCS ,368-377 More Information

Swami S.;Ghosh C.;Dhekne R.;Agrawal D.;Berman K. (12-01-2008. ) Graph theoretic approach to QoS-guaranteed spectrum allocation in cognitive radio networks.Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference, , 354-359 More Information

Berman K. (12-01-2007. ) Locating servers for reliability and affine embeddings.SIAM Journal on Discrete Mathematics, , 21 (3 ) ,637-646 More Information

Paul J.;Kouril M.;Berman K. (12-01-2007. ) A template library to facilitate teaching message passing parallel computing.Proceedings of the Thirty-Seventh SIGCSE Technical Symposium on Computer Science Education, , 464-468 More Information

Annexstein F.;Berman K.A.;Strunjaš S.;Yoshikawa C. (08-22-2007. ) Maximizing throughput in minimum rounds in an application-level relay service .Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics, , 109-119

Ranganathan P.;Ranganathan A.;Berman K.;Minai A. (12-01-2006. ) Discovering adaptive heuristics for ad-hoc sensor networks by mining evolved optimal configurations .2006 IEEE Congress on Evolutionary Computation, CEC 2006, , 3064-3070

Ranganathan P.;Ranganathan A.;Minai A.;Berman K. (12-01-2006. ) A self-organizing heuristic for building optimal heterogeneous ad-hoc sensor networks .Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06, , 774-779

Berman K.;Annexstein F.;Ranganathan A. (10-31-2006. ) Dominating connectivity and reliability of heterogeneous sensor networks.Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006, , 2006 ,91-95 More Information

Strunjaš-Yoshikawa S.;Annexstein F.S.;Berman K.A. (07-05-2006. ) Compact encodings for all local path information in web taxonomies with application to WordNet .Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), , 3831 LNCS ,511-520

Annexstein F.;Berman K.;Jovanovi? M. (04-06-2006. ) Broadcasting in unstructured peer-to-peer overlay networks.Theoretical Computer Science, , 355 (1 ) ,25-36 More Information

Yoshikawa C.;Chun B.;Vahdat A.;Annexstein F.;Berman K. (12-01-2004. ) The lonely NATed node.Proceedings of the 11th Workshop on ACM SIGOPS European Workshop, EW 11, , More Information

Annexstein F.;Berman K.;Henkener K.;Strunjaš S. (01-01-2004. ) A space-efficient model for sharing personal knowledge objects in peer communities .CEUR Workshop Proceedings, , 108 ,

Berman K.;Paul J. (05-15-2002. ) Verifiable broadcasting and gossiping in communication networks.Discrete Applied Mathematics, , 118 (3 ) ,293-298 More Information

Annexstein F.;Berman K.;Jovanovic M.;Ponnavaikko K. (01-01-2002. ) Indexing techniques for file sharing in scalable peer-to-peer networks.Proceedings - International Conference on Computer Communications and Networks, ICCCN, , 2002-January ,10-15 More Information

Annexstein F.S.;Berman K.A.;Jovanovi? M.A. (01-01-2001. ) Latency effects on reachability in large-scale peer-to-peer networks .Annual ACM Symposium on Parallel Algorithms and Architectures, , 84-91

Annexstein F.;Berman K.;Hsu T.;Swaminathan R. (06-17-2000. ) A multi-tree routing scheme using acyclic orientations.Theoretical Computer Science, , 240 (2 ) ,487-494 More Information

Annexstein F.;Berman K. (01-01-2000. ) Directional routing via generalized st-numberings.SIAM Journal on Discrete Mathematics, , 13 (2 ) ,268-279 More Information

Annexstein F.;Berman K. (01-01-2000. ) Distributed models and algorithms for survivability in network routing .Proceedings of the International Parallel Processing Symposium, IPPS, , 359-364

Alon N.;Berman K.;Kleitman D. (01-01-2000. ) On a problem in shuffling.Journal of Combinatorial Theory. Series A, , 91 (1-2 ) ,5-14 More Information

Berman K.;Liu X. (09-01-1998. ) Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem.Journal of Combinatorial Theory. Series B, , 74 (1 ) ,20-27 More Information

Berman K.;Liu Y. (10-21-1997. ) Generalized bicycles.Discrete Applied Mathematics, , 78 (1-3 ) ,27-40 More Information

Annexstein F.S.;Berman K.A.;Swaminathan R. (01-01-1997. ) A multi-tree generating routing scheme using acyclic orientations .Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), , 1276 ,18-22

Berman K. (01-01-1996. ) Vulnerability of scheduled networks and a generalization of Menger's Theorem.Networks, , 28 (3 ) ,125-134 More Information

Berman K.;Franco J.;Schlipf J. (06-23-1995. ) Unique satisfiability of Horn sets can be solved in nearly linear time.Discrete Applied Mathematics, , 60 (1-3 ) ,77-91 More Information

Berman K.A.;Schlipf J.S.;Franco J.V. (01-01-1995. ) Computing the well-founded semantics faster .Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), , 928 ,113-126

Berman K.;Paul J. (01-01-1992. ) The bounded chromatic number for graphs of genus g.Journal of Combinatorial Theory, Series B, , 56 (2 ) ,183-196 More Information

Berman K.;Paul J. (01-01-1989. ) A 4-color theorem for surfaces of genus g.Proceedings of the American Mathematical Society, , 105 (2 ) ,513-522 More Information

Berman K.;Konsowa M. (01-01-1989. ) A Counterexample to the conjecture of woess on simple random walks on trees.Proceedings of the American Mathematical Society, , 105 (2 ) ,443-449 More Information

Berman K.;Halpern H.;Kaftal V.;Weiss G. (01-01-1988. ) Matrix norm inequalities and the relative Dixmier property.Integral Equations and Operator Theory, , 11 (1 ) ,28-48 More Information

Berman K. (01-01-1987. ) Balanced vertex weightings and arborescences.Journal of Combinatorial Theory, Series B, , 42 (3 ) ,274-301 More Information

Berman K.A. (01-01-1986. ) Parity results on connected f{hook}-factors.Discrete Mathematics, , 59 (1-2 ) ,1-8 More Information

Alon N.;Berman K. (01-01-1986. ) Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory.Journal of Combinatorial Theory, Series A, , 43 (1 ) ,91-97 More Information

Berman K. (01-01-1984. ) A Generalization to Bases Common to r Binary Matroids A the Weighted Matrix-Tree Theorem in the Case.European Journal of Combinatorics, , 5 (3 ) ,197-205 More Information

Berman K. (01-01-1983. ) Proof of a conjecture of Häggkvist on cycles and independent edges.Discrete Mathematics, , 46 (1 ) ,9-13 More Information

Berman K. (01-01-1981. ) Three-colourings of planar 4-valent maps.Journal of Combinatorial Theory, Series B, , 30 (1 ) ,82-88 More Information

Berman K. (01-01-1981. ) Matchings and spanning trees in Boolean weighted graphs.Journal of Combinatorial Theory, Series B, , 30 (3 ) ,343-350 More Information

Berman K. (01-01-1980. ) A note on coloured quadrangulations.Discrete Mathematics, , 29 (2 ) ,215-217 More Information

Berman K. (01-01-1979. ) Spanning arborescences, ingraphs, and outgraphs.Journal of Graph Theory, , 3 (2 ) ,141-150 More Information

Berman K.;Shank H. (01-01-1979. ) Full 4?colorings of 4?regular maps.Journal of Graph Theory, , 3 (3 ) ,291-294 More Information

Berman K. (01-01-1978. ) Directed faces in planar digraphs and unicoloured faces in edge 2-coloured planar Eulerian maps.Discrete Mathematics, , 21 (1 ) ,83-85 More Information

Berman K. (01-01-1978. ) Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directe.Discrete Mathematics, , 22 (1 ) ,75-80 More Information