WADS 2001: list of accepted papers

[Yi-Jen Chiang]

The following papers have been accepted to the 7th Workshop on
Algorithms and Data Structures (WADS 2001), to be held August 8-10,
2001, at Brown University, Providence, Rhode Island, USA. For more
information about the conference, please see the web page

http://www.wads.org/.

------------------------

A Linear-Time Algorithm for Computing Inversion Distance Between Signed Permutations with an Experimental Study
David A. Bader and Bernard M.E. Moret and Mi Yan

Admission Control to Minimize Rejections
Avrim Blum and Adam Kalai and Jon Kleinberg

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos

A simple linear time algorithm for proper box rectangular drawings of plane grapghs
Xin He

Bin Packing with Item Fragmentation
Nir Menakerman and Raphael Rom

Minimizing clique-width for graphs of bounded tree-width
Wolfgang Espelage and Frank Gurski and Egon Wanke

Seller-Focused Algorithms for Online Auctioning
A. Bagchi and A. Chaudhary and R. Garg and M. T. Goodrich and V. Kumar

Upward Embeddings and Orientations of Undirected Planar Graphs
Walter Didimo and Maurizio Pizzonia

Using the pseudo-dimension to analyze approximation algorithms for integer programming
Philip M. Long

Higher-Dimensional Packing with Order Constraints
S\'andor P. Fekete and Ekkehard K\"ohler and J\"urgen Teich

Small Maximal Independent Sets and Faster Exact Graph Coloring
David Eppstein

Optimal Moebius Transformations for Information Visualization and Meshing
Marshall Bern and David Eppstein

On the Reflexivity of Point Sets
E. M. Arkin and S. P. Fekete and F. Hurtado and J. S. B. Mitchell and M. Noy and V. Sacrist\'an and S. Sethia

A decomposition-based approach to layered manufacturing
Ivaylo Ilinkin and Ravi Janardan and Jayanth Majhi and Joerg Schwerdt and Michiel Smid and Ram Sriram

Computing Phylogenetic Roots with Bounded Degrees and Errors 
Zhi-Zhong Chen and Tao Jiang and Guo-Hui Lin

A (7/8)-approximation algorithm for metric Max TSP
Refael Hassin and Shlomi Rubinstein

Approximating Multi-Objective Knapsack Problems
Thomas Erlebach and Hans Kellerer and Ulrich Pferschy

Visual Ranking of Link Structures
Ulrik Brandes and Sabine Cornelsen

Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
Vladlen Koltun

Search Trees with Relaxed Balance and Near-Optimal Height
Rolf Fagerberg and Rune E. Jensen and Kim S. Larsen

Voronoi Diagrams for Moving Disks and Applications
Menelaos I. Karavelas

Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
P. K. Agarwal and M. de Berg and S. Har-Peled and M. Overmars and M. Sharir and J. Vahrenhold

Time Responsive External Data Structures for Moving Points
Pankaj K. Agarwal and Lars Arge and Jan Vahrenhold

The Grid Placement Problem
P. Bose and A. Maheshwari and P. Morin and J. Morrison

An Approach for Mixed Upward Planarization 
Markus Eiglsperger and Michael Kaufmann

Short and simple labels for small distances and other functions
Haim Kaplan and Tova Milo

Competitive analysis of the LRFU paging algorithm
Edith Cohen and Haim Kaplan and Uri Zwick

I/O-Efficient Shortest Path Queries in Geometric Spanners
Anil Maheshwari and Michiel Smid and Norbert Zeh

When Can You Fold a Map?
E. M. Arkin and M. A. Bender and E. D. Demaine and M. L. Demaine and J. S. B. Mitchell and S. Sethia and S. S. Skiena

Optimal, Suboptimal and Robust Algorithms for Proximity Graphs
F. Hurtado and G. Liotta and H. Meijer

On External-Memory Planar Depth First Search
Lars Arge and Ulrich Meyer and Laura Toma and Norbert Zeh

Movement Planning in the Presence of Flows
John Reif and Zheng Sun

The Analysis of a Probabilistic Approach to Nearest Neighbor Searching
Songrit Maneewongvatana and David M. Mount

Optimization Over Zonotopes and Training Support Vector Machines
Marshall Bern and David Eppstein

Practical Approximation Algorithms for Separable Packing Linear Programs
F.F. Dragan and A.B. Kahng and I.I. Mandoiu and S. Muddu 

Two-Guard Walkability of Simple Polygons
Binay Bhattacharya and Asish Mukhopadhyay and Giri Narasimhan

Fast Boolean matrix multiplication for highly clustered data
Andreas Bjorklund and Andrzej Lingas

On the Complexity of Scheduling Conditional Real-Time Code
Samarjit Chakraborty and Thomas Erlebach and Lothar Thiele

Succinct Dynamic Data Structures
Rajeev Raman and Venkatesh Raman and S. Srinivasa Rao

Partitioning colored point sets into monochromatic parts
Adrian Dumitrescu and Janos Pach


-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
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.