Parameterized Complexity for Practical Computing Workshop
Wednesday July 25th 2018Venue: Victoria University, Cotton Building, Room CO350
Programme
| Time | Description |
|---|---|
| 9-9.30am | Arrival - Tea, Coffee, Muffins |
| 9.30am - 10.30am | Welcome, followed by keynote presentation from Prof. Michael Fellows: “The basics of parameterized complexity; origins in graph minor theory and well quasi-ordering; and the wqo functor project.” |
| 10.30-10.55am | Presentation from Peter Shaw: “Game Theory and the Human Trafficking Dilemma.” |
| 10.55-11.20am | Presentation from Simone Linz: “On the parameterized complexity of reconstructing phylogenetic networks.” |
| 11.20-11.45am | Presentation from Jens Dietrich: “Making it worse to make it better: A case study on how to design a fast algorithm for static program analysis.” |
| 11.45-12.15pm | Light lunch/sustenance - CO350 |
| 12.15-12.40pm | Presentation from Fran Rosamond: “An FPT mystery: Improving the Diameter of a Planar Graph.” |
| 12.40-1.05pm | Presentation from Ljiljana Brankovic: “Parameterized Approximation Algorithms for 3-Hitting Set.” |
| 1.05-1.30pm | Presentation from Kamran Najeebullah: “Complexity of Optimally Defending and Attacking a Network” |
| 1.30-1.55pm | Presentation from Peter Shaw: “Turbo charging heuristics: adjusting the parameters for optimum performance.” |
| 2-3pm | Substantial second lunch/discussions (at Milk and Honey, next to “The Hub”) |
| 3-3.20pm | Presentation from Catherine McCartin: “Combining FPT with heuristics: network augmentation strategies for target set selection.” |
| 3.20pm | Presentation of open problems from different areas: David Bryant, Michael Fellows, Fran Rosamond, Peter Shaw, Simone Linz
followed by collaborative discussion of one or two selected problems: lead by Prof. Michael Fellows |