WADS 2001 call for participation and preliminary program

Yi-Jen Chiang yjc at photon.poly.edu
Thu Jun 14 18:37:05 PDT 2001

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


        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/.

  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
 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

 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
                                   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
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.

More information about the Compgeom-announce mailing list