KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:
Applications of Treewidth in Algorithm Design Daniel Lokshtanov Based on joint work with Hans Bodlaender,Fedor Fomin,Eelko Penninkx, Venkatesh Raman, Saket.
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and (Local) Treewidth MohammadTaghi Hajiaghayi CS & AI Lab M.I.T. Joint work mainly.
Collective Tree Spanners and Routing in AT-free Related Graphs F.F. Dragan, C. Yan, D. Corneil Kent State University University of Toronto.
Applications of Treewidth in Algorithm Design
