Mon., 30.03. 

Tue., 31.03. 

Wed., 01.04. 

9:00 - 9:45 

Spanning Trees and Steiner Trees 

(Chen)

Maximum Flows 

(Chen)

9:45 - 10:30 

Introduction to  

“Mathematics of Chip Design” 

(Korte)

Steiner Trees in Routing 

(Vygen)

Minimum Cost Flows 

(Chen)

- Tea break - 

11:00 - 11:45 

Shortest Path 

(Chen)

Minimum-Mean-Cycle and Cycle Time Optimization 

(Korte)

Detailed Routing 

(Vygen)

11:45 - 12:30 

Design Flow and BonnTools 

(Held)

Bonn Clock 

(Massberg)

Multisection 

(Brenner)

-Lunch break - 

14:15 - 14:45 

Data Models of Chip Design 

(Muuss)

Design Rules and Objectives 

(Peyer)

Quadratic Programming 

(Struzyna)

14:45 - 15:15 

Optimal Beamforming Design

(Yafeng Liu) 

Approximation Algorithms for Constructing Minimum Manhattan Network

(He Sun)  

A Monotone Projected Gradient Algorithm for Singly Linearly Constrained Quadratic Programs Subject to Lower and Upper Bounds

(YunShan Fu)  

-Tea break - 

15:45 - 16:45 

computer exercises: data models 

computer exercises: timing analysis 

computer exercises: placement 

Thu., 02.04. 

Fri., 03.04. 

Sat., 04.04. 

9:00 - 9:45 

Skewed Clock Trees 

(Korte)

Data Structures,  

Search Trees and Heaps 

(Zhang)

Resource Sharing 

(Vygen)

9:45 - 10:30 

Multicommodity Flows 

(Chen)

Repeater Trees 

(Rautenbach)

NP-Completeness and  

Approximation Algorithms 

(Zhang)

- Tea break - 

11:00 - 11:45 

Linear Programming 

(Nieberg)

Global Routing 

(Vygen)

Gate Sizing 

(Rautenbach)

11:45 - 12:30

Time-Cost Tradeoff Problem 

(Held)

Capacity Estimation in Global Routing 

(Mueller)

Variation-Aware Clock Trees 

(Massberg)

- Lunch break - 

14:15 - 14:45 

Geometric Data Structures  

and Algorithms 

(Gester)

Design for Manufacturability 

(Schulte)

Buffering Algorithms 

(Bartoschek)

14:45 - 15:15 

Some Geometric Problems in GIS

(Jun Luo)

Vehicle Routing Problems and Vehicle Scheduling Problems on a Line--Complexity and Approximation 

(Wei Yu)

Wire Segmenting for Buffer Insertion Based on RSTP-MSP 

(Weidong Ma)

- Tea break - 

15:45 - 16:45 

computer exercises: clocktree synthesis 

computer exercises: global routing 

computer exercises: timing optimization 

Mon., 06.04. 

Tue., 07.04. 

Wed., 08.04. 

9:00 - 9:45 

Floor Planning 

(Hougardy)

Facility Location 

(Zhang)

Clustering 

(Hougardy)

9:45 - 10:30 

Dynamic Programming, Knapsack  

and Bin Packing 

(Zhang)

Timing Closure 

(Rautenbach)

Convex Programming  

and Lagrangian Relaxation 

(Zhang)

-Tea break - 

11:00 - 11:45 

Logic Optimization 

(Rautenbach)

Global Placement 

(Hougardy)

Detailed Placement 

(Hougardy)

11:45 - 12:30

Pin-Access in Routing 

(Nieberg)

Routing Data Structures 

(Mueller)

Congestion- and Timing-Driven Placement 

(Brenner)

- Lunch break - 

14:15 - 14:45

Macro Placement 

(Schneider)

Parallel Gridless Routing 

(Panten)

Shortest Paths in Detailed Routing 

(Humpola)

14:45 - 15:15 

Caching on Directed Acyclic Graph 

(Haifeng Xu)

An Approximation Algorithm for the k-Level Capacitated Facility Location Problem  

(Xing Wang) 

Lower Bound Methods for 0-1 Linear  Constrained Quadratic Programming 

(Cheng Lu)

- Tea break - 

15:45 - 16:45 

computer exercises: macro placement 

computer exercises: detailed routing 

computer exercises: final optimization