Iterative Compression
Treewidth and Applications
Generalization and Specialization of Kernelization Daniel Lokshtanov.
Data reduction lower bounds: Problems without polynomial kernels
Constructing evolutionary trees from rooted triples Bang Ye Wu Dept. of Computer Science and Information Engineering Shu-Te University.
Applications of Treewidth in Algorithm Design Daniel Lokshtanov Based on joint work with Hans Bodlaender,Fedor Fomin,Eelko Penninkx, Venkatesh Raman, Saket.
Iterative Methods in Combinatorial Opt r Ravi Mohit Singh
Bidimensionality (Revised)
Data reduction lower bounds: Problems without polynomial kernels Hans L. Bodlaender Joint work with Downey, Fellows, Hermelin, Thomasse, Yeo.
Applications of Treewidth in Algorithm Design
