Algorithms and Complexity in Durham 2007,
Proceedings of the Third ACiD Workshop

Edited by Hajo Broersma, Stefan Dantchev, Matthew Johnson, and Stefan Szeider

Texts in Algorithmics 9,
College Publications, London, 2007.
isbn 978-1-904987-55-0

Download: [BibTex file]


  1. Bruno Courcelle, Monadic Second-Order Queries on Graphs: Vertex Labelling for Efficient Evaluation and Linear Delay Enumeration (invited talk) pp. 3-12,
  2. Emgad H. Bachoore and Hans L. Bodlaender, Convex Recoloring of Leaf-Colored Trees, pp. 19-33,
  3. Fouad B. Chedid, A Scalable Parallelization of the Two-List Algorithm of Optimal Cost $O(2^{n/2})$, pp. 35-42,
  4. Michael Dom and Rolf Niedermeier, The Search for Consecutive Ones Submatrices: Faster and More General, pp. 43-54,
  5. Michael Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, and Frances Rosamond, Parameterized Complexity via Combinatorial Circuits, pp. 55-67,
  6. G. Gutin, A. Johnstone, J. Reddington, E. Scott, A. Soleimanfallah, and A. Yeo, An Algorithm for Finding Connected Convex Subgraphs of an Acyclic Digraph, pp. 69-82,
  7. Costas S. Iliopoulos and M. Sohel Rahman, New Efficient Algorithms for LCS and Constrained LCS Problem, pp. 83-94,
  8. Costas Iliopoulos, M. Sohel Rahman, Michal Voracek, and Ladislav Vagner, Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata, pp. 95-106,
  9. Zoltan Miklos, On the Parallel Complexity of Structural CSP Decomposition Methods, pp. 107-118,
  10. Igor Razgon, Parameterized Directed Feedback Vertex Set and Multicut Problems on Directed Acyclic Graphs, pp. 119-128,
  11. Colin T. S. Sng and David F. Manlove, Popular Matchings in the Weighted Capacitated House Allocation Problem, pp. 129-140,

[back to Stefan Szeider's homepage]