Conference Programs SUNDAY, JUNE 14 6:30 - 8:30 PM, Reception MONDAY, JUNE 15 8:45 AM Welcome SESSION 1 (Applications) 9 AM - 10:40 AM Andrew Byde, Terence Kelly, Yunhong Zhou and Robert Tarjan. Efficiently Generating k Best Solutions to Winner Determination Problems Jacob Howe, Philip Charles and Andy King. Integer Polyhedra for Program Analysis Yam Ki Cheung and Ovidiu Daescu. Line Segment Facility Location in Weighted Subdivisions Marek Chrobak and Jiri Sgall. Three Results for Frequency Assignment in Linear Cellular Networks BREAK 10:40 - 11 AM INVITED TALK, Andrei Z. Broder 11 AM - 12 AM Algorithmic Challenges in Computational advertising LUNCH 12 NOON - 1:45 PM SESSION 2 (Algorithms) 1:50 PM - 3:30 PM Andrew Goldberg. Two Level Push-Relabel Algorithm for the Maximum Flow Problem LI YAN, Marek Chrobak and Francis Chin. Algorithms for the Flow Monitors Problem Atlas F. Cook IV and Carola Wenk. Link Distance and Shortest Path Problems in the Plane Amin Saberi and Ying Wang. Cutting a cake for five people BREAK 3:30 PM - 4 PM SESSION 3 (Approximation Algorithms) 4 PM - 5:40 PM Tim Nonner and Alexander Souza. Latency Constrained Aggregation in Chain Networks Admits a PTAS Mary Ashley, Tanya Berger-Wolf, Wanpracha Chaovalitwongse, Bhaskar DasGupta, Ashfaq Khokhar and Saad Sheikh. On Approximating An Implicit Cover Problem in Biology Feifeng Zheng, Yinfeng Xu and C.K. Poon. On job scheduling with preemption penalties John Abraham, Zhixiang Chen, Richard Fowler, Bin Fu and Binhai Zhu. On the Approximability of Some Haplotyping Problems CONFERENCE DINNER 7 PM -- late TUESDAY, JUNE 16 SESSION 4 (Math. Programming) 8:35 AM - 10:40 AM Jon Lee, Shmuel Onn and Robert Weismantel. Nonlinear Optimization over a Weighted Independence System Changxing Dong, Gerold Jaeger, Dirk Richter and Paul Molitor. Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy and Alejandro Strejilevich de Loma. Discrete Online TSP Fei Li. Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers Jie Zhang and Xiaotie Deng. Equiseparability on Terminal Wiener Index BREAK 10:40 AM - 11 AM INVITED TALK, Edward Chang 11 AM - 12 AM Parallel Algorithms for Collaborative Filtering LUNCH 12 NOON - 1:45 PM SESSION 5 (Game Theory) 1:50 PM - 3:30 PM Daniel Andersson, Vladimir Gurvich and Thomas Dueholm Hansen. On Acyclicity of Games with Cycles Esteban Feuerstein, Pablo Heiber, Matias Lopez-Rosenfeld and Marcelo Mydlarz. Optimal Auctions Capturing Constraints in Sponsored Search Scott Kominers. Dynamic Position Auctions with Consumer Search Haris Aziz, Oded Lachish, Mike Paterson and Rahul Savani. Power indices in spanning connectivity games BREAK 3:30 PM - 4 PM SESSION 6 (Clustering and Search) 4 PM - 5:40 PM Daniel Delling, Robert G ¯ ¡ ¡ örke, Christian Schulz and Dorothea Wagner. ORCA Reduction and ContrAction Graph Clustering Jiong Guo, Christian Komusiewicz, Rolf Niedermeier and Johannes Uhlmann. A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing Yi Wang, Hongjie Bai, Matt Stanton, Wen-Yen Chen and Edward Y Chang. PLDA: Parallel Latent Dirichlet Allocation for Large-scale Applications Sumit Ganguly. A note on estimating hybrid frequency moment of data streams: p in [0,1] and q in [0,1] FINISH-UP 5:40 PM -- 6 PM WEDNESDAY, JUNE 17 No program scheduled, free activity. |