# Kenneth A. Berman

According to our database

Collaborative distances:

^{1}, Kenneth A. Berman authored at least 42 papers between 1978 and 2012.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2012

Proceedings of the Web Science 2012, 2012

2011

J. Comb. Optim., 2011

2010

Dynamic state-based routing for load balancing and efficient data gathering in wireless sensor networks.

Proceedings of the 2010 International Symposium on Collaborative Technologies and Systems, 2010

2007

SIAM J. Discret. Math., 2007

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006

Theor. Comput. Sci., 2006

Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet.

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Proceedings of the 37th SIGCSE Technical Symposium on Computer Science Education, 2006

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

Discovering Adaptive Heuristics for Ad-Hoc Sensor Networks by Mining Evolved Optimal Configurations.

Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

2004

Proceedings of the 11st ACM SIGOPS European Workshop, 2004

A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities.

Proceedings of the MobiQuitous'04 Workshop on Peer-to-Peer Knowledge Management (P2PKM 2004), 2004

2002

Discret. Appl. Math., 2002

Proceedings of the 11th International Conference on Computer Communications and Networks, 2002

2001

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000

Theor. Comput. Sci., 2000

SIAM J. Discret. Math., 2000

J. Comb. Theory A, 2000

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1998

Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem.

J. Comb. Theory B, 1998

1997

Discret. Appl. Math., 1997

On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings.

Proceedings of the SIROCCO'97, 1997

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

Networks, 1996

1995

Discret. Appl. Math., 1995

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

1992

J. Comb. Theory B, 1992

1990

SIAM J. Discret. Math., 1990

1987

J. Comb. Theory B, 1987

1986

J. Comb. Theory A, 1986

Discret. Math., 1986

1984

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., 1984

1983

Discret. Math., 1983

1981

J. Comb. Theory B, 1981

J. Comb. Theory B, 1981

1980

A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons.

SIAM J. Algebraic Discret. Methods, 1980

SIAM J. Algebraic Discret. Methods, 1980

Discret. Math., 1980

1979

J. Graph Theory, 1979

J. Graph Theory, 1979

1978

Directed faces in planar digraphs and unicoloured faces in edge 2-coloured planar Eulerian maps.

Discret. Math., 1978

Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths.

Discret. Math., 1978