Algorithms and Complexity

This special issue includes papers selected from the Sixth Italian Conference on Algorithms and Complexity (CIAC 2006), which was held at the Department of Computer Science of the “Sapienza” University of Rome, Italy from May 29 to May 31, 2006. CIAC is a series of international conferences that present original research contributions in all aspects of the use, design, analysis and experimentation of efficient algorithms and data structures. This special issue include six papers invited from the 33 contributions accepted for presentation at the conference. The papers that appear in this volume are in a variety of different directions, reflecting the fact that research in algorithmics is very lively and relevant to many areas. The papers in this special issue are final, generally widely rewritten and expanded versions of the conference papers and have been fully refereed in accord with the high standards of the Journal of Discrete Algorithms. We would like to thank all the colleagues who contributed to this special issue. In particular, we wish to thank the authors for the fine quality of their work, and their diligent efforts during the refereeing process. Our warmest appreciation also goes to the excellent job done by the numerous referees, who played a vital role in making this special issue live up to high quality standards. We hope the readers will enjoy the result.