- 2006
- Walid Ben-Ameur:
On the Maximum Cut Problem. ACiD 2006: 154 - Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Kernelization for Convex Recoloring. ACiD 2006: 23-35 - Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier:
Matrix Robustness, with an Application to Power System Observability. ACiD 2006: 37-48 - Luis Cereceda:
Finding Paths between Colourings. ACiD 2006: 155 - Fouad B. Chedid:
Parameterized Enumerability for the Database Theorist. ACiD 2006: 49-56 - Páidí J. Creed:
Sampling Eulerian Orientations of the Triangle. ACiD 2006: 57-68 - Henning Fernau, David F. Manlove:
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms. ACiD 2006: 69-84 - Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch:
Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. ACiD 2006: 85-94 - Jan van den Heuvel:
On the Complexity of Ordered Colourings. ACiD 2006: 156 - Robert W. Irving, David F. Manlove, Gregg O'Malley:
Stable Marriage with Ties and Bounded Length Preference Lists. ACiD 2006: 95-106 - Andriy Kharechko:
Parametric Polynomial Time Perceptron Rescaling Algorithm. ACiD 2006: 157 - Jan Krajícek:
Proof Complexity Generators. ACiD 2006: 3 - Dániel Marx:
A Parameterized View on Matroid Optimization Problems. ACiD 2006: 158 - Hannes Moser, Dimitrios M. Thilikos:
Parameterized Complexity of Finding Regular Induced Subgraphs. ACiD 2006: 107-118 - Sofya Poger, Yoram J. Sussmann:
A Delta-Wye-Delta Reduction for Planar Grid Graphs in Subquadratic Time. ACiD 2006: 119-130 - Igor Razgon:
A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3. ACiD 2006: 131-142 - Alexander Schrijver:
New Code Bounds with Algebra and Semidefinite Programming. ACiD 2006: 5 - Allan Scott:
Short Pursuit-Evasion. ACiD 2006: 143-152 - Detlef Seese:
Trees, Grids and Matroids: Observations on Logical Ways to Avoid Complexity. ACiD 2006: 7 - Berthold Vöcking:
Congestion Games: Optimization in Competition. ACiD 2006: 9-20 - Taoyang Wu:
Extremal Sequence Theory. ACiD 2006: 159 - Vadim E. Zverovich:
The Computer System GRAPHOGRAPH. ACiD 2006: 160 - Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK. Texts in Algorithmics 7, King's College, London 2006, ISBN 1-904987-38-9 [contents] - 2005
- 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 - 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 - Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond:
FPT is P-Time Extremal Structure I. ACiD 2005: 1-41 - 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 - David F. Manlove, Gregg O'Malley:
Student-Project Allocation with Preferences over Projects. ACiD 2005: 69-80