September 7-11, 2015
HIM Lecture Hall, Poppelsdorfer Allee 45
Organizers:
András Frank, Bruce Shepherd
Topics: Connectivity, Routing, Network Design
© HIM
Monday, September 7
| 10:30 - 11:00 | Registration & Welcome coffee |
| 11:00 - 11:30 | Wolfgang Mader: Critical vertices in k-connected digraphs |
| 11:30 - 12:00 | Victor Chepoi: Simple connectivity, local-to-global, and matroids |
| 12:00 - 14:00 | Lunch break |
| 14:00 - 16:00 | Discussion session |
| 16:00 - 16:30 | Tea and cake |
| 16:30 - 17:00 | Ahmad Abdi: Packing odd T-joins with at most two terminals |
| 17:00 - 17:30 | Tamás Király: Blocking optimal k-arborescences |
Tuesday, September 8
| 9:45 - 10:30 | Alexander Schrijver: The partially disjoint paths problem |
| 10:30 - 11:15 | Coffee break and group photo |
| 11:15 - 11:35 | Laurence Wolsey: A polyhedral approach to the maximum convex subset problem in 2-d |
| 11:35 - 12:00 | Vivek Madan: Simple and fast rounding algorithms for directed and node-weighted multiway cut |
| 12:00 - 14:00 | Lunch break |
| 14:00 - 16:00 | Discussion session |
| 16:00 - 16:30 | Tea and cake |
| 16:30 - 17:00 | Hiroshi Hirai: Combinatorial algorithms for some multiflow problems and related network designs |
| 17:00 - 17:30 | Hyung-Chan An: Dynamic facility location via exponential clocks |
| afterwards | Reception |
Wednesday, September 9
| 9:45 - 10:30 | Chandra Chekuri: On element-connectivity preserving graph simplification |
| 10:30 - 11:00 | Coffee break |
| 11:00 - 11:30 | Zeev Nutov: On LP-relaxations for the tree augmentation problem |
| 11:30 - 12:00 | Anke van Zuylen: Improved approximations for cubic bipartite and cubic graph-TSP |
| 12:00 - 14:00 | Lunch break |
| 14:00 - 16:00 | Discussion session |
| 16:00 - 16:30 | Tea and cake |
| 16:30 - 17:00 | Mohit Singh: Approximating minimum cost connectivity orientation and augmentation |
| 17:00 - 17:30 | Gruia Calinescu: Adversary games in secure/reliable network routing |
Thursday, September 10
| 9:45 - 10:30 | Rico Zenklusen: An O(1)-approximation for minimum spanning tree interdiction |
| 10:30 - 11:00 | Coffee break |
| 11:00 - 11:30 | András Sebő: Travelling salesmen on bounded degree trails |
| 11:30 - 12:00 | Jens Vygen: Reassembling trees for the traveling salesman |
| 12:00 - 14:00 | Lunch break |
| 14:00 - 16:00 | Discussion session |
| 16:00 - 16:30 | Tea and cake |
| 16:30 - 17:00 | Ken-ichi Kawarabayashi: Deterministic edge connectivity in near-linear time |
| 17:00 - 17:30 | Jørgen Bang-Jensen: Antistrong digraphs |
Friday, September 11
| 9:45 - 10:30 | Zoltán Szigeti: On (2k,k)-connected graphs |
| 10:30 - 11:00 | Coffee break |
| 11:00 - 11:30 | Andreas Emil Feldmann: A (1+ε)-embedding of low highway dimension graphs into bounded treewidth graphs |
| 11:30 - 12:00 | Kanstantsin Pashkovich: A strongly polynomial (2+ε)-approximation algorithm for network design problems defined by proper functions |
| 12:00 - 14:00 | Lunch break |
| 14:00 - 16:00 | Discussion session |
| 16:00 - 16:30 | Tea and cake / end of workshop |
Person |
Affiliation |
Period of stay |
| Ahmad Abdi | University of Waterloo | |
| Hyung-Chan An | EPFL | |
| Joergen Bang-Jensen | University of Southern Denmark | |
| Kristóf Bérczi | MTA-ELTE Egerváry Research Group | |
| Gruia Calinescu | Illinois Institute of Technology | |
| Chandra Chekuri | University of Illinois | |
| Victor Chepoi | Aix-Marseille Université | |
| William Cook | University of Waterloo | |
| Agnes Cseh | TU Berlin | |
| Friedrich Eisenbrand | EPFL | |
| Andreas Feldmann | MTA SZTAKI | |
| András Frank | Eotvos University Budapest | |
| Michel Goemans | MIT | |
| Corinna Gottschalk | RWTH Aachen | |
| Anupam Gupta | Carnegie Mellon University | |
| Stephan Held | Universität Bonn | |
| Hiroshi Hirai | The University of Tokyo | |
| Stefan Hougardy | Universität Bonn | |
| Nicolai Hähnle | Universität Bonn | |
| Marek Karpinski | Universität Bonn | |
| Ken-ichi Kawarabayashi | National Institute of Informatics | |
| Csaba Király | Eötvös University | |
| Tamás Király | Eötvös University Budapest | |
| Bernhard Korte | Universität Bonn | |
| Matthias Kriesell | Technische Universität Ilmenau | |
| Jochen Könemann | University of Waterloo | |
| Vivek Madan | University of Illinois Urbana-Champaign | |
| Wolfgang Mader | Universität Hannover | |
| S Thomas McCormick | Sauder School of Business, UBC | |
| Matthias Mnich | Universität Bonn | |
| Guyslain Naves | Aix-Marseille University | |
| Alantha Newman | CNRS | |
| Zeev Nutov | The Open University of Israel | |
| Neil Olver | VU University Amsterdam & CWI | |
| Gyula Pap | Eötvös University | |
| Kanstantsin Pashkovich | University of Waterloo | |
| Britta Peis | RWTH Aachen | |
| Matthias Poloczek | Cornell University | |
| Bruce Reed | McGill University | |
| Thomas Rothvoss | University of Washington | |
| Heiko Röglin | Universität Bonn | |
| Alexander Schrijver | University of Amsterdam | |
| András Sebo | CNRS | |
| Bruce Shepherd | McGill University | |
| David Shmoys | Cornell University | |
| Mohit Singh | Microsoft Corporation | |
| Zoltán Szigeti | Grenoble Institute of Technology | |
| Louis Theran | Aalto University | |
| Laszlo Vegh | London School of Economics | |
| Jens Vygen | Universität Bonn | |
| Felix Willamowski | RWTH Aachen | |
| Laurence Wolsey | CORE, Universite catholique de Louvain | |
| Rico Zenklusen | ETH Zurich | |
| Anke van Zuylen | College of William & Mary |