Algorithms and Experiments (ALEX98)
Building bridges between theory and applications
Trento, Italy, February 9 - 11, 1998
Background material from invited speakers (in preparation)
Background materials related to the talks will be placed
in this pages as soon as they are received from the speakers.
- Invited talk:
Peter Widmayer (ETH Zurich, Switzerland)
"Distributed data structures - concepts and design choices"
- Invited talk:
Rainer E. Burkard (Technische Universitaet Graz, Austria)
"Fast algorithms for obnoxious location problems"
- Invited talk:
Panos Pardalos (University of Florida, USA)
"Heuristics for Large Max Clique Problems Based on Continuous Approaches"
- Invited talk:
Prabhakar Raghavan (IBM Almaden, USA)
"Mining information networks: the CLEVER project at IBM Almaden"
"Fast algorithms for obnoxious location problems"
- Invited talk:
Catherine McGeoch (Amherst College, USA)
"Open Problems in Experimental Analysis of Algorithms"
- Invited talk:
Afonso Ferreira (CNRS, LIP-ENS, Lyon, France)
"Discrete algorithms: practical and efficient, although parallel"
- Invited talk:
Silvano Martello (University of Bologna, Italy)
"Two- and Three-Dimensional Bin Packing Problems"
- Invited talk:
Maurizio Bonuccelli (University of Pisa, Italy)
"Packet Scheduling in Single-Hop Communication Systems"
- Invited talk:
Dorit Hochbaum (Berkeley, USA)
"A new algorithm and a new simplex algorithm for the maximum flow
problem based on an old algorithm for the open pit mining problem."
Back to ALEX98 home page.