Hong Kong Theory Day 2017

January 6, 2017 (Friday)
Department of Computing
Hong Kong Polytechnic University
map     contact      abstracts

Confirmed speakers

Program


8:30–9:20
 
Radu Curticapean     slides
New insights into counting subgraphs
9:25–10:10
 
Chihao Zhang     slides
FPTAS for Counting Proper Four Colorings on Cubic Graphs
10:10–10:40
 
Coffee break
10:40–11:25
 
Zhihao Tang     slides
Online Submodular Maximization with Free Disposal
11:25–12:10
 
Shaofeng Jiang     slides
Recent Advances on Approximation Algorithms in Doubling Metrics
12:10–2:00
 
Catered lunch
1:55–2:00
 
Group photo
2:00–2:50
 
Siu-Wing Cheng     slides
Approximate Shortest Paths in Weighted Regions
2:55–3:45
 
Pavol Hell     slides
Interval-like Graphs and Digraphs
3:45–4:15
 
Coffee break
4:15–5:05
 
Minming Li     slides
Facility Location Games: From Origin to Recent Development
5:10–6:10
 
Saket Saurabh     slides
Exact Algorithms via Monotone Local Search


Lunch

The event is open to anyone. A catered lunch is provided for registered participants (deadline: December 15).
Please complete this form or drop a quick email to register for the lunch (with your food preference, if any).

Venue

TU201 (Cheung On Tak Lecture Theatre), Hong Kong Polytechnic University

Afterword

We plan to go hiking on January 7 (Saturday).
Participants are also welcome to stay longer for further discussion and collaboration.