From owner-dma-list@NIC.SURFNET.NL Tue Jul 15 00:42:46 1997 Received: from CS.Stanford.EDU (CS.Stanford.EDU [171.64.64.64]) by robotics.Stanford.EDU (8.8.5/8.8.5) with ESMTP id AAA13943; Tue, 15 Jul 1997 00:42:46 -0700 (PDT) Received: from hearnnt.nic.surfnet.nl (hearnnt.nic.surfnet.nl [192.87.5.133]) by CS.Stanford.EDU (8.8.6/8.8.6) with ESMTP id AAA06876; Tue, 15 Jul 1997 00:42:44 -0700 (PDT) Received: from hearnnt (192.87.5.133) by hearnnt.nic.surfnet.nl (LSMTP for Windows NT v1.1a) with SMTP id <0.E6CA21E0@hearnnt.nic.surfnet.nl>; Tue, 15 Jul 1997 9:38:50 +0200 Received: from NIC.SURFNET.NL by NIC.SURFNET.NL (LISTSERV release 1.8c) with NJE id 8820 for DMA-LIST@NIC.SURFNET.NL; Tue, 15 Jul 1997 09:42:55 +0200 Received: from HEARN (NJE origin SMTP@HEARN) by HEARN.NIC.SURFNET.NL (LMail V1.2c/1.8c) with BSMTP id 9586; Tue, 15 Jul 1997 09:42:42 +0200 Received: from utmfu6.math.utwente.nl by HEARN.nic.SURFnet.nl (IBM VM SMTP V2R2) with TCP; Tue, 15 Jul 97 09:42:41 +0200 Received: from utmfu0.math.utwente.nl (utmou1.math.utwente.nl) by utmfu6.math.utwente.nl with ESMTP (1.40.112.8/16.2) id AA071662525; Tue, 15 Jul 1997 09:42:07 +0200 Received: by utmfu0.math.utwente.nl ($Revision: 1.36.108.11 $/16.2) id AA033762515; Tue, 15 Jul 1997 09:41:56 +0200 Mailer: Elm [revision: 66.36.1.1] Approved-By: DMANET Message-ID: <199707150741.AA033762515@utmfu0.math.utwente.nl> Date: Tue, 15 Jul 1997 09:41:55 METDST Reply-To: italiano@dsi.unive.it Sender: DMANET From: DMANET Subject: WAE 97 - Accepted papers and Registration Form To: DMA-LIST@NIC.SURFNET.NL X-Mozilla-Status: 0001 Content-Length: 5122 ========================================================================= Workshop on Algorithm Engineering Venice, 11-13 September 1997 List of accepted papers and registration form ========================================================================= Augment or push? A computational study of bipartite matching and unit capacity maximum flow algorithms, B. V. Cherkassky, A. V. Goldberg, P. Martin and J. C. Setubal Greedy Matching Algorithms, an Experimental Study, J. Magun Efficient, adaptable implementations of graph algorithms, D. Kuel, M. Nissen and K. Weihe Experimental analysis of dynamic algorithms for the single source shortest path problem, D. Frigioni, M. Ioffreda, U. Nanni and G. Pasqualone A first experimental study of a dynamic transitive closure algorithm, T. Miller and C. Zaroliagis Practical performance of efficient minimum cut algorithms M. Juenger, G. Rinaldi and S. Thienel Reactive Local Search for Maximum Clique, R. Battiti and M. Protasi A discrete neural algorithm for the maximum clique problem, A. Bertoni, P. Campadelli and G. Grossi Implementing Radixsort, A. Andersson and S. Nilsson Implementations of dynamic tree collections based on splay trees, T. Radzik Early experiences in implementing the buffer tree, D. Hutchinson, A. Maheswari, J. Sack and R. Velicescu AGD--Library: A Library of Algorithms for Graph Drawing, D. Alberts, C. Gutwenger, P. Mutzel and S. Naeher LEONARDO: a software visualization system, P. Crescenzi, C. Demetrescu, I. Finocchi and R. Petreschi Ice rinks and cruise missiles: sweeping a simple polygon, B. Moret, M. Collins, J. Saia and L. Yu A case study on algorithm engineering for geometric computing, J. Baker, R. Tamassia and L. Vismara A robust and efficient implementation of a sweep line algorithm for the straight line segment intersection problem U. Bratuschka, K. Mehlhorn and S. Naeher The architecture of a software library for string processing, A. Czumaj, P. Ferragina, L. Gasieniec, S. Muthukrishnan and J. Traeff A Vertex-to-Vertex Parallel Radiosity on a Cluster of PCs, A. Bar-Lev, A. Itzkovitz, A. Raviv and A. Schuster Fast compression state lookup of Internet packet headers, B. Nordgren and M. Sundstrom Computing Groebner Bases in the Boolean Setting with Applications to Counting, A. Bernasconi, B. Codenotti, V. Crespi and G. Resta Data Structure for Solving Programming Problems Concerning Segments in a Sequence, Y. Futamura, C. Shirai, Y. Liu and N. Futamura Database learning: a method for empirical algorithm design, M. Goldberg and D. Hollinger ========================================================================= WAE'97 REGISTRATION FORM Please fill in the registration form and send it either by email or fax to: Giuseppe F. Italiano, WAE 97 Dipartimento di Matematica Applicata e Informatica Universita' "Ca' Foscari" di Venezia Via Torino 155 30173 Venezia Mestre, Italy Email: italiano@dsi.unive.it Fax: +39 41 2908419 Last name __________________________ First name __________________________ Affiliation _______________________________________________________________ Address ___________________________________________________________________ ___________________________________________________________________________ Zip code ____________________ City ______________________________________ Country ___________________________________________________________________ Tel ________________________________ Fax ________________________________ E-mail ____________________________________________________________________ Dietary restrictions (vegetarian) _________________________________________ I need extra banquet tickets (number) _____________________________________ Accompanying person(s) Last name __________________________ First name __________________________ REGISTRATION FEES quoted in Italian lire (LIT). Registration fee (*) LIT 300,000 (_) Student (**) LIT 120,000 (_) Extra banquet ticket LIT 150,000 (_) Total payment to be made on site ___________ (*) Full registration fees include participation in the scientific sessions, the abstract booklet, coffee breaks and the social program. (**) Students must certify their status. Student's fee includes participation in the scientific sessions, the abstract booklet and the coffee breaks. PAYMENT All payments must be in Italian lire and can be made on-site. Please note that only cash will be accepted. -- ****************************************************** Contributions to be spread via DMANET are submitted to DMANET@math.utwente.nl Replies to a message carried on DMANET should NOT be addressed to DMANET but to the original sender. The original sender, however, is invited to prepare an update of the replies received and to communicate it via DMANET. DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)