From pchin at wlu.ca Mon May 8 11:05:17 2000 From: pchin at wlu.ca (Paulina Chin) Date: Mon Jan 9 13:40:58 2006 Subject: ISSAC 2000 Message-ID: CALL FOR POSTERS and CALL FOR PARTICIPATION ISSAC 2000 International Symposium on Symbolic and Algebraic Computation St Andrews University, Scotland, August 6-9, 2000 http://www-gap.dcs.st-and.ac.uk/issac2000 Held concurrently with CALCULEMUS-2000 Sponsored by ACM ISSAC provides an opportunity to learn of new developments and to present original research in all areas of symbolic and algebraic computation. ISSAC 2000 will be held at St. Andrews University Aug. 7-9, preceded by a day of tutorials on Aug. 6. It will be held concurrently with CALCULEMUS-2000 (www.mathweb.org/calculemus/meeting/standrews00). Planned activities include invited presentations, research and survey papers, poster sessions, tutorial courses, vendor exhibits and software demonstrations. CALL FOR POSTERS The poster sessions are an ideal venue for presenting recent research results or ongoing research projects that might not be complete, but whose preliminary results are already interesting nonetheless. Posters describing computer algebra systems and applications are also especially welcome. A best poster prize will be awarded. *** The deadline for poster submission is May 25, 2000. *** For a list of conference topics and submission instructions, please see our Web page (www-gap.dcs.st-and.ac.uk/issac2000/posters.shtml) or send e-mail to the Poster Committee Chair at A.M.Cohen@tue.nl. CALL FOR PARTICIPATION We encourage you to register and book accommodation on-line at www-gap.dcs.st-and.ac.uk/issac2000/registration.shtml. *** Fees will increase after June 1, 2000. *** Please note that a third tutorial, "Application of Computer Algebra in Mathematics Education," given by M. Rayes, has been added. This tutorial is free of charge as a result of the generous support of Texas Instruments. Advance registration is required. FURTHER INFORMATION For more information, please refer to the conference Web page, http://www-gap.dcs.st-and.ac.uk/issac2000. E-mail inquiries may be sent to issac2000@dcs.st-and.ac.uk or to one of the conference committee members listed below: General Chair: Tomas Recio, recio@matesco.unican.es Local Arrangements Chair: Steve Linton, sal@dcs.st-and.ac.uk Program Committee Chair: Chandrajit Bajaj, bajaj@cs.utexas.edu Tutorial Chair: Josef Schicho, josef.schicho@risc.uni-linz.ac.at Exhibitor Chair: Marc Moreno Maza, Numerical Algorithms Group, marc@nag.co.uk Poster Session Chair: Arjeh Cohen, amc@win.tue.nl Editor: Carlo Traverso, traverso@posso.dm.unipi.it Treasurer: Colin Campbell, cmc@st-andrews.ac.uk Publicity Chair: Paulina Chin, pchin@wlu.ca SPONSORS ISSAC 2000 is sponsored by ACM-SIGSAM and is supported by the Edinburgh Mathematical Society, the London Mathematical Society, the Numerical Algorithms Group and Texas Instruments. ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From gd2000 at cs.virginia.edu Mon May 8 20:03:14 2000 From: gd2000 at cs.virginia.edu (Graph Drawing 2000 Conference) Date: Mon Jan 9 13:40:58 2006 Subject: CFP: Symposium on Graph Drawing (GD 2000) Final Call for Papers Message-ID: <200005082303.TAA09904@viper.cs.Virginia.EDU> Please forward this CFP to any of your colleagues who might be interested. ........................................................................ Graph Drawing 2000 Final Call for Papers Colonial Williamsburg (Virginia, USA) September 20-23, 2000 http://www.cs.virginia.edu/~gd2000/ * Deadlines: ---------- o Submissions: May 24, 2000 o Notification of acceptance: July 19, 2000 o Early Registration: July 31, 2000 (Late registration TBA.) o Camera-ready copies of accepted papers: September 20, 2000 * Location: Colonial Williamsburg offers a peaceful retreat atmosphere. Located on the grounds of the 18th-century Historic Area Visitor Center, the conference is also conveniently located to shopping, restaurants, golf and more, all within walking distance. Colonial Williamsburg is located 150 miles south of Washington, D.C. on Interstate 64. Richmond International Airport is less than 50 minutes away -- rental car and shuttle service is available. Train and bus service are available from Washington, D.C. For more information on Colonial Williamsburg, visit: http://www.history.org/ * Scope: The symposium is a forum for researchers and practitioners working on all aspects of graph visualization and representation. The range of topics considered in graph drawing includes graph algorithms, graph theory, geometry, topology, visual languages, visual perception, information visualization, computer-human interaction, and graphic design. Much research in graph drawing is motivated by applications to systems for viewing and interacting with graphs. The interaction between theoretical advances and implemented solutions is an important part of the graph-drawing field. * Call for Papers and Demos: Authors are invited to submit papers describing original research of theoretical or practical significance to graph drawing. System demonstrations are also solicited. Descriptions of system demos should include illustrative screen dumps and an explanation of the system's functionality. Regular papers and demo descriptions should be labeled as either long or short; long papers will be assigned 12 pages in the conference proceedings, and short papers 6 pages. * Graph Drawing Contest: Following the tradition of previous conferences, a graph drawing contest will be held. Details will appear on the website later this Spring. * Submissions: Submitted papers and demo descriptions must be received by May 24, 2000. Each submission should include an indication of its type (paper or demo description) and length (regular or short), and contact information for the primary author. Electronic submissions in standard PostScript should be submitted by the process described at: http://sigact.csci.unt.edu/~gd2000/gd2000.html Alternatively, 16 hard copies of the submission can be mailed to the program chair. All submissions received will be acknowledged promptly by e-mail. * Proceedings: Accepted papers will be published in the conference proceedings, which will appear in the Springer-Verlag series Lecture Notes in Computer Science. Camera-ready and electronic copies of accepted papers are due at the conference. Instructions for Authors will be available after the paper notification deadline. All participants will receive a copy of the proceedings as part of their registration. * Program Committee: ------------------ Therese Biedl, University of Waterloo Peter Eades, University of Newcastle Wendy Feng, Tom Sawyer Software Ashim Garg, SUNY Buffalo Michael Goodrich, Johns Hopkins Michael Kaufmann, University of Tubingen Jan Kratochvil, Charles University Giuseppe Liotta, University of Perugia Joe Marks (chair), MERL Stephen North, AT&T Research Kathy Ryall, University of Virginia Kozo Sugiyama, JAIST Roberto Tamassia, Brown University Robin Thomas, Georgia Tech. Dorothea Wagner, University of Konstanz Stephen Wismath, University of Lethbridge * Organizing Committee: --------------------- Renee Carabajal, MERL Joe Marks, MERL Janet O'Halloran, MERL Kathy Ryall (chair), University of Virginia * Contest Committee: ------------------ Franz Brandenburg (chair), University of Passau * Contact Information: -------------------- o Conference URL: http://www.cs.virginia.edu/~gd2000/ o Conference Organization: gd2000@cs.virginia.edu o Electronic Submission: http://sigact.csci.unt.edu/~gd2000/gd2000.html o Hard-copy Submission: Joe Marks MERL, 201 Broadway Cambridge, MA 02139, USA Phone: 617-621-7534 ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From msp at dcs.warwick.ac.uk Wed May 10 09:56:04 2000 From: msp at dcs.warwick.ac.uk (Mike Paterson) Date: Mon Jan 9 13:40:58 2006 Subject: ESA - accepted papers Message-ID: <200005100756.IAA27321@gem.dcs.warwick.ac.uk> List of papers accepted for ESA 2000 (Saarbruecken, Sept 5-8) ============================================================= Polygon Decomposition for Efficient Construction of Minkowski Sums --- Pankaj K. Agarwal and Eyal Flato and Dan Halperin An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts --- Alexander A. Ageev and Maxim I. Sviridenko Offline List Update is NP-hard --- Christoph Ambuehl Computing the LCP of two Point Sets under Approximate Congruence --- Christoph Ambuehl and Samarjit Chakraborty and Bernd Gaertner Online Algorithms for Caching Multimedia Streams --- Matthew Andrews and Kamesh Munagala On Recognizing Cayley Graphs --- Lali Barriere and Pierre Fraigniaud and Cyril Gavoille and Bernard Fast algorithms for even/odd minimum cuts and generalizations --- Andras A. Benczur and Otilia Fulop Efficient algorithms for centers and medians in interval and --- S. Bespamyatnikh and B. Bhattacharya and J. Mark Keil and D. Exact point pattern matching and the number of congruent triangles in a three-dimensional pointset --- Peter Brass Range Searching Over Tree Cross Products --- Adam L. Buchsbaum and Michael T. Goodrich and Jeffery R. Westbrook A 2 1/10 Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem --- Robert Carr and Toshihiro Fujito and Goran Konjevod and Ojas Parekh The Minimum Range Assignment Problem on Linear Radio Networks --- A.E.F. Clementi, A. Ferreira, P. Penna, S. Perennes and R. Silvestri Property Testing in Computational Geometry --- Artur Czumaj and Christian Sohler and Martin Ziegler On R-trees with low stabbing number --- M. de Berg, J. Gudmundsson, M. Hammar, M. Overmars K-D Trees are Better When Cut on the Longest Side --- Matthew Dickerson and Christian A. Duncan and Michael T. Goodrich On multicriteria online problems --- M. Flammini and G. Nicosia Online scheduling --- Rudolf Fleischer and Michaela Wahl Constant ratio approximation algorithms for the rectangle --- Daya Ram Gaur and Toshihide Ibaraki and Ramesh Krishnamurti Almost Delaunay triangulation --- J. Gudmundsson and M. Hammar and M. van K On Representations of Algebraic-Geometric Codes for List Decoding --- Venkatesan Guruswami and Madhu Sudan Minimizing a convex cost closure set --- Dorit S. Hochbaum and Maurice Queyranne Preemptive scheduling with rejection --- H. Hoogeveen, M. Skutella, G.J. Woeginger Simpler and Faster Vertex-Connectivity Augmentation Algorithms --- Tsan-sheng Hsu Scheduling Broadcasts in Wireless Networks --- Bala Kalyanasundaram, Kirk Pruhs, and Mahe Velauthapillai Jitter Regulation in an Internet Router with Delay Consideration --- Hisashi Koga Approximation of Curvature-constrained Shortest Paths through a Sequence of Points --- Jae-Ha Lee, Otfried Cheong, Woo-Cheol Kwon, Sung Yong Shin and Kyung-Yong Chwa I/O-Efficient Well-Separated Pair Decomposition and its Applications --- Tamas Lukovszki and Anil Maheshwari and Norbert Zeh Resource Constrained Shortest Paths --- Kurt Mehlhorn and Mark Ziegelmann On the Competitiveness of Linear Search --- J. Ian Munro Maintaining a Minimum Spanning Tree Under Transient Node Failures --- Enrico Nardelli, Guido Proietti and Peter Widmayer Minimum Depth Graph Embedding --- Maurizio Pizzonia and Roberto Tamassia New Algorithms for Two-Label Point Labeling --- Zhongping Qin and Alexander Wolff and Yinfeng Xu and Binhai Zhu Analyzing the cache behaviour of non-uniform distribution sorting algorithms --- Naila Rahman and Rajeev Raman How Helpers Hasten h-Relations --- Peter Sanders and Roberto Solis-Oba Computing optimal linear layouts of trees in linear time --- Konstantin Skodinis Coloring sparse random graphs in polynomial average time --- C.R. Subramanian Restarts can help in the on-line minimization of the maximum delivery time on a single machine --- J.M. van den Akker and J.A. Hoogeveen and N. Vakhania Collision Detection Using Bounding Boxes: Convexity Helps --- Yunhong Zhou and Subhash Suri ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From otfried at cs.ust.hk Thu May 4 13:32:13 2000 From: otfried at cs.ust.hk (Otfried Cheong) Date: Mon Jan 9 13:40:58 2006 Subject: SoCG 2000 Early Registration Deadline Message-ID: <200005040432.e444WDi15640@cssvr17.cs.ust.hk> The SoCG 2000 Early Registration deadline is approaching quickly. If you plan to attend this unique event---the first ACM Symposium on Computational Geometry held in Asia---please make sure your complete registration arrives by May 14. We still have some hotel-quality housing on campus available, so be quick and reserve before only dormitory rooms are left! You can find the conference website at the following URL: http://www.cs.ust.hk/tcsc/scg00.html The organizing team Siu-Wing Cheng, Otfried Cheong Hong Kong University of Science and Technology ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From ian at cs.wits.ac.za Mon May 8 14:11:47 2000 From: ian at cs.wits.ac.za (Ian Sanders) Date: Mon Jan 9 13:40:58 2006 Subject: Vacant Posts -- University of the Witwatersrand, Johannesburg, SA Message-ID: Department of Computer Science University of the Witwatersrand, Johannesburg, South Africa ============================== Looking to fill positions at the following levels Senior Lecturer / Lecturer / Senior Tutor / Tutor Description ----------- The Department is one of the premier departments in the country. We are playing a leading role in curriculum development internationally and we have developed international research links in a number of areas. We have a challenging environment as an important discipline in our transforming society. Our mission is to address our dynamic African needs both in developing highly educated students and research in computer science. The University has recognised this by giving us additional posts to help us grow our important discipline. We currently have four positions available two at senior lecturer and two at lecturer / senior tutor level. We would welcome applications at tutor level for an appointment against a lecturer level post. Duties ------ An important aspect of these posts will be to undertake teaching in our undergraduate, higher diploma and postgraduate programmes. We encourage all staff to undertake research but those wishing to apply for senior lecturer and lecturer are required to. Senior tutors and tutors will be expected to help more with student support if their career path is more focused on teaching. Qualifications -------------- Minimum requirement for lecturer and senior lecturer is a PhD. We will be happy to consider a candidate who is close to completion of a PhD. We would like to see evidence of research and teaching -- in the case of an application for senior lecturer this will be essential. For the tutor track a postgraduate qualification as well as teaching experience is necessary. Salary Range ------------ Senior lecturer: R93 672-R12 4392 Lecturer / Senior tutor R68 052 - R109 944 Tutor R43 608-R70 080 Benefits -------- Possibility of salary subvention (in the region of 10% of salary), annual bonus, generous leave, retirement fund, medical aid, housing subsidy (if eligible), relocation allowance, 100% financial assistance towards dependants' University studies (if applicable) Submit a detailed CV with names, addresses and contact numbers of three referees and certified copies of degrees/diplomas to: The personnel Office (Academic), University of the Witwatersrand, Private Bag 3, WITS, 2050. Closing Date: 30 June 2000. For more information email conrad@cs.wits.ac.za or reply to this posting. ---------------------------------------------------------------- Ian Sanders Telephone: (2711) 717-6187 Department of Computer Science Fax: (2711) 717-6199 University of the Witwatersrand Private Bag 3 email: ian@cs.wits.ac.za 2050 WITS SOUTH AFRICA http://www.cs.wits.ac.za/~ian ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From santos at matesco.unican.es Thu May 4 21:38:24 2000 From: santos at matesco.unican.es (Francisco Santos) Date: Mon Jan 9 13:40:58 2006 Subject: summer course, second announcement Message-ID: Second announcement of the course TRIANGULATIONS OF POLYHEDRA AND POINT SETS Santander (SPAIN), July 3-7, 2000 The Web page http://matsun1.matesco.unican.es/~santos/triancourse has been updated, including information on registration and scholarships. There are two urgent things that students willing to come should do: - reserve accomodation (you can get information on the web page and can contact F. Santos santos@matesco.unican.es for help). - apply for a fee reduction from University of Cantabria. Deadline for this is MAY 20 and some documentation has to be snail-mailed. Instructions on the web page. Lecturers: Jesus A. de Loera, assistant professor, U. of California at Davis. Joerg Rambau, scientific assistant, Konrad-Zuse-Zentrum fuer Informationstechnik, Berlin. Francisco Santos, associate professor, U. de Cantabria, Santander. A short description of the course and tentative program is included below. For more information, including travel hints, registration, accomodation, etc. see: http://matsun1.matesco.unican.es/~santos/triancourse SHORT DESCRIPTION OF THE COURSE: ------------------------------- The topic are optimization and enumeration problems in the set of all triangulations of a polytope or point configuration. The course is addressed to graduate students and researches in mathematics (specially algebra, geometry and applied mathematics), computer science (complexity theory, algorithmics) and some parts of engineering (those related to GIS, CAD, etc). On the theoretical side, the core of the course is the theory of secondary and universal polytopes, and the notion of geometric bistellar flip. The pre-requisites from the student are, basically, linear algebra and affine geometry. Some familiarity with projective geometry, theoretical combinatorics and complexity of algorithms would be desirable, but not strictly necessary. For the applications in algebraic geometry and topology mentioned in the last day (see the program below) some knowledge of these areas is needed, but the rest of the course can be followed without them. TENTATIVE PROGRAM: ----------------- Monday, July 3: 09:00 h. - 09:30 h. WELCOME. 09:30 h. - 11:30 h. FUNDAMENTAL NOTIONS AND MOTIVATION. JESUS DE LOERA 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. LIFE IN TWO DIMENSIONS. FLIPS. FRANCISCO SANTOS Tuesday, July 4 09:30 h. - 11:30 h. COMBINATORICS OF POLYHEDRAL SUBDIVISIONS. GALE DIAGRAMS AND CHAMBERS. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. SECONDARY POLYTOPES. BISTELLAR FLIPS. JORG RAMBAU Wednesday, July 5 09:30 h. - 11:30 h. THE UNIVERSAL POLYTOPE: A TOOL FOR OPTIMIZATION. JESUS DE LOERA 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. OPTIMIZATION. MINIMAL AND MAXIMAL TRIANGULATIONS. JESUS DE LOERA Thursday, July 6 09:30 h. - 11:30 h. THE BEST OF WORLDS: CYCLIC POLYTOPES. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. A CRUCIAL EXAMPLE: PRODUCTS OF SIMPLICES. TRIANGULATIONS WITHOUT FLIPS. FRANCISCO SANTOS Friday, July 7 09:30 h. - 11:30 h. FIBER POLYTOPES AND BEYOND. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. APPLICATIONS IN ALGEBRAIC GEOMETRY. JESUS DE LOERA 14:00 h. - 14:15 h. DELIVER OF DIPLOMAS +--------------------------------------------------------+ | Francisco Santos santos@matesco.unican.es | | Departamento de Matematicas, Estadistica y Computacion | | Universidad de Cantabria, Tel: +34-942-201522 | | E-39005 Santander, SPAIN Fax: +34-942-201402 | | http://www.matesco.unican.es/~santos | +--------------------------------------------------------+ ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From emo at inf.ethz.ch Thu May 11 11:18:35 2000 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:40:58 2006 Subject: CATS 2001 CfP Message-ID: <200005110818.KAA22850@shadow.inf.ethz.ch> Call for Papers CATS 2001 - Computing: The Australasian Theory Symposium Computing: The Australasian Theory Symposium (CATS) is the premier theoretical computer science conference in Australasia. It is held annually as part of Australasian Computer Science Week (ACSW). CATS 2001 will be the seventh in the series. The symposium will consist of invited speakers and research paper presentations. DATE AND LOCATION CATS 2001 will be held over two days during Australasian Computer Science Week. ACSW 2001 will take place at Bond University, Gold Coast, Queensland, Australia, from 29th January to 2nd February 2001. SCOPE CATS covers all aspects of theoretical computer science. Some representative, but not exclusive, topics include the following: - logic, reasoning and verification - formal specification techniques and program semantics - formal development methods, program refinement, synthesis and transformation - concurrent, parallel and distributed system theory - theory of algorithms and data structures - complexity and computability - automata, number and category theory - tools for automated reasoning, and program analysis and development KEYNOTE ADDRESSES Prof Mathai Joseph, Tata Research Development and Design Centre, Pune, India Prof Carroll Morgan, Software Engineering Research Group, Department of Computer Science and Engineering, University of New South Wales CALL FOR PAPERS Research paper submissions to CATS 2001 should be prepared according to the formatting requirements below and sent to the Programme Chair, to arrive no later than August 4, 2000. Submissions must be original work, not published or submitted elsewhere. All submissions will be refereed. PROCEEDINGS The proceedings of CATS 2001 will be published by Elsevier Science in their series Electronic Notes in Theoretical Computer Science. ENTCS is an electronic series associated with the journal Theoretical Computer Science, and published by Elsevier Science B. V. (Institutions subscribing to TCS can access full papers in ENTCS on-line.) ENTCS offers rapid, worldwide dissemination of research results, an absence of page limits, and long-term accessibility through the electronic archives that Elsevier maintains. (The proceedings of last year's CATS 2000 conference appeared as ENTCS Volume 31.) A hardcopy preliminary proceedings will be provided to conference attendees. Authors of selected papers from the CATS 2001 proceedings will be invited to submit extended versions of their papers to a Special Issue of the journal Theoretical Computer Science. FORMATTING REQUIREMENTS To ensure a uniform format for papers, all submissions to CATS 2001 must be prepared in LaTeX using the ENTCS macros. Papers in other formats cannot be accepted. Further information is available via the ENTCS home page: http://www.elsevier.nl/locate/entcs/. (Follow the links for "Instructions for Submissions" and "Technical Requirements".) Complete papers should be e-mailed as PostScript files, preferably as MIME attachments. Although there is no strict page limit on submissions to CATS 2001, authors are strongly encouraged to be as concise as possible. Papers between 10 and 15 pages are considered ideal. If necessary, definitions and proofs not essential to understanding the paper should be relegated to appendices to appear only in the electronic version. CALL FOR POSTERS A poster session will be arranged to give CATS attendees the opportunity to give informal presentations of their work. Expressions of interest, briefly outlining the poster's topic, should be e-mailed to the Programme Chair by November 10, 2000. IMPORTANT DATES Friday 4 August 2000: Deadline for submissions Friday 6 October 2000: Notification of acceptance Friday 27 October 2000: Final versions of accepted papers due Friday 10 November 2000: Deadline for author registrations Monday 29 January to Friday 2 February 2001: Australasian Computer Science Week, incorporating CATS 2001 PROGRAMME COMMITTEE Mariangiola Dezani-Ciancaglini, Universita di Torino, Italy Rod Downey, Victoria University of Wellington, New Zealand Colin Fidge (Chair), The University of Queensland, Australia Lance Fortnow, NEC Research Institute, USA Joseph Goguen, University of California at San Diego, USA Andrew Martin, Oxford University, United Kingdom Ian Mason, University of New England, Australia Janos Pach, New York University, USA Igor Shparlinski, Macquarie University, Australia Mark Utting, University of Waikato, New Zealand Emo Welzl, ETH Zurich, Switzerland ACSW GENERAL CHAIR Gopal Gupta, Bond University UPDATES AND NEWS Up to date information about the CATS 2001 conference can be found at its web site: http://www.csee.uq.edu.au/~cats01/ ENQUIRIES AND SUBMISSIONS Dr Colin Fidge (CATS 2001 Programme Chair) Software Verification Research Centre The University of Queensland Queensland 4072 Australia Fax: +61 7 3365 1533 Email: cats01@svrc.uq.edu.au ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From otfried at cs.ust.hk Wed May 17 19:08:53 2000 From: otfried at cs.ust.hk (Otfried Cheong) Date: Mon Jan 9 13:40:58 2006 Subject: SoCG 2000 Last Call For Participation Message-ID: <200005171008.e4HA8rC16835@cssvr17.cs.ust.hk> The 16th ACM Symposium on Computational Geometry 2000 is held from June 12 to 14 in Hong Kong. Please consider attending this unique event---the first ACM Symposium on Computational Geometry held in Asia! We still have hotel-quality housing on campus available. However, it must be reserved by May 22. We will not be able to provide any accomodation after that date. You can find the conference website at the following URL: http://www.cs.ust.hk/tcsc/scg00.html The organizing team Siu-Wing Cheng, Otfried Cheong Hong Kong University of Science and Technology ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From moonn at cs.byu.edu Fri May 12 07:50:48 2000 From: moonn at cs.byu.edu (Nathan Moon) Date: Mon Jan 9 13:40:58 2006 Subject: removing points from a 3-D Delaunay tetrahedralization Message-ID: <391B4758.4EB8AC65@cs.byu.edu> I have been looking for an algorithm for removing a point from a Delaunay tetrahedralization, and haven't had any luck. I have found where a few authors have conjectured that 2-D algorithms would extend to 3-D, but have been unable to find where anyone has actually implemented something. Could anyone point me towards literature or anything describing such an algorithm? Or even just tell me if they know one exists, so that I know to keep searching. Thanks in advance! Nathan Moon moonn@cs.byu.edu ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From puppo at disi.unige.it Wed May 24 04:23:29 2000 From: puppo at disi.unige.it (Enrico Puppo) Date: Mon Jan 9 13:40:58 2006 Subject: young visiting researcher positions Message-ID: <34AC4FA1.3D64AB90@disi.unige.it> YOUNG VISITING RESEARCHER POSITIONS AVAILABLE Department of Computer and Information Sciences University of Genova Both Pre- and Post-doctoral positions for young visiting researchers are available in the Department of Computer and Information Sciences at the University of Genova (Genova, Italy) under the supervision of Prof. Leila De Floriani and Prof. Enrico Puppo. Positions are funded by the EU in the context of the Research Network MINGLE. In order for a young researcher to be appointed in the project, some conditions (laid down by the EU) must be satisfied (see Eligibility below). The young researcher will carry out research in collaboration with members of the local research group, and will interact with other research groups in the context of the Research Network. Dates: Appointments will start in September 2000 and can last for a period between six months and one year. Applications will be accepted until positions are filled. Research subject: Multiresolution geometric modeling (for more information see http://www.disi.unige.it/research/Geometric_modeling/). Salary: - Pre-Doc: 1880 EURO per month - Post-Doc: 2700 EURO per month Eligibility: - age 35 years or less at the time of his appointment; - for Pre-Doc appointment: MS or equivalent degree in Computer Science, Computer Engineering or Mathematics; - for Post-Doc: PhD or equivalent degree in Computer Science, Computer Engineering or Mathenatics; - nationality of a Member State of the European Community (except Italy) or of an Associated State (see list below) or have resided in the European Community for at least five years prior to appointment; - must not have carried out her/his normal activities in Italy for more than 12 of the 24 months prior to his appointment. Associated States: Bulgaria, the Czech Republic, the Republic of Cyprus, Estonia, Hungary, Iceland, Israel, Latvia, Liechtenstein, Lithuania, Norway, Poland, Romania, Slovakia, and Slovenia. Fluent English is required. Background in Computer Graphics and/or Geometric Modeling is desired but not required. Application: Applicants must submit a letter of interest and CV, preferably by email or fax, to Leila De Floriani DISI - Universita' di Genova Via Dodecaneso 35 16146 Genova ITALY Email: deflo@disi.unige.it Phone: +39-0103536704 Fax: +39-0103536699 ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From Olivier.Devillers at sophia.inria.fr Fri May 19 10:26:23 2000 From: Olivier.Devillers at sophia.inria.fr (Olivier Devillers) Date: Mon Jan 9 13:40:58 2006 Subject: removing points from a 3-D Delaunay tetrahedralization Message-ID: <200005190726.JAA15541@perle.inria.fr> The following paper works in 3D (I have imlemented it even if it is not written in the paper. I ghave done it afterwards). @inproceedings{d-ddt-99 , author = "Olivier Devillers" , title = "On Deletion in {Delaunay} Triangulation" , booktitle = "Proc. 15th Annu. ACM Sympos. Comput. Geom." , year = 1999 , pages = "181--188" , url = "http://www-sop.inria.fr/prisme/publis/d-ddt-99.ps.gz" , archive = "XXX:cs.CG/9907023" , succeeds = "d-ddt-98" , cites = "agss-ltacv-89, a-pdpaa-87, bbp-iayed-98scg, bd-irgo-95, bm-sdcs -71, c-bvdcp-86, ads-rdppw-98, d-iirdt-98, dmt-ssgtu-92i, dp-papaf-98, es-itfwr- 96, gs-cdtp-78, h-taatm-90, l-tdam-97, m-smdnt-93, msz-frplw-96, obs-stcav-92, p -gcc-70, s-chdch-86, s-nmpgc-98" , update = "99.11 bibrelex+devillers, 99.07 devillers" , abstract = "This paper present how space of spheres and shelling can be use d to delete efficiently a point from d-dimensional triangulation. In 2-dimension , if k is the degree of the deleted vertex, the complexity is $O(k\log k)$, but we notice that this number apply only to low cost operations; time consuming com putations are done only a linear number of times. This algorithm can be viewed a s a variation of Heller algorithm which is popular in the geographic information system community. Unfortunately Heller algorithm is false as explained in this paper." } ---------------------------------------------------------------------- ----- O. Devillers, INRIA, 2004 route des Lucioles, BP 93, 06902 Sophia Antipolis Olivier.Devillers@sophia.inria.fr, +33 4 92 38 77 63, Fax +33 4 92 38 76 43 http://www-sop.inria.fr/prisme/personnel/devillers/ ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From sanjiva at cse.iitd.ernet.in Sat May 20 09:15:05 2000 From: sanjiva at cse.iitd.ernet.in (Sanjiva Prasad) Date: Mon Jan 9 13:40:58 2006 Subject: FSTTCS 2000: revised Call for Papers Message-ID: <200005200245.IAA07183@cse.iitd.ernet.in> --text follows this line-- *********************************************************************** * * * FST TCS 2000 * * * * Foundations of Software Technology and Theoretical Computer Science * * December 13--15, 2000 * * New Delhi, India * * * *********************************************************************** * Call for Papers * *********************************************************************** New: Electronic Submission Guidelines Revised list of Invited Speakers ********************************************************************** IARCS, the Indian Association for Research in Computing Science, announces the 20th Annual FST TCS Conference in New Delhi. Tentatively planned satellite events include include two workshops: on Computational Geometry and on Advances in Programming Languages. Authors are invited to submit papers presenting original and unpublished research on **any** theoretical aspects of Computer Science. Papers in applied areas with a strong foundational emphasis are also welcome. The proceedings of the last six years' conferences (Springer-Verlag Lecture Notes in Computer Science volumes 880, 1026, 1180, 1346, 1530, 1738) give an idea of the kind of papers typically presented at FST TCS. Typical areas include (but are not restricted to): Automata, Languages and Computability Randomized and Approximation Algorithms Computational Geometry Computational Biology Combinatorial Optimization Graph and Network Algorithms Complexity Theory Parallel and Distributed Computing New Models of Computation Concurrent, Real-time and Hybrid Systems Logics of Programs and Modal Logics Database Theory and Information Retrieval Automated Reasoning, Rewrite Systems, and Applications Logic, Proof Theory, Model Theory and Applications Semantics of Programming Languages Static Analysis and Type Systems Theory of Functional and Constraint-based Programming Software Specification and Verification Cryptography and Security Protocols For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important Dates --------------- Deadline for Submission 31 May, 2000 Notification to Authors 15 August, 2000 Final Version of Accepted Papers due 15 September, 2000 Deadline for Early Registration 15 November, 2000 Submission Guidelines - --------------------- Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 A4-size pages, with 1.5 inch top margin and other margins 1 inch wide with 11 point or larger font. Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should contain a short abstract. If available, e-mail addresses and fax numbers of the authors should be included. Electronic Submissions - -------------------- Electronic submission is very strongly encouraged. You may submit your paper using Rich Gerber's system START by visiting the URL for the conference and following the appropriate links. The URL for submissions is http://www.cse.iitd.ernet.in/~fsttcs20/START/www/submit.html In case you ar eunable to submit using START, self-contained uuencoded gzipped Postscript versions of the paper may be sent by e-mail to fsttcs20@cse.iitd.ernet.in In addition, the following information in ASCII format should be sent to this address in a **separate** e-mail: Title; authors; communicating author's name, address, and e-mail address and fax number if available; abstract of paper. Hard-Copy Submissions - --------------------- If electronic submission is not possible, authors may submit five (5) hard-copies of the paper by post to the following address: FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas New Delhi 110 016 INDIA Invited Speakers ---------------- Invited Speakers who have confirmed participation include: Peter Buneman (U Penn) Bernard Chazelle (Princeton) E. Allen Emerson (U Texas, Austin) Martin Groetschel (ZIB) Jose Meseguer (SRI) Philip Wadler (Bell Labs) Programme Committee ------------------- Pankaj Agarwal (Duke) Manindra Agrawal (IIT, Kanpur) Tetsuo Asano (JAIST) Vijay Chandru (IISc, Bangalore) Rance Cleaveland (Stony Brook) Anuj Dawar (Cambridge) Sampath Kannan (AT&T Research) Sanjiv Kapoor (IIT, Delhi) (Co-chair) Kamal Lodaya (IMSc, Chennai) Madhavan Mukund (CMI, Chennai) Gopalan Nadathur (Loyola) Seffi Naor (Bell Labs and Technion) Tobias Nipkow (TU Munich) Luke Ong (Oxford) C. Pandu Rangan (IIT, Chennai) Paritosh Pandya (TIFR) Benjamin Pierce (U Penn) Sanjiva Prasad (IIT, Delhi) (Co-chair) Sridhar Rajagopalan (IBM, Almaden) Abhiram Ranade (IIT, Mumbai) Dave Sands (Chalmers) A Prasad Sistla (U Illinois, Chicago) Michiel Smid (Magdeburg) Mandayam K. Srivas (SRI) Organized by ------------ Indian Institute of Technology, Delhi Hauz Khas, New Delhi 100 016. Organizing Committee ------------------- Sandeep Sen (chair) Naveen Garg (treasurer) S N Maheshwari Conference Site --------------- The Conference will take place at the India International Centre, 40 Lodhi Estate, Max Mueller Marg, New Delhi 110 003. Correspondence Address ---------------------- All correspondence regarding submissions may be addressed to FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas, New Delhi 110 016, INDIA Email: fsttcs20@cse.iitd.ernet.in Fax: +91 11 686 8765 Phone: +91 11 659 1294 / 659 1286 URL: http://www.cse.iitd.ernet.in/~fsttcs20 -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva@cse.iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From jsbm at ams.sunysb.edu Mon May 22 20:04:17 2000 From: jsbm at ams.sunysb.edu (jsbm@ams.sunysb.edu) Date: Mon Jan 9 13:40:58 2006 Subject: Business meeting agenda Message-ID: <200005222304.TAA29163@amirani.ams.sunysb.edu> Dear Members of the Computational Geometry Community, The annual SoCG business meeting will be held on Monday, June 12 (8pm). We are currently collecting business agenda items for the meeting. Please let me know if you have announcements, bids to host SoCG'2002, or discussion items to raise. In particular, if you would like to make a bid for hosting SoCG'2002 but are not attending the meeting in Hong Kong, we can arrange for your bid to be presented (if you have not already found a proxy). Thanks, Joe Mitchell Chair, Steering Committee jsbm@ams.sunysb.edu ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From pankaj at cs.duke.edu Tue May 23 19:32:54 2000 From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal) Date: Mon Jan 9 13:40:58 2006 Subject: Student funding for SCG'00 Message-ID: <200005232232.SAA05692@polya.cs.duke.edu> Raindrop Geomagic has provided funds to partially support the travel expenses of a few students for the 16th ACM Symposium on Computational Geometry to be held June 12--14, 2000 in Hong Kong. See http://www.cs.ust.hk/tcsc/scg00.html for details. If you are interested, please send mail to Pankaj Agarwal (pankaj@cs.duke.edu) and conference organizers (scg00@cs.ust.hk) as soon as possible, but no later than May 26, 2000. Please include the amount you need and whether you are an author of a paper to be presented at the conference. A committee would decide the allocation of funds. ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From sanjiva at cse.iitd.ernet.in Tue May 30 18:44:10 2000 From: sanjiva at cse.iitd.ernet.in (Sanjiva Prasad) Date: Mon Jan 9 13:40:58 2006 Subject: FST TCS 2000: One week extension on the submission deadline Message-ID: <200005301214.RAA02069@cse.iitd.ernet.in> Anticipating down time at our site, and to give interested authors the benefit of a weekend, we are extending the deadline for submission to June 6, 2000. We also encourange authors to submit using the START program that can be accessed from the home page of the FST TCS 2000 conference http://www.cse.iitd.ernet.in/fsttcs20 *********************************************************************** * * * FST TCS 2000 * * * * Foundations of Software Technology and Theoretical Computer Science * * December 13--15, 2000 * * New Delhi, India * * * *********************************************************************** * Call for Papers * *********************************************************************** Submission Guidelines - --------------------- Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 A4-size pages, with 1.5 inch top margin and other margins 1 inch wide with 11 point or larger font. We advise authors to employ Springer-Verlag's LNCS style file "llncs.sty". Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should contain a short abstract. If available, e-mail addresses and fax numbers of the authors should be included. Electronic Submissions - -------------------- Electronic submission is very strongly encouraged. You may submit your paper using Rich Gerber's system START by visiting the URL for the conference and following the appropriate links. The URL for submissions is http://www.cse.iitd.ernet.in/~fsttcs20/START/www/submit.html In case you ar eunable to submit using START, self-contained uuencoded gzipped Postscript versions of the paper may be sent by e-mail to fsttcs20@cse.iitd.ernet.in In addition, the following information in ASCII format should be sent to this address in a **separate** e-mail: Title; authors; communicating author's name, address, and e-mail address and fax number if available; abstract of paper. Hard-Copy Submissions - --------------------- If electronic submission is not possible, authors may submit five (5) hard-copies of the paper by post to the following address: FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas New Delhi 110 016 INDIA -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva@cse.iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html.