1. Rolf Niedermeier and Peter Rossmanith
   On efficient fixed-parameter algorithms for weighted vertex cover
2. Nodari Vakhania
   A better algorithm for sequencing with release and delivery times on identical machines
3. Iris Gaber and Yishay Mansour
   Centralized broadcast in multihop radio networks
4. Jeet Chaudhuri, Subhas C. Nandy and Sandip Das
   Largest empty rectangle among a point set
5. Noga Alon and Asaf Shapira
   Testing satisfiability
6. C. S. Helvig, Gabriel Robins and Alex Zelikovsky
   The moving-target traveling salesman problem*1
7. Thomas Erlebach and Frits C. R. Spieksma
   Interval selection: Applications, algorithms, and lower bounds
8. Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi and Aravind Srinivasan
   Wavelength rerouting in optical networks, or the Venetian Routing problem
9. Piotr Berman, Bhaskar DasGupta and S. Muthukrishnan
   Approximation algorithms for MAX-MIN tiling
10. Ulrich Meyer
    Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds*1
    
    
    

Your institute needs to subscribe to ScienceDirect to be able to access the full text.

This email has been sent to you dasgupta@cs.uic.edu by Elsevier B.V., Sara Burgerhartstraat 25, 1055 AK Amsterdam, The Netherlands, using Bluestreak, Inc.’s IonMail Center technology and platform. To ensure delivery to your inbox (not bulk or junk folders), please add maths@elsevier-alerts.com to your address book. You are receiving this e-mail because you are registered as an author of an article published in an Elsevier Mathematics Journal in the belief that it will be of interest to you.
To unsubscribe from receiving e-mails in the future, visit Remove link and click on the submit button.
If you wish to receive text messages instead of HTML, please click here.
Elsevier respects your privacy and does not disclose, sell or rent your personal information to any non-affiliated third parties without your consent, except as may be stated in the Elsevier Privacy Policy.
For all enquiries, problems or suggestions regarding this service, please contact: mcs@Elsevier.com. For Bluestreak, Inc.’s Privacy Policy, visit Bluestreak Privacy Policy.
©, 2004 Elsevier Ltd. All rights reserved. Any unauthorized use, reproduction or transfer of this message or its contents, in any medium is strictly prohibited.