Vol 13, No 3 (2011)

Table of Contents

Analysis of Algorithms

Digital search trees with m trees: Level polynomials and insertion costs PDF PostScript
Helmut Prodinger 1-8
The Variance of The Profile in Digital Search Trees PDF PostScript
Ramin Kazemi, Mohammad Q Vahidi-Asl 21-38


New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree PDF
Xin Zhang, Jian-Liang Wu, Guizhen Liu 9-16
On the number of factors in codings of three interval exchange PDF PostScript
Petr Ambrož, Anna Frid, Zuzana Masáková, Edita Pelantová 51-66
The largest singletons in weighted set partitions and its applications PDF PostScript
Yidong Sun, Yanjie Xu 75-86

Graph Theory

On the number of maximal independent sets in a graph PDF PostScript
David Wood 17-20
Nordhaus-Gaddum Type Results for Total Domination PDF PostScript
Michael Anthony Henning, Ernst Joubert, Justin Southey 87-96

Graphs and Algorithms

On the Book Thickness of k-Trees PDF PostScript
Vida Dujmović, David Wood 39-44
On the complexity of vertex-coloring edge-weightings PDF PostScript
Andrzej Dudek, David Wajc 45-50
On packing of two copies of a hypergraph PDF PostScript
Monika Pilśniak, Mariusz Woźniak 67-74
8-star-choosability of a graph with maximum average degree less than 3 PDF PostScript
Min Chen, André Raspaud, Weifan Wang 97-110

ISSN: 1365-8050