Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Berman, Kenneth A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Why locally-fair maximal flows in client-server networks perform well
Kenneth A. Berman
,
Chad Yoshikawa
Lecture Notes in Computer Science
5609
, 2009, pp. 368-377
Locating servers for reliability and affine embeddings
Kenneth A. Berman
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 637-646
Broadcasting in unstructured peer-to-peer overlay networks
Fred S. Annexstein
,
Kenneth A. Berman
,
Mijhalo A. Jovanović
Theoretical Computer Science
355
(1), 2006, pp. 25-36
Latency effects on reachability in large-scale peer-to-peer networks
Fred S. Annexstein
,
Kenneth A. Berman
,
Mihajlo A. Jovanović
Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'2001 (Crete Island, Greece, July 3-6, 2001)
, 2001, pp. 84-92
A multi-tree routing scheme using acyclic orientations
Fred S. Annexstein
,
Kenneth A. Berman
,
Tsan-Sheng Hsu
,
Ram Swaminathan
Theoretical Computer Science
240
(2), 2000, pp. 487-494
Directional routing via generalized
st
-numberings
Fred S. Annexstein
,
Kenneth A. Berman
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 268-279
Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
Kenneth A. Berman
,
Xin Liu
Journal of Combinatorial Theory Series B
74
(1), 1998, pp. 20-27
A multi-tree generating routing scheme acyclic orientations
Fred S. Annexstein
,
Kenneth A. Berman
,
Ram Swaminathan
Lecture Notes in Computer Science
1276
, 1997, pp. 18-22
Approximation algorithms for optimal-depth independent spanning trees and
st
-numberings
Fred S. Annexstein
,
Kenneth A. Berman
,
Ram Swaminathan
Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity, SIROCCO'97 (Monte Verità, Switzerland, July 24-26, 1997)
, 1997, pp. 12-23
Generalized bicycles
Kenneth A. Berman
,
Yanpei Liu
Discrete Applied Mathematics
78
(1-3), 1997, pp. 27-40
Vulnerability of scheduled networks and a generalized of Menger's theorem
Kenneth A. Berman
Networks
28
(3), 1996, pp. 125-134
Unique satisfiability of Horn sets can be solved in nearly linear time
Kenneth A. Berman
,
John Franco
,
John S. Schlipf
Discrete Applied Mathematics
60
, 1995, pp. 77-91
The bounded chromatic number for graphs of genus
g
Kenneth A. Berman
,
Jerome L. Paul
Journal of Combinatorial Theory Series B
56
(2), 1992, pp. 183-196
Random paths and cuts, electrical networks, and reversible Markov chains
Kenneth A. Berman
,
Mokhtar H. Konsowa
SIAM Journal on Discrete Mathematics
3
(3), 1990, August, pp. 311-319
Bicycles and spanning trees
Kenneth A. Berman
SIAM Journal on Algebraic Discrete Methods
7
, 1986, pp. 1-12
Matchings and spanning trees in Boolean weighted graphs
Kenneth A. Berman
Journal of Combinatorial Theory Series B
30
(3), 1981, June, pp. 343-350
Three-colourings of planar 4-valent maps
Kenneth A. Berman
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 82-88
A proof of Tutte's trinity theorem and a new determinant formula
Kenneth A. Berman
SIAM Journal on Algebraic Discrete Methods
1
, 1980, pp. 64-69
A graph theoretical approach to handicap ranking of tournaments and paired comparison
Kenneth A. Berman
SIAM Journal on Algebraic Discrete Methods
1
, 1980, pp. 359-361
Full 4-colorings of 4-regular maps
Kenneth A. Berman
,
H. Shank
Journal of Graph Theory
3
(3), 1979, pp. 291-294
Spanning arborescences, ingraphs, and outgraphs
Kenneth A. Berman
Journal of Graph Theory
3
(2), 1979, pp. 141-150