ALENEX00: Preliminary Program
FRIDAY, JANUARY 7.
8:00 -- 12:00 Registration
BREAKFAST served starting at 8:10 (fruit, pastries, juices, coffee and tea)
8:50 Opening remarks
SESSION 1 Applications Chair: Roberto Battiti
9:00 -- 9:30 A network-flow-based scheduler: design, performance history,
and experimental analysis,
H. Gabow and T. Kohno
9:30 -- 10:00 Caching and scheduling for broadcast disk systems,
V. Liberatore
10:00 -- 10:30 Force-directed methods for mesh improvement,
H. Djidjev
10:30 -- 11:00 Protecting critical facets in layered manufacturing:
implementation and experimental results,
J. Schwerdt, M. Smid, R. Janardan, and E. Johnson
BREAK (coffee, tea)
SESSION 2 Tutorial Chair: Bernard Moret
11:15 -- 12:15 Data Analysis for Algorithm Experiments
Catherine McGeoch
LUNCH (on your own)
SESSION 3 Work in Progress Chair: Clifford Stein
2:00 -- 2:30 An experimental study of polylogarithmic fully-dynamic
connectivity algorithms,
R. Iyer, D. Karger, H. Rahul, and M. Thorup
2:30 -- 3:00 Experimental study of a solution method for
the multicommodity flow problem,
T. Radzik
3:00 -- 3:30 Experiments on curve reconstruction,
E. Althaus, K. Mehlhorn, S. Naeher, and S. Schirra
BREAK (coffee, tea, sodas)
SESSION 4 Panel Chair: Bernard Moret
3:45 -- 4:45 Panel: Algorithms and data repositories / Directions
in algorithm engineering
SESSION 5 Software Demos Chair: Cenk Sahinalp
4:50 -- 5:30 GeoWin: A Generic Tool for the Interactive Visualization of
Geometric Algorithms
S. Naeher
5:30 -- 6:00 Leonardo, an integrated environment for developing and
animating programs,
C. Demetrescu and I. Finocchi
*******************************************************************************
SATURDAY, JANUARY 8.
BREAKFAST served starting at 8:10 (fruit, pastries, juices, coffee and tea)
SESSION 6 Caching, Parallelism, and Strings
Chair: Clifford Stein
9:00 -- 9:30 An improved randomized selection algorithm
with an experimental study,
David Bader
9:30 -- 10:00 Adapting radix sort to the memory hierarchy,
Naila Rahman and Rajeev Raman
10:00 -- 10:30 A learning algorithm for the longest common subsequence problem,
E. Breimer, Mark Goldberg, and D. Lim
10:30 -- 11:00 Algorithms and experiments on transitive closure, path cover,
and multiple sequence alignment,
S. Abdeddaim
BREAK (coffee, tea)
SESSION 7 Invited Address Chair: Andrew Goldberg
11:15 -- 12:15 CPLEX: what's in, what's out
Robert Bixby
CPLEX is a commercial software package for solving linear
and mixed-integer programming problems. It is "high-performance"
software whose position in the marketplace depends upon its
ability to solve customer optimization problems.
We will discuss how the performance of new features, new
implementations, and the overall code are measured.
In short: how we decide what's in and what's out.
LUNCH (on your own)
SESSION 8 Graphs and Geometry
Chair: Peter Yianilos
2:00 -- 2:30 Break the "right" cycles and get the "best" drawing,
C. Demetrescu and I. Finocchi
2:30 -- 3:00 General-purpose spatial decomposition algorithms:
experimental results,
S. Tate and K. Xu
3:00 -- 3:30 Experiments with computing geometric minimum spanning trees,
G. Narasimhan, M. Zachariasen, and J. Zhu
3:30 -- 4:00 I/O-efficient algorithms for problems on grid-based terrains,
Lars Arge, L. Toma, and Jeff Vitter
BREAK (coffee, tea, sodas)
4:15 -- 4:30 CATS update, WAE00, Dagstuhl seminar, other announcements
BUSINESS MEETING
4:30 -- 5:15 o PC report
o Steering Committee elections
o ALENEX future
o Future ALENEX format