Institute for Mathematical Sciences

Workshop on Parametric Complexity

(21 - 25 August 2017)

Venue: IMS Auditorium
PDF Abstracts

Monday, 21 Aug 2017

08:50am - 09:00amRegistration
09:00am - 10:00am

Disjoint NP pairs and propositional proof systems

(PDF)

Alan Selman
University at Buffalo, The State University of New York, USA
10:00am - 10:30amGroup Photo & Coffee Break
10:30am - 11:20am

Mini course:

New progress on the (Parameterized?) circuit size problem

(PDF) ( Video 1, Video 2, Video 3)

Eric Allender
Rutgers, The State University of New Jersey, USA
11:20am - 01:30pmLunch Break
01:30pm - 02:30pm

The parameterised complexity of topological problems

Benjamin Burton
The University of Queensland, Australia
02:30pm - 03:20pm

Mini course:

Effective fractal dimension theory: exploring the extreme cases

(PDF 1, PDF 2, PDF 3) (Video 2, Video 3)

Elvira Mayordomo
Universidad de Zaragoza , Spain

Tuesday, 22 Aug 2017

08:50am - 09:00amRegistration
09:00am - 10:00am

Quasi polynomial and FPT algorithms for parity games

(PDF)

Sanjay Jain
National University of Singapore, Singapore
10:00am - 10:30amCoffee Break
10:30am - 11:30am

New and simple FPT algorithms for vertex covers

(PDF)

Leizhen Cai
The Chinese University of Hong Kong, Hong Kong
11:30am - 01:30pmLunch Break
01:30pm - 02:30pm

A parameterized approach to the analysis of Otitis media data

(PDF)

Peter Shaw
Charles Darwin University, Australia
02:30pm - 03:20pm

Mini course:

New progress on the (Parameterized?) circuit size problem

(PDF) ( Video 1, Video 2, Video 3)

Eric Allender
Rutgers, The State University of New Jersey, USA

Wednesday, 23 Aug 2017

08:50am - 09:00amRegistration
09:00am - 10:00am

Recent progress on maximum agreement forest

(PDF)

Jianer Chen
Texas A&M University, USA
10:00am - 10:30amCoffee Break
10:30am - 11:20am

Mini course:

FPT-inspired approximation algorithms

(PDF) ( Video 1, Video 2, Video 3)

Henning Fernau
Universität Trier, Germany
11:20am - 01:30pmLunch Break
01:30pmSocial Excursion to National Gallery Singapore
Address: 1 St. Andrew's Rd, Singapore 178957

Thursday, 24 Aug 2017

08:50am - 09:00amRegistration
09:00am - 10:00am

Efficient algorithms for hard problems on structured electorates

(PDF)

Neeldhara Misra
Indian Institute of Technology, Gandhinagar, India
10:00am - 10:30amCoffee Break
10:30am - 11:20am

Mini course:

New progress on the (Parameterized?) circuit size problem

(PDF) ( Video 1, Video 2, Video 3)

Eric Allender
Rutgers, The State University of New Jersey, USA
11:20am - 01:30pmLunch Break
01:30pm - 02:20pm

Mini course:

Effective fractal dimension theory: exploring the extreme cases

(PDF 1, PDF 2, PDF 3) (Video 2, Video 3)

Elvira Mayordomo
Universidad de Zaragoza , Spain
02:20pm - 03:10pm

Mini course:

FPT-inspired approximation algorithms

(PDF) ( Video 1, Video 2, Video 3)

Henning Fernau
Universität Trier, Germany

Friday, 25 Aug 2017

08:50am - 09:00amRegistration
09:00am - 10:00am

Graph decompositions and algorithms

(PDF)

Fedor V. Fomin
University of Bergen, Norway
10:00am - 10:30amCoffee Break
10:30am - 11:20am

Mini course:

Effective fractal dimension theory: exploring the extreme cases

(PDF 1, PDF 2, PDF 3) (Video 2, Video 3)

Elvira Mayordomo
Universidad de Zaragoza , Spain
11:20am - 01:30pmLunch Break
01:30pm - 02:20pm

Mini course:

FPT-inspired approximation algorithms

(PDF) ( Video 1, Video 2, Video 3)

Henning Fernau
Universität Trier, Germany
02:20pm - 03:10pm

Towards a parameterised analogue of Toda's theorem

(PDF)

Catherine McCartin
Massey University, New Zealand