default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACiD 2006: Durham, UK
- 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
Invited Talks
- Jan Krajícek:
Proof Complexity Generators. ACiD 2006: 3 - Alexander Schrijver:
New Code Bounds with Algebra and Semidefinite Programming. ACiD 2006: 5 - 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
Extended Abstracts
- 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 - 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 - Robert W. Irving, David F. Manlove, Gregg O'Malley:
Stable Marriage with Ties and Bounded Length Preference Lists. ACiD 2006: 95-106 - 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 - Allan Scott:
Short Pursuit-Evasion. ACiD 2006: 143-152
Short Abstracts
- Walid Ben-Ameur:
On the Maximum Cut Problem. ACiD 2006: 154 - Luis Cereceda:
Finding Paths between Colourings. ACiD 2006: 155 - Jan van den Heuvel:
On the Complexity of Ordered Colourings. ACiD 2006: 156 - Andriy Kharechko:
Parametric Polynomial Time Perceptron Rescaling Algorithm. ACiD 2006: 157 - Dániel Marx:
A Parameterized View on Matroid Optimization Problems. ACiD 2006: 158 - Taoyang Wu:
Extremal Sequence Theory. ACiD 2006: 159 - Vadim E. Zverovich:
The Computer System GRAPHOGRAPH. ACiD 2006: 160
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.
last updated on 2026-08-06 22:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
