Monday July 29, 2013 
8:309:00

Morning Coffee and Snacks 
9:009:05

Opening Remarks by Matheus Grasselli 
9:05–9:30

C.Chekuri
Multiroute Flows and Nodeweighted Network Design (presentation) 
9:30–10:00

Z.Friggstad
A Constant Factor Approximation for RegretBounded Vehicle
Routing (presentation) 
10:00–10:30

R.Rajaraman
On the Complexity of Information Spreading in Dynamic Networks
(presentation) 
10:30–11:00

Coffee Break 
11:00–11:30

H.C.An
Centrality of Trees for Capacitated kCenter (presentation) 
11:30–12:00

G.Wilfong
Design of Interdomain Overlay Networks (presentation) 
12:00–2:00

Lunch (on your own) 
2:00–3:00

Rump Session I
(5minute talks)
Slides: Ahmed Abdi , Andreas
Emil Feldmann, Jochen Konemann, Laura Sanit , Zhihan
Gao , Oliver Gobel
, S. Thomas McCormick
, Michael Nugent
, Jannik Silvanus
, J. Vygen

Tuesday July 30, 2013 
8:309:00

Morning Coffee and Snacks 
9:009:05

C.Borradaile
From Network Design to Network Modelling (presentation) 
9:05–9:30


9:30–10:00

M.Pilipczuk
Network Sparsification for Steiner Problems on Planar and
BoundedGenus Graphs (presentation) 
10:00–10:30

T. Fukunaga
Iterative Rounding Approximation Algorithms for Degreebounded
Nodeconnectivity Network Design (presentation) 
10:30–11:00

Coffee Break 
11:00–11:30

M.Hajiaghayi
Nodeweighted Steiner Forest and Extensions via Disk Paintings 
11:30–12:00

F.Grandoni
A Mazing 2+? Approximation for Unsplittable Flow on a Path 
12:00–2:00

Lunch 


5:00–6:00

L.C.Lau
Analysis of Spectral Partitioning Through Higher Order Spectral
Gap 
6:00–7:00

J.Chuzhoy
Polynomial Bounds for the GridMinor Theorem 
Wednesday July 31, 2013 
8:309:00

8:309:00 Morning Coffee and Snacks 
9:009:30

T.McCormick
Combinatorial Algorithms to Solve Network Interdiction and
Scheduling Problems with Multiple Parameters (presentation) 
9:30–10:00

J.Ward
From Submodular to kSubmodular Maximization (presentation) 
10:00–10:30

I.Post
Online Submodular Welfare Maximization: Greedy is Optimal
(tentative) (presentation)

10:30–11:00

Coffee Break 

D.Adjiashvili
Nonuniform Models for Robust Network Design (presentation) 
11:30–12:00

K.Talwar
Approximating Hereditary Discrepancy 
12:00–2:00

Lunch 


5:00–6:00

Rump Session II
Slides: Sara Ahmadian
, Chandra Chekuri , Jeremy
Karp , S. Thomas McCormick



Thursday August 1,
2013 
8:309:00

Morning Coffee and Snacks 
9:00–9:30

J.Vygen
Smallest twoedgeconnected spanning subgraphs and the TSP
(presentation) 
9:30–10:00

M.Mucha
ATSP and NoWait Flowshop (presentation) 
10:00–10:30

J.Byrka
Approximation Algorithms for the Joint Replenishment Problem
with Deadlines
(presentation)

10:30–11:00

Coffee Break 
11:00–11:30

K.Pruhs
Hallucination Helps: Energy Efficient Virtual Circuit Routing
(presentation) 
11:30–12:00

N.Olver
ChainConstrained Spanning Trees (presentation) 
12:00–2:00

Lunch 


5:00–6:00

N.Harvey
Spectrally Thin Trees 
6:00–7:00

T.Rothvoss
Approximating Bin Packing within O(log OPT log log OPT) bins 
Friday August 2, 2013 
8:309:00

Morning Coffee and Snacks 
9:00–9:30

V.Nagarajan
The Euclidean kSupplier Problem (presentation) 
9:30–10:00

R.Schwartz
Nonuniform Graph Partitioning (presentation) 
10:00–10:30

K.Chandrasekaran
A Polynomialtime Cutting Plane Algorithm for Perfect Matchings 
10:30–11:00

Coffee Break 
11:00–11:30

G.Oriolo
The Online Part Replacement Problem 
11:30–12:00

S.Chawla
Network Design with Coverage Costs 
12:00–12:30

K. Jain
Algorithmic Game Theory of eBay BuyerSeller Matching 