Skip to main content

Workshop Program

Sunday
9:30 – 10:00 Registration. Warwick Mathematics Institute
Morning Session. Room MS.01
10:00 – 10:10 Opening
10:10 – 10:45 Seffi Naor
Technion
Partitioning Graphs into Balanced Components
10:45 – 11:20 Matthias Englert
RWTH Aachen
The Power of Reordering for Online Minimum Makespan Scheduling
11:20 – 11:50 Coffee break
11:50 – 12:25 Matthew Andrews
Alcatel-Lucent Bell Labs
Approximately Solving Fixed Packing Problems in Time Linear in the Error
12:30 – 1:30 Lunch (Radcliffe House)
 
Afternoon Session. Room MS.01
2:20 – 2:55 Nigel Walker
BT Labs
Dynamic Bandwidth Assignment in Core Networks
2:55 – 3:30 Gordon Wilfong
Alcatel-Lucent Bell Labs
A Fractional Model of the Border Gateway Protocol (BGP)
3:30 – 4:00 Amos Fiat
Tel Aviv University
Subjective vs. Objective Reality - the Risk of Running Late
4:00 – 4:25 Coffee break
4:25 – 5:00 Fabrizio Grandoni
Universita Tor Vergata
Budgeted Matching and Budgeted Matroid Intersection via the Gasoline Puzzle
5:00 – 5:35 Naveen Garg
IIT, New Delhi
Facility Location with Uniform Capacities
5:35 – 6:10 Thomas Rothvoss
EPFL
Approximation Connected Facility Location Problems via Random Facility Sampling and Core Detouring
Monday
Morning Session. Room MS.01
10:15 – 10:50 Mohit Singh
Microsoft Research
Iterative Methods in Combinatorial Optimization
10:50 – 11:25 Nikhil Bansal
IBM Watson, Yorktown
Degree Bounded Network Design
11:25 – 11:50 Coffee break [Room D1.107]
11:50 – 12:25 Kunal Talwar
Microsoft Research
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search
12:30 – 1:30 Lunch (Radcliffe House)
 
Afternoon Session. Room B3.03
2:20 – 2:55 Chaitanya Swamy
University of Waterloo
Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions
2:55 – 3:30 Amit Kumar
IIT, New Delhi
Stochastic Steiner Tree with Non-uniform Inflation
3:30 – 4:05 Piotr Sankowski
Universita La Sapienza
Stochastic Online Steiner Tree
4:05 – 4:30 Coffee break [Room D1.107]
4:30 – 5:05 Christian Scheideler
TU Munich
An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model
5:05 – 5:40 Thomas Erlebach
University of Leicester
Domination in Geometric Intersection Graphs
5:40 – 6:15 Kamal Jain
Microsoft Research
Atomic Economics
Tuesday
Morning Session. Room MS.01
10:15 – 10:50 Ayalvadi Ganesh
University of Bristol
Controlling Epidemic Spread on Networks
10:50 – 11:25 Tim Griffin
University of Cambridge
The Metarouting Project
11:25 – 11:50 Coffee break
11:50 – 12:25 Mohammad Hajiaghayi
AT&T
Game Theory and Wireless Network Design: Cell Breathing in Wireless LANs
12:30 – 1:30 Lunch (Radcliffe House)
1:45 – 6:30 Excursion to
Warwick Castle
Warwick Castle   
7:00 – 12:00 Dinner in
The Cross
The Cross Restaurant
Wednesday
Morning Session. Room MS.01
10:15 – 10:50 Yuval Rabani
Technion
Approximation Algorithms for Graph Homomorphism Problems
10:50 – 11:25 Lap Chi Lau
University of Hong Kong
Degree Bounded Network Design with Metric Costs
11:25 – 11:50 Coffee break
11:50 – 12:25 Shuchi Chawla
University of Wisconsin
Bertrand Competition in Networks
12:30 – 1:30 Lunch (Radcliffe House)
 
Afternoon Session. Room MS.01
2:15 – 2:50 Neil Olver
McGill University
The VPN Conjecture is True
2:50 – 3:25 Gianpaolo Oriolo
Universita Tor Vergata
The VPN Problem with Concave Costs
3:25 – 4:00 Harald Räcke
DIMAP, University of Warwick
Optimal Hierarchical Decompositions for Congestion Minimization in Networks
4:00 – 4:20 Coffee break
4:20 – 4:55 Bruce Shepherd
McGill University

A Comparison between Dynamic and Oblivious Routing Models for Robust Network Design

4:55 – 5:30 Damon Wischik
UCL
Short Messages: Algorithm Design and Analysis for Unreliable Networks