NHC 2005 Slides
Workshop
Date : 
Feb. 28  Mar. 3, 2005, 
Place : 
Kyoto Royal Hotel, Kyoto, Japan 
>> Details 
Invited Talks
February 28 (Monday)

``Fast and Sensitive Homology Search''
Ming Li
(University of Waterloo)
[ Powerpoint ] /
[ PDF ]

``Dynamic graph algorithms with applications''
Mikkel Thorup
(AT&T)
[ PDF ]

``Approximation Algorithms for Stochastic Combinatorial Optimization''
R. Ravi
(Carnegie Mellon University)
[ Powerpoint ] /
[ PDF ]

``More approximation algorithms for stochastic programming problems''
David Shmoys
(Cornell University)
[ Powerpoint ] /
[ PDF ]

``Efficient Haplotype Inference on Pedigrees and
Applications in Gene Association Mapping''
Tao Jiang
(UC Riverside)
[ Powerpoint ] /
[ PDF ]

``New Horizons in Machine Learning''
Avrim Blum
(Carnegie Mellon University)
[ Powerpoint ] /
[ PDF ]
(TexPoint is required for reading the Powerpoint file.)

``Rigorous Analysis of Heuristics for NPhard Problems''
Uriel Feige
(Weizmann Institute)
[ Powerpoint ] /
[ PDF ]
March 1 (Tuesday)

``Data Stream Algorithms in Computational Geometry''
Timothy Chan
(University of Waterloo)
[ PDF ]

``Steps into Computational Algebraic Topology''
Herbert Edelsbrunner
(Duke University)
[ Powerpoint ] /
[ PDF ]
March 2 (Wednesday)

``Algorithms for Modern Memory Systems''
Martin FarachColton
(Rutgers University)

``Data Stream Algorithms and Applications''
Shan Muthukrishnan
(Rutgers University)

``On Computing all Abductive Explanations from
a Propositional Horn Theory''
Kazuhisa Makino
(Osaka University)
[ Powerpoint ] /
[ PDF ]

``How to Influence Noncooperative, Selfish Agents''
Lisa Fleischer
(IBM)

``Metric Labeling: Upper and Lower Bounds''
Seffi Naor
(Technion)
[ PDF ]

``Approximate distance oracles and spanners with
sublinear error terms''
Uri Zwick
(TelAviv University)
[ Powerpoint ] /
[ PDF ]
March 3 (Thursday)

``The walkers problem: On the cycle and the grid''
Josep Diaz
(Universitat Politecnica de Catalunya)
[ Powerpoint ] /
[ PDF ]

``Connectivity and information transfer in social networks''
Richard Cole
(New York University)

``Approximation Algorithms for Network Problems''
Susanne Albers
(University of Freiburg)
[ PDF ]

``Generalized linear programming''
Jiri Matousek
(Charles University)
[ PowerPoint ]
(Link to his web site)

``My Favorite Ten Complexity Theorems of the Past Decade II''
Lance Fortnow
(University of Chicago)
[ Powerpoint ] /
[ PDF ]

``Some Heuristic Analysis of
Average Behavior of Local Search Algorithms''
Osamu Watanabe
(Tokyo Institute of Technology)
[ PDF ]
Short Talks
March 1 (Tuesday)

``Efficient Algorithms for the Longest Path Problem''
Ryuhei Uehara
(JAIST)
[ Powerpoint ] /
[ PDF ]

``Improved Approximation Algorithms for Metric Max TSP''
Z.Z. Chen
(Tokyo Denki University)

``Proposal of Asynchronous Distributed Branch and Bound''
Shigeru Masuyama
(Toyohashi University of Technology)
[ Powerpoint ] /
[ PDF ]

``EnergyOptimal Online Algorithms for Broadcasting
in Wireless Networks''
Hirotaka Ono
(Kyushu University)
[ Powerpoint ] /
[ PDF ]

``Siteoriented Framework for Mining Communities on the Web''
Yasuhiro Asano
(Tohoku University)

``On RightHandontheWall Traversal of Graphs''
Kunihiko Sadakane
(Kyushu University)

``Distributing Distinct Integers Uniformly over a
Square Matrix with Application to Digital Halftoning''
Tetsuo Asano
(JAIST)

``Ultimate Implementation and Analysis of the AMO Algorithm
for Pricing EuropeanAsian Options''
Akiyoshi Shioura
(Tohoku University)
[ PDF ]
© The Copyrights for the PowerPoint / PDF files
are owned by their authors.