ACiD 2006:
Durham,
UK
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider (Eds.):
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 BibTeX
Invited Talks
Extended Abstracts
- Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Kernelization for Convex Recoloring.
23-35 BibTeX
- Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier:
Matrix Robustness, with an Application to Power System Observability.
37-48 BibTeX
- Fouad B. Chedid:
Parameterized Enumerability for the Database Theorist.
49-56 BibTeX
- Páidí J. Creed:
Sampling Eulerian Orientations of the Triangle.
57-68 BibTeX
- Henning Fernau, David Manlove:
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms.
69-84 BibTeX
- Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch:
Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times.
85-94 BibTeX
- Robert W. Irving, David Manlove, Gregg O'Malley:
Stable Marriage with Ties and Bounded Length Preference Lists.
95-106 BibTeX
- Hannes Moser, Dimitrios M. Thilikos:
Parameterized Complexity of Finding Regular Induced Subgraphs.
107-118 BibTeX
- Sofya Poger, Yoram J. Sussmann:
A Delta-Wye-Delta Reduction for Planar Grid Graphs in Subquadratic Time.
119-130 BibTeX
- Igor Razgon:
A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3.
131-142 BibTeX
- Allan Scott:
Short Pursuit-Evasion.
143-152 BibTeX
Short Abstracts
Copyright © Sat May 16 22:55:44 2009
by Michael Ley (ley@uni-trier.de)
