From yjc at photon.poly.edu Fri Jun 1 19:55:48 2001 From: yjc at photon.poly.edu (Yi-Jen Chiang) Date: Mon Jan 9 13:41:02 2006 Subject: WADS 2001 program, registration, and housing information Message-ID: The 7th Workshop on Algorithms and Data Structures (WADS 2001) will be held August 8-10, 2001, at Brown University, Providence, Rhode Island, USA. The WADS web site now includes a preliminary program, registration information, accommodation information, and local information; please see http://www.wads.org/. The early registration deadline is June 20. -------------------------------- WADS 2001 Preliminary Program Wednesday, August 8 Session 1: 9:30 - 10:30 Invited Lecture: Approximation of Multiobjective Optimization Problems. Mihalis Yannakakis Track A Track B Break: 10:30 - 11:00 Session 2A: 11:00 - 12:00 Session 2B: 11:00 - 12:00 Optimal, Suboptimal and Robust Algorithms Using the pseudo-dimension to analyze for Proximity Graphs. F. Hurtado, G. approximation algorithms for integer Liotta, H. Meijer programming. Philip M. Long Optimal Moebius Transformations for On the Complexity of Scheduling Conditional Information Visualization and Meshing. Real-Time Code. Samarjit Chakraborty and Marshall Bern and David Eppstein Thomas Erlebach and Lothar Thiele Session 3A: 1:30 - 2:30 Session 3B: 1:30 - 2:30 Time Responsive External Data Structures Fast fixed-parameter tractable algorithms for Moving Points. Pankaj K. Agarwal and for nontrivial generalizations of vertex Lars Arge and Jan Vahrenhold cover. Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos Voronoi Diagrams for Moving Disks and Minimizing clique-width for graphs of Applications. Menelaos I. Karavelas bounded tree-width. Wolfgang Espelage, Frank Gurski, Egon Wanke Break: 2:30 - 3:00 Session 4A: 3:00 - 4:30 Session 4B: 3:00 - 4:30 Complexity Bounds for Vertical Seller-Focused Algorithms for Online Decompositions of Linear Arrangements in . Auctioning. Amitabha Bagchi and Amitabh Vladlen Koltun Chaudhary and Rahul Garg and Michael T. Goodrich and Vijay Kumar Optimization Over Zonotopes and Training Competitive analysis of the LRFU paging Support Vector Machines. Marshall Bern and algorithm. Edith Cohen and Haim Kaplan and David Eppstein Uri Zwick Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. Pankaj K. Agarwal and Mark de Berg and Sariel Admission Control to Minimize Rejections. Har-Peled and Mark Overmars and Micha Avrim Blum and Adam Kalai and Jon Kleinberg Sharir and Jan Vahrenhold Thursday, August 9 Session 5: 9:30 - 10:30 Invited Lecture: Secure Multi-Party Computational Geometry. Mikhail J. Atallah (joint work with Wenliang (Kevin) Du) Track A Track B Break: 10:30 - 11:00 Session 6A: 11:00 - 12:00 Session 6B: 11:00 - 12:00 The Grid Placement Problem. P. Bose, A. A (7/8)-approximation algorithm for metric Maheshwari, P. Morin, and J. Morrison Max TSP. Refael Hassin and Shlomi Rubinstein On the Reflexivity of Point Sets. Esther M. Arkin and S\'andor P. Fekete and Ferran Approximating Multi-Objective Knapsack Hurtado and Joseph S. B. Mitchell Marc Noy Problems. Thomas Erlebach and Hans Kellerer and Vera Sacrist\'an and Saurabh Sethia and Ulrich Pferschy Session 7A: 1:30 - 2:30 Session 7B: 1:30 - 2:30 Visual Ranking of Link Structures. Ulrik Short and simple labels for small distances Brandes and Sabine Cornelsen and other functions. Haim Kaplan and Tova Milo A simple linear time algorithm for proper Fast Boolean matrix multiplication for box rectangular drawings of plane graphs. highly clustered data. Andreas Bjorklund Xin He and Andrzej Lingas Break: 2:30 - 3:00 Session 8A: 3:00 - 4:30 Session 8B: 3:00 - 4:30 Partitioning colored point sets into Higher-Dimensional Packing with Order monochromatic parts. Adrian Dumitrescu and Constraints. S\'andor P. Fekete and Janos Pach Ekkehard K\"ohler and J\"urgen Teich The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. Songrit Bin Packing with Item Fragmentation. Nir Maneewongvatana and David M. Mount Menakerman and Raphael Rom I/O-Efficient Shortest Path Queries in Practical Approximation Algorithms for Geometric Spanners. Anil Maheshwari and Separable Linear Programs. F.F. Dragan and Michiel Smid and Norbert Zeh A.B. Kahng and I.I. Mandoiu and S. Muddu Friday, August 10 Session 9: 9:30 - 10:30 Invited Lecture: The Challenges of Delivering Content on the Internet. F. Thomson Leighton Track A Track B Break: 10:30 - 11:00 Session 10A: 11:00 - 12:00 Session 10B: 11:00 - 12:00 A Linear-Time Algorithm for Computing Upward Embeddings and Orientations of Inversion Distance Between Signed Undirected Planar Graphs. Walter Didimo Permutations with an Experimental Study. and Maurizio Pizzonia David A. Bader and Bernard M.E. Moret and Mi Yan An Approach for Mixed Upward Planarization Computing Phylogenetic Roots with Bounded . Markus Eiglsperger and Michael Kaufmann Degrees and Errors . Zhi-Zhong Chen and Tao Jiang and Guo-Hui Lin Lunch: 12:00 - 1:30 Session 11A: 1:30 - 2:30 Session 11B: 1:30 - 2:30 A decomposition-based approach to layered manufacturing. Ivaylo Ilinkin and Ravi Search Trees with Relaxed Balance and Janardan and Jayanth Majhi and Joerg Near-Optimal Height. Rolf Fagerberg and Schwerdt and Michiel Smid and Ram Sriram Rune E. Jensen and Kim S. Larsen When Can You Fold a Map?. Esther M. Arkin and Michael A. Bender and Erik D. Demaine Succint Dynamic Data Structures. Rajeev and Martin L. Demaine and Joseph S. B. Raman and Venkatesh Raman and S. Srinivasa Mitchell and Saurabh Sethia and Steven S. Rao Skiena Break: 2:30 - 3:00 Session 12A: 3:00 - 4:00 Session 12B: 3:00 - 4:00 Two-Guard Walkability of Simple Polygons. Binay Bhattacharya, Asish Mukhopadhyay, Small Maximal Independent Sets and Faster Giri Narasimhan Exact Graph Coloring. David Eppstein Movement Planning in the Presence of On External-Memory Planar Depth First Flows. John Reif and Zheng Sun Search. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh ------------------------------------------------------------------------ ------------- 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 biedl at math.uwaterloo.ca Fri Jun 8 14:49:47 2001 From: biedl at math.uwaterloo.ca (Therese Biedl) Date: Mon Jan 9 13:41:02 2006 Subject: CCCG'01 - Call for Participation In-Reply-To: Message-ID: -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= Call for Participation 13th Canadian Conference on Computational Geometry August 13-15, 2001 University of Waterloo http://compgeo.math.uwaterloo.ca/~cccg01 -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= Scope CCCG'01 will take place in Waterloo on August 13-15 (with a welcome reception on August 12). 44 papers will be presented at CCCG'01; a complete list and the preliminary program is available from the conference web page. Invited presentations will be given by George Hart, Neil Sloane and a speaker to be announced. Registration The early registration fee is CAD120 (CAD60 for students). Early registration deadline is July 16, 2001. To register, please visit the conference web page. Accommodation A block of rooms has been reserved in Hotel Laurier (the student residences of nearby Wilfrid Laurier University). Please reserve before July 16, 2001. Various other hotels are available nearby, see the conference web page for details. Further Information Travel directions, local information, and an outline of the program are also available from the conference web page. Important dates Submission of final paper: June 29, 2001 Early registration: July 16, 2001 Accommodation: July 16, 2001 Conference: August 13-15, 2001 Contact Information Therese Biedl Dept. of Computer Science University of Waterloo Waterloo, ON N2L 3G1 Phone: (519) 888-4567x4721 Fax: (519) 885-1208 Email: biedl@uwaterloo.ca Sponsors CCCG '01 is supported by CRM, The Fields Institute, PIMS and the University of Waterloo. ------------- 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 tamaldey at cis.ohio-state.edu Mon Jun 11 17:53:58 2001 From: tamaldey at cis.ohio-state.edu (tamal dey) Date: Mon Jan 9 13:41:02 2006 Subject: Software for surface reconstruction from large data Message-ID: <200106112053.QAA06809@cis.ohio-state.edu> It is our pleasure to announce the release of the of the SuperCocone software that we developed at the Ohio State University for reconstructing surfaces from large data in the range of MILLION points. The implementation is based on CGAL and LEDA libraries and our recent paper in the 2001 IEEE Symposium in Parallel and Large Data Visualization and Graphics. The details can be found at http://www.cis.ohio-state.edu/~tamaldey/cocone.html ---Tamal K. Dey http://www.cis.ohio-state.edu/~tamaldey ------------- 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 yjc at photon.poly.edu Thu Jun 14 18:37:05 2001 From: yjc at photon.poly.edu (Yi-Jen Chiang) Date: Mon Jan 9 13:41:02 2006 Subject: WADS 2001 call for participation and preliminary program Message-ID: Please note that the early registration deadline has been moved from June 20 to July 9. ----------------------------------------------------------------------------- Call for Participation WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University For details on the conference program, registration and accommodation information, see the WADS Web site http://www.wads.org/. Deadlines: July 9: early registration Invited Lectures: M. J. Atallah (Purdue): Secure Multi-Party Computational Geometry F. T. Leighton (Akamai and MIT): The Challenges of Delivering Content on the Internet M. Yannakakis (Bell Laboratories): Approximation of Multiobjective Optimization Problems Conference Organization: R. Tamassia (Brown, conference chair), Y.-J. Chiang (Polytechnic, publicity chair), G. Shubina (Brown, local arrangements chair) Program Committee: F. Dehne (Carleton, co-chair), J.-R. Sack (Carleton, co-chair), R. Tamassia (Brown, co-chair), A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer -------------------------------------------------------------------------- WADS 2001 Preliminary Program Wednesday, August 8 Session 1: 9:30 - 10:30 Invited Lecture: Approximation of Multiobjective Optimization Problems. Mihalis Yannakakis Track A Track B Break: 10:30 - 11:00 Session 2A: 11:00 - 12:00 Session 2B: 11:00 - 12:00 Optimal, Suboptimal and Robust Algorithms Using the pseudo-dimension to analyze for Proximity Graphs. F. Hurtado, G. approximation algorithms for integer Liotta, H. Meijer programming. Philip M. Long Optimal Moebius Transformations for On the Complexity of Scheduling Conditional Information Visualization and Meshing. Real-Time Code. Samarjit Chakraborty and Marshall Bern and David Eppstein Thomas Erlebach and Lothar Thiele Session 3A: 1:30 - 2:30 Session 3B: 1:30 - 2:30 Time Responsive External Data Structures Fast fixed-parameter tractable algorithms for Moving Points. Pankaj K. Agarwal and for nontrivial generalizations of vertex Lars Arge and Jan Vahrenhold cover. Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos Voronoi Diagrams for Moving Disks and Minimizing clique-width for graphs of Applications. Menelaos I. Karavelas bounded tree-width. Wolfgang Espelage, Frank Gurski, Egon Wanke Break: 2:30 - 3:00 Session 4A: 3:00 - 4:30 Session 4B: 3:00 - 4:30 Complexity Bounds for Vertical Seller-Focused Algorithms for Online Decompositions of Linear Arrangements in . Auctioning. Amitabha Bagchi and Amitabh Vladlen Koltun Chaudhary and Rahul Garg and Michael T. Goodrich and Vijay Kumar Optimization Over Zonotopes and Training Competitive analysis of the LRFU paging Support Vector Machines. Marshall Bern and algorithm. Edith Cohen and Haim Kaplan and David Eppstein Uri Zwick Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. Pankaj K. Agarwal and Mark de Berg and Sariel Admission Control to Minimize Rejections. Har-Peled and Mark Overmars and Micha Avrim Blum and Adam Kalai and Jon Kleinberg Sharir and Jan Vahrenhold Thursday, August 9 Session 5: 9:30 - 10:30 Invited Lecture: Secure Multi-Party Computational Geometry. Mikhail J. Atallah (joint work with Wenliang (Kevin) Du) Track A Track B Break: 10:30 - 11:00 Session 6A: 11:00 - 12:00 Session 6B: 11:00 - 12:00 The Grid Placement Problem. P. Bose, A. A (7/8)-approximation algorithm for metric Maheshwari, P. Morin, and J. Morrison Max TSP. Refael Hassin and Shlomi Rubinstein On the Reflexivity of Point Sets. Esther M. Arkin and S\'andor P. Fekete and Ferran Approximating Multi-Objective Knapsack Hurtado and Joseph S. B. Mitchell Marc Noy Problems. Thomas Erlebach and Hans Kellerer and Vera Sacrist\'an and Saurabh Sethia and Ulrich Pferschy Session 7A: 1:30 - 2:30 Session 7B: 1:30 - 2:30 Visual Ranking of Link Structures. Ulrik Short and simple labels for small distances Brandes and Sabine Cornelsen and other functions. Haim Kaplan and Tova Milo A simple linear time algorithm for proper Fast Boolean matrix multiplication for box rectangular drawings of plane graphs. highly clustered data. Andreas Bjorklund Xin He and Andrzej Lingas Break: 2:30 - 3:00 Session 8A: 3:00 - 4:30 Session 8B: 3:00 - 4:30 Partitioning colored point sets into Higher-Dimensional Packing with Order monochromatic parts. Adrian Dumitrescu and Constraints. S\'andor P. Fekete and Janos Pach Ekkehard K\"ohler and J\"urgen Teich The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. Songrit Bin Packing with Item Fragmentation. Nir Maneewongvatana and David M. Mount Menakerman and Raphael Rom I/O-Efficient Shortest Path Queries in Practical Approximation Algorithms for Geometric Spanners. Anil Maheshwari and Separable Linear Programs. F.F. Dragan and Michiel Smid and Norbert Zeh A.B. Kahng and I.I. Mandoiu and S. Muddu Friday, August 10 Session 9: 9:30 - 10:30 Invited Lecture: The Challenges of Delivering Content on the Internet. F. Thomson Leighton Track A Track B Break: 10:30 - 11:00 Session 10A: 11:00 - 12:00 Session 10B: 11:00 - 12:00 A Linear-Time Algorithm for Computing Upward Embeddings and Orientations of Inversion Distance Between Signed Undirected Planar Graphs. Walter Didimo Permutations with an Experimental Study. and Maurizio Pizzonia David A. Bader and Bernard M.E. Moret and Mi Yan An Approach for Mixed Upward Planarization Computing Phylogenetic Roots with Bounded . Markus Eiglsperger and Michael Kaufmann Degrees and Errors . Zhi-Zhong Chen and Tao Jiang and Guo-Hui Lin Lunch: 12:00 - 1:30 Session 11A: 1:30 - 2:30 Session 11B: 1:30 - 2:30 A decomposition-based approach to layered manufacturing. Ivaylo Ilinkin and Ravi Search Trees with Relaxed Balance and Janardan and Jayanth Majhi and Joerg Near-Optimal Height. Rolf Fagerberg and Schwerdt and Michiel Smid and Ram Sriram Rune E. Jensen and Kim S. Larsen When Can You Fold a Map?. Esther M. Arkin and Michael A. Bender and Erik D. Demaine Succint Dynamic Data Structures. Rajeev and Martin L. Demaine and Joseph S. B. Raman and Venkatesh Raman and S. Srinivasa Mitchell and Saurabh Sethia and Steven S. Rao Skiena Break: 2:30 - 3:00 Session 12A: 3:00 - 4:00 Session 12B: 3:00 - 4:00 Two-Guard Walkability of Simple Polygons. Binay Bhattacharya, Asish Mukhopadhyay, Small Maximal Independent Sets and Faster Giri Narasimhan Exact Graph Coloring. David Eppstein Movement Planning in the Presence of On External-Memory Planar Depth First Flows. John Reif and Zheng Sun Search. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh -------------------------------------------------------------------------------------- ------------- 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 george at cs.ucy.ac.cy Fri Jun 15 13:45:08 2001 From: george at cs.ucy.ac.cy (George Angelos Papadopoulos) Date: Mon Jan 9 13:41:02 2006 Subject: Academic Vacancies: CS Dept., Univ. of Cyprus Message-ID: *** ANNOUNCEMENT OF ACADEMIC POSITIONS *** The University of Cyprus announces the following tenure track posts (Assistant Professor or Lecturer): DEPARTMENT OF COMPUTER SCIENCE 4 tenure track posts in the following fields of study: * Software Engineering * Computer Architecture * Information Systems * Computer Networks * Database Systems * Internet Technologies For all academic ranks, a Ph.D. from a recognized University is required. PLEASE NOTE: The languages of instruction are Greek and Turkish. Applicants need not be citizens of the Republic of Cyprus. The annual salaries for these positions (including the 13th salary) are: Assistant Professor (Scale A13-A14) CY22,939 - CY30,914 Lecturer (Scale A12-A13) CY19,372 - CY28,373 (At present 1 CY = 1.0769 sterling and 1 CY = 1.5370 dollars) Interested individuals must submit the following items by Friday 6th of July 2001: I A letter stating the department, the academic rank or ranks for which the applicant is interested in, the field or fields of study and the date when he/she may be able to assume duties in the event of selection. II A Curriculum Vitae (6 copies). III A brief summary (not exceeding three pages) of their research work as well as a description of plans for future research (6 copies). IV A list of publications (6 copies). V Copies of representative publications (6 copies if possible). VI Copies of their qualifications. In addition, the applicants must request three academic referees to send letters of recommendation directly to the University; the names and addresses of these referees must be submitted with the application. Additional confidential information may be sought. The Curriculum Vitae and the brief summary of the research work should be written in Greek or Turkish and in one international language, preferably English. Applications, other documents and reference letters submitted in the past will NOT be considered and must be re-submitted. Applications that are not complete will not be considered. The above must reach the University by 2 pm Friday 6th of July 2001 at the following address: The Registrar University of Cyprus P O Box 20537 CY-1678 Nicosia CYPRUS Tel: 02-892000 Fax: 02-892100 For more details and other information interested individuals may contact the Head of the Department of Computer Science, Associate Professor Antonis Kakas: Tel: +357-2-892231 Fax: +357-2-339062 E-mail: antonis@cs.ucy.ac.cy ------------- 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 pankaj at cs.duke.edu Thu Jun 21 13:19:56 2001 From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal) Date: Mon Jan 9 13:41:02 2006 Subject: Steering Committee Election Message-ID: <3B321EAC.6098F83D@cs.duke.edu> Dear CG Community, You may recall that the Computational Geometry Steering Committee was elected in May of 1999 for a term of two years. It is therefore time to elect a new committee. As the outgoing General Secretary of the Steering Committee, who will not be a candidate for the next steering committee, I write you now to call for nominations. The current committee is: Pankaj K. Agarwal Jean-Daniel Boissonnat Michael T. Goodrich Joseph S. B. Mitchell Jack Snoeyink The committee organizes the annual SoCG (Symposium on Computational Geometry), conducts its business meeting, serves as liaisons to other organizations (e.g., FCRC), and so on. I will conduct the election in the same manner as before. Any member of the community may nominate any other member by sending e-mail directly to me by the deadline (see below). Nominations for past committee members are allowed. It is not necessary to check with those whom you nominate. After nominations have been received, I will contact those nominated and ask them if they are willing to serve. A list of candidates will then be prepared and circulated via compgeom-announce. The community will be asked to vote for five from the list. The five with the most votes will then become the new Steering Committee. It will be up to them to select a Chair and otherwise organize themselves. To nominate someone, send email to pankaj@cs.duke.edu with "Subject: Nomination" by 11:59PM Sunday July 15, 2001. We look forward to hearing from you! Pankaj K. Agarwal -- ------------------------------------------------------------------- Pankaj K. Agarwal Dept. of Computer Science McLean Professor of Computer Science D207 LSRC Bldg Phone (919) 660-6540 Box 90129 e-mail: pankaj@cs.duke.edu Duke University url: http://www.cs.duke.edu/~pankaj Durham, NC 27708-0129 ------------- 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 yjc at photon.poly.edu Tue Jun 26 18:26:38 2001 From: yjc at photon.poly.edu (Yi-Jen Chiang) Date: Mon Jan 9 13:41:02 2006 Subject: WADS 2001 call for participation and preliminary program Message-ID: Please note that the deadlines for early registration and for dorm room reservation are both July 9. ----------------------------------------------------------------------------- Call for Participation WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University For details on the conference program, registration and accommodation information, see the WADS Web site http://www.wads.org/. Deadlines: July 9: Early Registration July 9: Dorm Room Reservation Invited Lectures: M. J. Atallah (Purdue): Secure Multi-Party Computational Geometry F. T. Leighton (Akamai and MIT): The Challenges of Delivering Content on the Internet M. Yannakakis (Bell Laboratories): Approximation of Multiobjective Optimization Problems Conference Organization: R. Tamassia (Brown, conference chair), Y.-J. Chiang (Polytechnic, publicity chair), G. Shubina (Brown, local arrangements chair) Program Committee: F. Dehne (Carleton, co-chair), J.-R. Sack (Carleton, co-chair), R. Tamassia (Brown, co-chair), A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer -------------------------------------------------------------------------- WADS 2001 Preliminary Program Wednesday, August 8 Session 1: 9:30 - 10:30 Invited Lecture: Approximation of Multiobjective Optimization Problems. Mihalis Yannakakis Track A Track B Break: 10:30 - 11:00 Session 2A: 11:00 - 12:00 Session 2B: 11:00 - 12:00 Optimal, Suboptimal and Robust Algorithms Using the pseudo-dimension to analyze for Proximity Graphs. F. Hurtado, G. approximation algorithms for integer Liotta, H. Meijer programming. Philip M. Long Optimal Moebius Transformations for On the Complexity of Scheduling Conditional Information Visualization and Meshing. Real-Time Code. Samarjit Chakraborty and Marshall Bern and David Eppstein Thomas Erlebach and Lothar Thiele Session 3A: 1:30 - 2:30 Session 3B: 1:30 - 2:30 Time Responsive External Data Structures Fast fixed-parameter tractable algorithms for Moving Points. Pankaj K. Agarwal and for nontrivial generalizations of vertex Lars Arge and Jan Vahrenhold cover. Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos Voronoi Diagrams for Moving Disks and Minimizing clique-width for graphs of Applications. Menelaos I. Karavelas bounded tree-width. Wolfgang Espelage, Frank Gurski, Egon Wanke Break: 2:30 - 3:00 Session 4A: 3:00 - 4:30 Session 4B: 3:00 - 4:30 Complexity Bounds for Vertical Seller-Focused Algorithms for Online Decompositions of Linear Arrangements in . Auctioning. Amitabha Bagchi and Amitabh Vladlen Koltun Chaudhary and Rahul Garg and Michael T. Goodrich and Vijay Kumar Optimization Over Zonotopes and Training Competitive analysis of the LRFU paging Support Vector Machines. Marshall Bern and algorithm. Edith Cohen and Haim Kaplan and David Eppstein Uri Zwick Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. Pankaj K. Agarwal and Mark de Berg and Sariel Admission Control to Minimize Rejections. Har-Peled and Mark Overmars and Micha Avrim Blum and Adam Kalai and Jon Kleinberg Sharir and Jan Vahrenhold Thursday, August 9 Session 5: 9:30 - 10:30 Invited Lecture: Secure Multi-Party Computational Geometry. Mikhail J. Atallah (joint work with Wenliang (Kevin) Du) Track A Track B Break: 10:30 - 11:00 Session 6A: 11:00 - 12:00 Session 6B: 11:00 - 12:00 The Grid Placement Problem. P. Bose, A. A (7/8)-approximation algorithm for metric Maheshwari, P. Morin, and J. Morrison Max TSP. Refael Hassin and Shlomi Rubinstein On the Reflexivity of Point Sets. Esther M. Arkin and S\'andor P. Fekete and Ferran Approximating Multi-Objective Knapsack Hurtado and Joseph S. B. Mitchell Marc Noy Problems. Thomas Erlebach and Hans Kellerer and Vera Sacrist\'an and Saurabh Sethia and Ulrich Pferschy Session 7A: 1:30 - 2:30 Session 7B: 1:30 - 2:30 Visual Ranking of Link Structures. Ulrik Short and simple labels for small distances Brandes and Sabine Cornelsen and other functions. Haim Kaplan and Tova Milo A simple linear time algorithm for proper Fast Boolean matrix multiplication for box rectangular drawings of plane graphs. highly clustered data. Andreas Bjorklund Xin He and Andrzej Lingas Break: 2:30 - 3:00 Session 8A: 3:00 - 4:30 Session 8B: 3:00 - 4:30 Partitioning colored point sets into Higher-Dimensional Packing with Order monochromatic parts. Adrian Dumitrescu and Constraints. S\'andor P. Fekete and Janos Pach Ekkehard K\"ohler and J\"urgen Teich The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. Songrit Bin Packing with Item Fragmentation. Nir Maneewongvatana and David M. Mount Menakerman and Raphael Rom I/O-Efficient Shortest Path Queries in Practical Approximation Algorithms for Geometric Spanners. Anil Maheshwari and Separable Linear Programs. F.F. Dragan and Michiel Smid and Norbert Zeh A.B. Kahng and I.I. Mandoiu and S. Muddu Friday, August 10 Session 9: 9:30 - 10:30 Invited Lecture: The Challenges of Delivering Content on the Internet. F. Thomson Leighton Track A Track B Break: 10:30 - 11:00 Session 10A: 11:00 - 12:00 Session 10B: 11:00 - 12:00 A Linear-Time Algorithm for Computing Upward Embeddings and Orientations of Inversion Distance Between Signed Undirected Planar Graphs. Walter Didimo Permutations with an Experimental Study. and Maurizio Pizzonia David A. Bader and Bernard M.E. Moret and Mi Yan An Approach for Mixed Upward Planarization Computing Phylogenetic Roots with Bounded . Markus Eiglsperger and Michael Kaufmann Degrees and Errors . Zhi-Zhong Chen and Tao Jiang and Guo-Hui Lin Lunch: 12:00 - 1:30 Session 11A: 1:30 - 2:30 Session 11B: 1:30 - 2:30 A decomposition-based approach to layered manufacturing. Ivaylo Ilinkin and Ravi Search Trees with Relaxed Balance and Janardan and Jayanth Majhi and Joerg Near-Optimal Height. Rolf Fagerberg and Schwerdt and Michiel Smid and Ram Sriram Rune E. Jensen and Kim S. Larsen When Can You Fold a Map?. Esther M. Arkin and Michael A. Bender and Erik D. Demaine Succint Dynamic Data Structures. Rajeev and Martin L. Demaine and Joseph S. B. Raman and Venkatesh Raman and S. Srinivasa Mitchell and Saurabh Sethia and Steven S. Rao Skiena Break: 2:30 - 3:00 Session 12A: 3:00 - 4:00 Session 12B: 3:00 - 4:00 Two-Guard Walkability of Simple Polygons. Binay Bhattacharya, Asish Mukhopadhyay, Small Maximal Independent Sets and Faster Giri Narasimhan Exact Graph Coloring. David Eppstein Movement Planning in the Presence of On External-Memory Planar Depth First Flows. John Reif and Zheng Sun Search. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh -------------------------------------------------------------------------------------- ------------- 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.