default search action
Kenneth A. Berman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [c16]Fred S. Annexstein, Kenneth A. Berman:
Synthesis ranking with critic resonance. WebSci 2012: 15-23 - 2011
- [j27]Kenneth A. Berman, Chad Yoshikawa:
Why locally-fair maximal flows in client-server networks perform well. J. Comb. Optim. 22(3): 426-437 (2011) - 2010
- [c15]Aravind Ranganathan, Kenneth A. Berman:
Dynamic state-based routing for load balancing and efficient data gathering in wireless sensor networks. CTS 2010: 103-112
2000 – 2009
- 2009
- [c14]Kenneth A. Berman, Chad Yoshikawa:
Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well. COCOON 2009: 368-377 - 2007
- [j26]Kenneth A. Berman:
Locating Servers for Reliability and Affine Embeddings. SIAM J. Discret. Math. 21(3): 637-646 (2007) - [c13]Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa:
Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. ALENEX 2007 - 2006
- [j25]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) - [c12]Prasanna Ranganathan, Aravind Ranganathan, Kenneth A. Berman, Ali A. Minai:
Discovering Adaptive Heuristics for Ad-Hoc Sensor Networks by Mining Evolved Optimal Configurations. IEEE Congress on Evolutionary Computation 2006: 3064-3070 - [c11]Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan:
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. PerCom Workshops 2006: 91-95 - [c10]Jerome L. Paul, Michal Kouril, Kenneth A. Berman:
A template library to facilitate teaching message passing parallel computing. SIGCSE 2006: 464-468 - [c9]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 - 2004
- [c8]Fred S. Annexstein, Kenneth A. Berman:
A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. P2PKM 2004 - [c7]Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman:
The lonely NATed node. ACM SIGOPS European Workshop 2004: 36 - 2002
- [j24]Kenneth A. Berman, Jerome L. Paul:
Verifiable broadcasting and gossiping in communication networks. Discret. Appl. Math. 118(3): 293-298 (2002) - [c6]Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic, Kovendhan Ponnavaikko:
Indexing techniques for file sharing in scalable peer-to-peer networks. ICCCN 2002: 10-15 - 2001
- [c5]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
- [j23]Noga Alon, Kenneth A. Berman, Daniel J. Kleitman:
On a Problem in Shuffling. J. Comb. Theory A 91(1-2): 5-14 (2000) - [j22]Fred S. Annexstein, Kenneth A. Berman:
Directional Routing via Generalized st-Numberings. SIAM J. Discret. Math. 13(2): 268-279 (2000) - [j21]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) - [c4]Fred S. Annexstein, Kenneth A. Berman:
Distributed Models and Algorithms for Survivability in Network Routing. IPDPS 2000: 359-364
1990 – 1999
- 1998
- [j20]Kenneth A. Berman, Xin Liu:
Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem. J. Comb. Theory B 74(1): 20-27 (1998) - 1997
- [j19]Kenneth A. Berman, Yanpei Liu:
Generalized Bicycles. Discret. Appl. Math. 78(1-3): 27-40 (1997) - [c3]Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan:
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. COCOON 1997: 18-22 - [c2]Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan:
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. SIROCCO 1997: 12-23 - 1996
- [j18]Kenneth A. Berman:
Vulnerability of scheduled networks and a generalization of Menger's Theorem. Networks 28(3): 125-134 (1996) - 1995
- [j17]Kenneth A. Berman, John V. Franco, John S. Schlipf:
Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. Discret. Appl. Math. 60(1-3): 77-91 (1995) - [c1]Kenneth A. Berman, John S. Schlipf, John V. Franco:
Computing Well-founded Semantics Faster. LPNMR 1995: 113-126 - 1992
- [j16]Kenneth A. Berman, Jerome L. Paul:
The bounded chromatic number for graphs of genus g. J. Comb. Theory B 56(2): 183-196 (1992) - 1990
- [j15]Kenneth A. Berman, Mokhtar H. Konsowa:
Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains. SIAM J. Discret. Math. 3(3): 311-319 (1990)
1980 – 1989
- 1987
- [j14]Kenneth A. Berman:
Balanced vertex weightings and arborescences. J. Comb. Theory B 42(3): 274-301 (1987) - 1986
- [j13]Kenneth A. Berman:
Parity results on connected f-factors. Discret. Math. 59(1-2): 1-8 (1986) - [j12]Noga Alon, Kenneth A. Berman:
Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory. J. Comb. Theory A 43(1): 91-97 (1986) - 1984
- [j11]Kenneth A. Berman:
A Generalization to Bases Common to r Binary Matroids A the Weighted Matrix-Tree Theorem in the Case when the Weights are Boolean. Eur. J. Comb. 5(3): 197-205 (1984) - 1983
- [j10]Kenneth A. Berman:
Proof of a conjecture of Häggkvist on cycles and independent edges. Discret. Math. 46(1): 9-13 (1983) - 1981
- [j9]Kenneth A. Berman:
Three-colourings of planar 4-valent maps. J. Comb. Theory B 30(1): 82-88 (1981) - [j8]Kenneth A. Berman:
Matchings and spanning trees in Boolean weighted graphs. J. Comb. Theory B 30(3): 343-350 (1981) - 1980
- [j7]Kenneth A. Berman:
A note on coloured quadrangulations. Discret. Math. 29(2): 215-217 (1980) - [j6]Kenneth A. Berman:
A Proof of Tuite's Trinity Theorem and a New Determinant Formula. SIAM J. Algebraic Discret. Methods 1(1): 64-69 (1980) - [j5]Kenneth A. Berman:
A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons. SIAM J. Algebraic Discret. Methods 1(3): 359-361 (1980)
1970 – 1979
- 1979
- [j4]Kenneth A. Berman:
Spanning arborescences, ingraphs, and outgraphs. J. Graph Theory 3(2): 141-150 (1979) - [j3]Kenneth A. Berman, H. Shank:
Full 4-colorings of 4-regular maps. J. Graph Theory 3(3): 291-294 (1979) - 1978
- [j2]Kenneth A. Berman:
Directed faces in planar digraphs and unicoloured faces in edge 2-coloured planar Eulerian maps. Discret. Math. 21(1): 83-85 (1978) - [j1]Kenneth A. Berman:
Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths. Discret. Math. 22(1): 75-80 (1978)
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 2025-01-09 13:01 CET 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: