|
|
|
Algorithmics
 Back
 | Algorithms and Complexity in Durham 2005: Proceedings of the First ACiD Workshop
Hajo Borersma, Matthew Johnson and Stefan Szeider, eds
This volume contains the proceedings of ACiD 2005, the first workshop on Algorithms and Complexity in Durham to be held from 8 July to 10 July, 2005. The workshop arose from two coinciding events: the creation of a new research group in Algorithms and Complexity in the Department of Computer Science at the University of Durham, and the choice of the university's Department of Mathematics as the location for the biennial British Combinatorial Conference which will take place immediately after the workshop. One of the aims of the workshop is to bring together researchers from the two communities of Discrete Mathematics and Theoretical Computer Science, and to stimulate interaction and cooperation. This aim is reflected by the choice of the three invited speakers: Michael Fellows, Pavel Pudl\'{a}k, and Carsten Thomassen. They will present one hour lectures on fixed-parameter tractability, proof complexity, and graph colouring, respectively, and Michael Fellows also contributed the first paper of this volume.
1 July 2005
ISBN 1-904987-10-9
Buy from Amazon: UK US |
|
|
