Fine-Grained (FPT) Algorithms for Problems on Planar graphs

Add to your list(s) Download to your calendar using vCal

• Rajesh Chitnis, Birmingham
• Monday 12 October 2020, 14:00-15:00
• https://bham-ac-uk.zoom.us/j/8330240553.

If you have a question about this talk, please contact Johannes Carmesin.

In the first half of this talk I will describe how the paradigm of fixed-parameter tractable (FPT) algorithms allows us to make a refined analysis of running time of algorithms for (graph) problems. In the second half, I will focus on the particular case of planar graphs and describe some recent results & techniques in this area.

No background will be assumed, other than an undergraduate-level familiarity with graph theory and algorithms+complexity.

This talk is part of the Study group in Graph Theory, Topology and Algorithms series.

This talk is included in these lists:

• https://bham-ac-uk.zoom.us/j/8330240553

Note that ex-directory lists are not shown.