default search action
ACiD 2005: Durham, UK
- Hajo Broersma, Matthew Johnson, Stefan Szeider:
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. ACiD 2005: 1-41 - Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston:
Asymptotically Faster Algorithms for Parameterized FACE COVER. ACiD 2005: 43-58 - Faisal N. Abu-Khzam, Michael A. Langston:
Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk Dimension. ACiD 2005: 59-67 - David F. Manlove, Gregg O'Malley:
Student-Project Allocation with Preferences over Projects. ACiD 2005: 69-80 - Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD 2005: 81-94 - Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo:
Optimal On-Line Bin Packing with Two Item Sizes. ACiD 2005: 95-103 - Daniel Lokshtanov, Christian Sloper:
Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time. ACiD 2005: 105-113 - Petrica C. Pop, Georg Still, Walter Kern:
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size. ACiD 2005: 115-121 - M. V. Panduranga Rao, V. Vinay:
Quantum Finite Automata and Weighted Automata. ACiD 2005: 123-134 - Andreas Spillner:
A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner Points. ACiD 2005: 135-146
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.