Seminars & Colloquia
"Fun with Parameterized Algorithms"
Monday November 03, 2014 10:30 AM
Location: 3211, EBII NCSU Centennial Campus
(Visitor parking instructions)
This talk is part of the Theory Seminar Series
In the last twenty-five years, parameterized complexity and algorithmics has matured from its humble inception into a rich, booming field of theoretical research. In this talk we highlight our favorite results and techniques to demonstrate how multivariate algorithms (and thus parameterized complexity) catalyzed progress in both theory and practice. We will touch on the topics of kernelization, graph width measures, model checking and intractability results.
Whether you're curious, skeptical or already converted: come learn why parameterized complexity is a philosophically satisfying and immensely useful framework.
Felix Reidl and Fernando Sanchez Villaamil are PhD candidates at the Theoretical Computer Science chair at RWTH Aachen University. Their research interests center around problems in parameterized complexity (fixed parameter tractability), including algorithm design and kernelization for graph problems. Recent work includes applications of ideas from structural sparsity to complex networks and problems in network science.
Felix Reidl Web page: http://tcs.rwth-aachen.de/~reidl/
Fernando Sanchez Web page: http://tcs.rwth-aachen.de/~sanchez/
Special Instructions: This is a tag-team talk with two speakers: Felix Reidl and Fernando S\\\'anchez Villaamil. They should both have their information listed in the posting. I will provide a finalized title + the abstract & a better dual bio as soon as I receive it, but wanted to get this on the calendar.
Host: Blair D. Sullivan, CSC