From pin_yang at qub.ac.uk Sun Dec 2 01:00:27 2001 From: pin_yang at qub.ac.uk (Ang Pin Yang) Date: Mon Jan 9 13:41:03 2006 Subject: ACIS - parameters on a spherical surface Message-ID: Hello all, I am having a problem in using ACIS geometric modelling package. Hope you all can enlighten me. >From what I know, when a CAD spherical surface is exported to ACIS format (*.sat), ACIS will use the surface's orthogonal circumcircles (both with the sphere center as its center) as the u and v axis (u,v serve as the parameters). My problem is, if I got a {u,v} coordinate, and I want to find the corresponding 3D position on this spherical surface. The ACIS interface will, occasional, return a point which is not at the expected location, because there are two points on this surface have the same {u,v} value. Can anyone please tell me how to handle this problem? Thanks a lot. Regards, Pin Yang --------------------------------------------------------------------------- Ang Pin Yang Finite Element Modeling Group School of Mechanical & Manufacturing Engineering The Queen's University of Belfast Ashby Building Stranmillis Road Belfast BT9 5AH Northern Ireland United Kingdom Tel: +44 02890 274277 http://sog1.me.qub.ac.uk/members/pin_yang/pin.html ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From pjk at kie.ae.poznan.pl Sun Dec 2 18:25:00 2001 From: pjk at kie.ae.poznan.pl (Pawel Jan Kalczynski) Date: Mon Jan 9 13:41:03 2006 Subject: BIS 2002 Conference Call for Papers (deadline Dec. 15, 2001) Message-ID: <200112021725.SAA13269@hermes.kie.ae.poznan.pl> Attached to this message, please find the Call for Papers for the 5th International Conference on Business Information Systems BIS 2002 to be held in Poznan, Poland late in April. Also, please let me interest you with two workshops and nine special sessions organized within the framework of BIS 2002. CfPs for workshops and special sessions are available on the conference website at http://bis.kie.ae.poznan.pl. Kind regards, Pawel Jan Kalczynski BIS2002 Organizing Committee ---------------------------------------- The Poznan University of Economics Department of Computer Science Tel +48 61 8569333 Fax +48 61 8569334 E-mail: pjk@kie.ae.poznan.pl =================================================== Call for Papers =================================================== 5TH INTERNATIONAL CONFERENCE ON BUSINESS INFORMATION SYSTEMS BIS 2002 Poznan, Poland April 24-25, 2002 http://bis.kie.ae.poznan.pl http://bis2002.kie.ae.poznan.pl --------------------------------------------------- submission deadline: December 15, 2001 --------------------------------------------------- TRACKS ? Business Intelligence ? Filtering ? E-business ? Process ORGANIZERS ? The Poznan University of Economics, Poland SUPPORTERS ? CEPIS ? The Council of European Professional Informatics Societies ? GI ? Gesellschaft f?r Informatik ? ISCA ? International Society for Computers and Applications, USA ? NTIE ? Scientific Society of Economic Informatics, Poland TOPIC OF INTEREST BIS 2002 International Conference invites researchers and practitioners to submit papers that contribute the results of research in business information systems as well as papers that report on industrial IT projects. The Program Committee particularly encourages presentations of practical papers on industrial experience or on the validation of prototype implementations. Topics are restricted by the scope of the conference as defined above and they include inter alia: ? Business Intelligence Track: Knowledge Management, Data Warehousing, Data Mining, Knowledge Discovery, Decision Support Systems, Integration of Information Systems, Web Warehousing, Web Mining, Balanced Scorecard ? Filtering Track: Information Filtering, Adaptive Filtering, Collaborative Filtering, Web Filtering, Knowledge Representation for Filtering, Textual and Multimedia Information Management Systems ? E-Business Track: electronic transactions and banking, commerce and payments on the Internet, standards, protocols, communication systems, virtual organizations, marketplaces, CRM ? Process Track: process-oriented organizations, workflow, information flow. WORKSHOPS ? Business Applications of Virtual Reality Wojciech Cellary (cellary@kti.ae.poznan.pl) ? WOOBS 2002 - Object-Oriented Business Solutions Rafael Corchuelo (corchu@lsi.us.es) SPECIAL SESSIONS ? Corporate Learning Solutions Torsten Schmale (Torsten.Schmale@inubit.com) ? Data Warehousing and Information Logistics Robert Winter (Robert.Winter@unisg.ch) ? Economic Models for Information Retrieval and Filtering in the Web Environment Richard Bonner (richard.bonner@mdh.se) ? Geo-business Information System Marcin Paprzycki (marcin@a.cs.okstate.edu) ? Knowledge Management Henry Linger (frada.burstein@sims.monash.edu.au) ? Language Technology for Business Information Systems Jakub Piskorski (piskorsk@dfki.de) ? Mobile e-Business Stephanie Teufel (stephanie.teufel@unifr.ch) ? Pan-European Legal Information Systems Erich Schweighofer (erich.schweighofer@univie.ac.at) ? Socio-Cognitive Engineering in the Modelling of Business Intelligence Andrzej Straszak (Andrzej.Straszak@ibspan.waw.pl) SUBMISSION CATEGORIES ? Long papers up to 5000 words ? Work-in-progress papers up to 2500 words SUBMISSION GUIDELINES Submission guidelines may be found at http://bis2002.kie.ae.poznan.pl/5_guidelines.htm +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ IMPORTANT DATES Dec. 15, 2001 submission deadline for long and work-in-progress papers Feb. 15, 2002 notification of acceptance/rejection Mar. 15, 2002 submission of final papers after correction Apr. 24-25, 2002 the conference +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ GENERAL CHAIR Witold Abramowicz - The Poznan University of Economics, Poland, (W.Abramowicz@kie.ae.poznan.pl) PROGRAM COMMITTEE ? Marcin Paprzycki (special sessions coordinator) - Oklahoma State University, USA (marcin@a.cs.okstate.edu) ? Hans-Juergen Appelrath - University of Oldenburg, Germany ? Andrzej Baborski - University of Economics in Wroc?aw, Poland ? Ken Barker - University of Calgary, Canada ? Ryszard Bonner - M?lardalen University, Sweden ? Hans-Dieter Burkhard - Humboldt University, Germany ? Wojciech Cellary - The Pozna? University of Economics, Poland ? David Cheung - The University of Hong Kong, China ? Witold Chmielarz - Warsaw University, Poland ? Peter Dadam - University of Ulm, Germany ? Manoranjan Dash - National University of Singapore, Singapore ? Marek Fertsch ? Technical University of Pozna?, Poland ? Andrzej Gospodarowicz - University of Economics in Wroc?aw, Poland ? Adam Grzech - Technical University of Wroc?aw, Poland ? Zdzis?aw Hippe - University of Information Technology and Management, Poland ? Lech Janczewski - University of Auckland, Australia ? Janusz Kacprzyk - Polish Academy of Sciences, Poland ? Dimitris Karagiannis - Universit?t Wien, Austria ? Jerzy Kisielnicki - Warsaw University, Poland ? Gary Klein - The University of Colorado at Colorado Springs, USA ? Stanislaw Krzy?aniak - Institute of Logistics and Warehousing, Poland ? Bernard Kubiak - University of Gdansk, Poland ? Henry Linger - Monash University, Australia ? Peter C. Lockemann - University of Karlsruhe, Germany ? Leszek Maciaszek - Macquarie University, Australia ? Heinrich C. Mayr - University Klagenfurt, Austria ? Jan Mrazek - Bank of Montreal, Canada ? Marian Nied?wiedzi?ski - University of Lodz, Poland ? Roumen Nikolov - Sofia University, Bulgaria ? Jorgen Fischer Nilsson - Technical University of Denmark, Denmark ? Mitsunori Ogihara - University of Rochester, USA ? Maria Orlowska - The University of Queensland, Australia ? Mike Papazoglou - University of Tilburg, Holland ? Witold Pedrycz - University of Alberta, Canada ? Jaroslav Pokorn? - Charles University of Prague, Czech Republic ? V?clav ?epa - VSE Praha, Czech Republic ? August-Wilhelm Scheer - University of Saarland, Germany ? Erich Schweighofer - University of Vienna, Austria ? Evgueni Solojentsev - IPMASH RAN, Russia ? Janusz Stok?osa - Technical University of Pozna?, Poland ? Stephanie Teufel - University of Fribourg, Switzerland ? A Min Tjoa - Vienna University of Technology, Austria ? Jacek Unold - University of Economics in Wroc?aw, Poland ? Joseph E. Urban - Arizona State University, USA ? Thad Usowicz - San Francisco State University, USA ? Roland Wagner - University of Linz, Austria ? Robert Winter - University of St. Gallen, Switzerland ? Viacheslav E. Wolfengagen - JMSUICE, Russia ? Xindong Wu - Colorado School of Mines, USA ? Ronald R. Yager - Iona College, USA ? S?awomir Zadro?ny - Polish Academy of Sciences, Poland ? Mohammed J. Zaki - Rensselaer Polytechnic Institute, USA ? Jozef Zurada - University of Louisville, USA ORGANIZING COMMITTEE Andrzej Bassara, Agata Filipowska, Karol Ginter, Grzegorz Glowacki, Tomasz Jakubowski, Tomasz Kaczmarek, Pawel Jan Kalczynski, Marek Kowalkiewicz, Malgorzata Miklas-Kalczynska, Jolanta Skorwider, Krzysztof Wecel, Marek Wisniewski IMPORTANT ADDRESSES ? For submissions: bis2002@kie.ae.poznan.pl ? For information on special sessions: marcin@a.cs.okstate.edu (Marcin Paprzycki) ? For information on submission/proceedings: pjk@kie.ae.poznan.pl (Pawel Jan Kalczynski) ? For information on payment/accommodation: bis2002orgcom@kie.ae.poznan.pl ? For reviewers: kaw@kie.ae.poznan.pl (Krzysztof Wecel) ? Registration and general information: http://bis.kie.ae.poznan.pl PROGRAM COMMITTEE The Poznan University of Economics Department of Computer Science Al. Niepodleglosci 10 60-967 Poznan, Poland phone: +48/61/ 856 93 33 fax: +48/61/ 856 93 34 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From emo at inf.ethz.ch Wed Dec 5 17:47:35 2001 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:41:03 2006 Subject: Ph.D. Scholarships, CGC Berlin-Zurich Message-ID: <200112051647.RAA17631@blabla.inf.ethz.ch> Scholarships - Call for Applications Berlin-Zurich CGC Graduate Program Combinatorics, Geometry, and Computation http://www.cgc.ethz.ch The Berlin-Zurich Graduate Program "Combinatorics, Geometry, and Computation" offers scholarships for Ph.D. students for 2 1/2 years starting April 2002. The program is a joint initiative of ETH Zurich, the three universities of Berlin - Free University, Technical University, Humboldt-University - and the Konrad-Zuse-Research Center. Scholarships are up to DM 2'870 (tax-free) per month in Berlin, and roughly CHF 36'000 (pre-tax) per year in Zurich. The scientific program ranges from theoretical foundations to applications. The areas of research are combinatorics, geometry, computer graphics, optimization, algorithms and computation, and vision. Supervisors in Berlin are Aigner, Alt, Rote, Schulz (FU), Möhring, Ziegler (TU), Prömel (HU) and Grötschel (ZIB), and at ETH Zurich Erlebach, Van Gool, M. Gross, Lüthi, Nievergelt, Schiele, Székely, Welzl and Widmayer. Applications with curriculum vitae, copies of certificates, thesis, a letter of recommendation of the last advisor, and a brief description of the proposed research should be sent in by January 31, 2002 (if you apply for both sites, please indicate this in your letter): Prof. Helmut Alt Prof. Emo Welzl Institut Informatik Institut Theoretische Informatik Freie Univ. Berlin ETH Zentrum Takustr. 9 CH-8092 Zurich D-14195 Berlin Switzerland Germany Contact: bfelsner@inf.fu-berlin.de cgc.graduate@inf.ethz.ch www.inf.fu-berlin.de/gk-cgc http://www.cgc.ethz.ch ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From sanders at mpi-sb.mpg.de Tue Dec 11 17:11:37 2001 From: sanders at mpi-sb.mpg.de (Peter Sanders) Date: Mon Jan 9 13:41:03 2006 Subject: Postdoc at MPI for Computer Science - Algorithms Group Message-ID: <15382.12345.15887.288521@gargle.gargle.HOWL> P O S T D O C P O S I T I O N S at the M A X - P L A N C K - I N S T I T U T E for C O M P U T E R S C I E N C E The Max-Planck-Institute for Computer Science is located on the campus of the Universit"at des Saarlandes in Saarbr"ucken, Germany. The institute was founded in 1990 and consists of three research units: Algorithms and Complexity, Logic of Programming, Bioinformatics, and Computer Graphics. The research group ALGORITHMS AND COMPLEXITY offers a number of postdoctoral fellowships and research associate positions for the year 2002/2003. We are looking for applicants from all areas of algorithmics, e.g., data structures, complexity theory, graph algorithms, approximation algorithms, parallel, distributed, external, online, probabilistic or geometric algorithms, integer programming and constraint programming, and design and implementation of algorithm libraries. The group consists mainly of young researchers of several nationalities. Our working language is English. The group collaborates with several of the major research institutions in Europe and USA and has a high international visibility. There is generous travel support available for all group members. Applications (including curriculum vitae, list of publications, URLs of two selected publications (or postscript or hardcopy) research plan, names of references with their e-mail addresses, and intended period of stay) should be sent by February 8, 2002 to Petra Mayer Max-Planck-Institut f"ur Informatik Stuhlsatzenhausweg 85 66123 Saarbr"ucken Germany Electronic applications (email to mayer@mpi-sb.mpg.de) are possible but should consist of files easy to process on Unix systems (e.g., Postscript produced by dvips, pdf, ASCII, HTML). Please avoid MS Word documents or unprintable Postscript. For further information refer to http://www.mpi-sb.mpg.de/units/ag1/offers.html or contact Peter Sanders (sanders@mpi-sb.mpg.de). ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From rsuneeta at camden.rutgers.edu Mon Dec 10 20:03:07 2001 From: rsuneeta at camden.rutgers.edu (Suneeta Ramaswami) Date: Mon Jan 9 13:41:03 2006 Subject: Positions at Rutgers University, Camden Message-ID: <200112110103.fBB137J01611@crab.rutgers.edu> ==================================================================== Rutgers University - Camden Department of Computer Science The Department of Computer Science at Rutgers University - Camden invites applications for two tenure-track positions at the assistant professor level beginning September 2002. Primary consideration will be given to candidates whose research interests complement or augment existing strengths in the department. (Please see www.cs.camden.rutgers.edu for further information about the department.) We are particularly interested in candidates who work in the general area of algorithms and complexity, and in the theoretical foundations of information security, distributed computing, and graphics and visualization. However, strong candidates in other areas of computer science will be considered. A Ph.D. in Computer Science is required. Salary is contingent upon qualifications. Applicants should send a curriculum vitae, statement of research, statement of teaching interests/experience, and three letters of reference to: Chair, Faculty Search Committee Department of Computer Science Penn and 3rd Streets Rutgers University Camden, NJ 08102 Review of applications will begin immediately and will continue until the positions are filled. Rutgers University is an Equal Opportunity and Affirmative Action Employer and strongly encourages applications from women and members of minority groups. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From jorge_datasoft at uol.com.br Wed Dec 12 00:13:50 2001 From: jorge_datasoft at uol.com.br (Jorge Ferreira Mota) Date: Mon Jan 9 13:41:03 2006 Subject: No subject Message-ID: <000a01c182b2$a7e24ce0$fc4de6c8@datasoft> i am jorge - from Brazil i speak +- inglish gostaria de obter o algoritimo da triangulation de Delaunay em visual basic, pois estou desenvolvendo um sistema espero que seja bem atendido, por voces congratulation jorge Brazil visite nosso Pais -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20011212/85992090/attachment.htm From vrv75 at mail.ru Tue Dec 11 21:38:39 2001 From: vrv75 at mail.ru (Roman Voznyuk) Date: Mon Jan 9 13:41:03 2006 Subject: ACIS - parameters on a spherical surface Message-ID: <000d01c182be$83666ed0$0100a8c0@vrv> >My problem is, if I got a {u,v} coordinate, and I want to find the >corresponding 3D position on this spherical surface. The ACIS interface will, >occasional, return a point which is not at the expected location, because there >are two points on this surface have the same {u,v} value. Only one point corresponds to (u,v) pair in ACIS surfaces. For me everything works fine even for sphere. Nevertheless ,if you want opposite point try negate parameter or just calculate it without ACIS api. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From icalp2002 at lcc.uma.es Wed Dec 19 14:39:56 2001 From: icalp2002 at lcc.uma.es (icalp2002@lcc.uma.es) Date: Mon Jan 9 13:41:03 2006 Subject: ICALP2002 call for papers Message-ID: We apologize for possible multiple postings. In http://www.lcc.uma.es/icalp2002 you can find a pdf version of this call for paper. +++++++++++++++++++++++++++++++++++++ Last information: Second version of the WEB pages at http://www.lcc.uma.es/icalp2002 Workshops confirmed: Computability and Complexity in Analysis (CCA 2002) Algorithmic Methods and Models for Optimization of Railways ATMOS 2002 7 th International Workshop on Formal Methods for Industrial Critical Systems Foundations of Wide Area Network Computing Invited speakers confirmed: Heikki Mannila Manuel Hermenegildo +++++++++++++++++++++++++++++++++++++ Call for Papers ICALP 2002 29th International Colloquium on Automata, Languages and Programming July 8-13, 2002, Málaga, Spain Camera Ready: April 16, 2002 The 29th annual meeting of the European Association of Theoretical Computer Science will be held in Málaga, Spain, July 8-13, 2002 (at the E.T.S. Ingeniería Informática). As with the Journal Theoretical Computer Science (TCS), the scientific program of the Colloquium will be split into two parts: Track A of the meeting will correspond to Algorithms, Automata, Complexity and Games, while Track B to Logic, Semantics and Theory of Programming. SUBMISIONS: Authors are invited to submit extended abstract of their papers, presenting original contributions to the theory of computer science. Detailed instructions for paper submissions will be found on the conference webpage (http://www.lcc.uma.es/icalp2002) and in future calls for papers. Submissions should consist of: a cover page, with the author's full name, address, fax number, e-mail address, a 100-word abstract, keywords and to which track (A or B) the paper is being submitted and an extended abstract describing original research. At least one author of an accepted paper should be available to present it at the conference. Simultaneous submission to other conferences with published proceedings is not allowed. Further information (dates and instructions for submissions, workshops, registration, location and travel) will be provided in future announcements. ORGANIZING COMMITEE: Buenaventura Clares (University of Granada), Ricardo Conejo (University of Málaga), Inmaculada Fortes (University of Málaga), Llanos Mora (University of Málaga), Rafael Morales (co-Chair, University of Málaga), Marlon Nuńez (University of Málaga), José Luis Pérez de la Cruz (University of Málaga), Gonzalo Ramos (University of Málaga), Francisco Triguero (co-Chair, University of Málaga), José Luis Trivińo (University of Málaga). IMPORTANT DATES: Workshops proposal: November 8, 2001 Submissions: January 14, 2002 Notification: March 20, 2002 CONFERENCE CO-CHAIRS Prof. Francisco Triguero Prof. Rafael Morales Universidad de Málaga E.T.S. Ingeniería Informática Dept. Lenguajes y Ciencias de la Computación Bulevar Louis Pasteur, 35 29071 - Málaga (SPAIN) e-mail: icalp2002@informatica.uma.es PROGRAM COMMITEE Track A Ricardo Baeza-Yates (U. Chile) Volker Diekert (U. Stuttgart) Paolo Ferragina (U. Pisa) Catherine Greenhill (U. Melbourne) Torben Hagerup (U. Frankfurt) Johan Hĺstad (KTH, Stockholm) Gabriel Istrate (Los Alamos) Claire Kenyon (U. Paris XI) Der-Tsai Lee (Acad. Sinica, Taipei) Heikki Mannila (Nokia, Helsinki) Elvira Mayordomo (U. Zaragoza) Helmut Prodinger (U. Witwatersrand, South Africa) Jan van Leeuwen(U. Utrecht) Paul Vitányi (CWI, Amsterdam) Peter Widmayer (ETH Zürich) (Chair) Gerhard Woeginger (T.U. Graz) Christos Zaroliagis (U. Patras) Track B Martín Abadi (Bell Labs Research, Lucent) Roberto Amadio (U. Provence) Gilles Barthe (INRIA-SophiaAntipolis) Manfred Droste (University of Technology Dresden) Cédric Fournet (Microsoft Cambridge) Matthew Hennessy (U. Sussex) (Chair) Furio Honsell (U. Udine) Peter O'Hearn (Queen Mary & W. C. London) Fernando Orejas (U.P.Catalunya) Ernesto Pimentel (U. Málaga) David Sands (Chalmers University of Technology and Göteborg University) Dave Schmidt (U. Kansas) Gheorghe Stefanescu (U. Bucharest) Vasco Vasconcelos (U. Lisbon) Thomas Wilke (U. Kiel) +++++++++++++++++++++++++++++++++++++++++++ Malaga University uses Christmas holidays for backup and maintenance of his network. If you have problem to arrive to ICALP 2002 main page, please retry again later. If you get to the page http://www.lcc.uma.es but not to the page http://www.lcc.uma.es/icalp2002 contact with us: conejo@lcc.uma.es morales@lcc.uma.es ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From dmount at cs.ust.hk Tue Dec 18 21:26:20 2001 From: dmount at cs.ust.hk (Prof. David MOUNT) Date: Mon Jan 9 13:41:03 2006 Subject: ALENEX'02 Message-ID: This is a reminder that ALENEX'02 will be on Jan 4-5 2002, just prior to SODA. The early registration deadline in Dec 25, 2001. For further information visit: http://www.cs.umd.edu/~mount/ALENEX02/ Invited Speakers ---------------- Cynthia A. Phillips, Sandia National Laboratory Martin Farach-Colton, Google List of accepted papers ----------------------- An Improvement on Tree Selection Sort, Jingchao Chen Evaluating the Local Ratio Algorithm for Dynamic Storage, Kirk Pruhs and Eric Wiewiora Topological Sweep in Degenerate Cases, Eynat Rafalin, Diane Souvaine, and Ileana Streinu Using Multi-Level Graphs for Timetable Information in Railway Systems, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis Acceleration of K-means and Related Clustering Algorithms, Steven Phillips STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects, Cecilia M. Procopiuc, Pankaj K. Agarwal and Sariel Har-Peled On the Implementation of MST-based Heuristics for the Steiner Problem in Graphs, Marcus Poggi de Aragao and Renato F. Werneck Experimental Evaluation of a New Shortest Path Algorithm, Seth Pettie, Vijaya Ramachandran, and Srinath Sridhar The Treewidth of Java Programs, Jens Gustedt, Ole A Maehle, and Jan Arne Telle A Time-Sensitive System for Black-Box Combinatorial Optimization, Vinhthuy Phan, Pavel Sumazin, and Steven Skiena An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web, Massimiliano Curcio, Stefano Leonardi, and Andrea Vitaletti Getting More From Out-of-Core Columnsort, Geeta Chaudhry and Thomas H. Cormen Maintaining Dynamic Minimum Spanning Trees: An Experimental Study, G. Cattaneo, P. Faruolo, U. Ferraro P., and G. F. Italiano A Compressed Breadth-First Search for Satisfiability, DoRon B. Motter and Igor L. Markov Partitioning planar graphs with costs and weights, Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo and Anil Maheshwari ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.