ACiD 2005: Durham, UK

Hajo Broersma, Matthew Johnson, Stefan Szeider (Eds.): Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK. Texts in Algorithmics 4 King's College, London 2005, ISBN 1-904987-10-9 BibTeX

Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond: FPT is P-Time Extremal Structure I. 1-41 BibTeX
Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston: Asymptotically Faster Algorithms for Parameterized FACE COVER. 43-58 BibTeX
Faisal N. Abu-Khzam, Michael A. Langston: Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk Dimension. 59-67 BibTeX
David Manlove, Gregg O'Malley: Student-Project Allocation with Preferences over Projects. 69-80 BibTeX
Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. 81-94 BibTeX
Gregory Gutin, Tommy R. Jensen, Anders Yeo: Optimal On-Line Bin Packing with Two Item Sizes. 95-103 BibTeX
Daniel Lokshtanov, Christian Sloper: Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time. 105-113 BibTeX
Petrica C. Pop, Georg Still, Walter Kern: An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size. 115-121 BibTeX
M. V. Panduranga Rao, V. Vinay: Quantum Finite Automata and Weighted Automata. 123-134 BibTeX
Andreas Spillner: A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner Points. 135-146 BibTeX