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