
Graph-Theoretic Concepts in Computer Science
Hans L. Bodlaender
₹5,574

Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday
by Hans L. Bodlaender, Rodney Downey, Fedor V. Fomin
Free delivery. Nothing extra to pay at checkout.
Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschrift has been published in honor of Mike Fellows on the occasion of his 60th birthday.
Description supplied by the publisher.