Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. WADS 2001: Providence, RI, USA
- Frank K. H. A. Dehne, Jörg-Rüdiger Sack
, Roberto Tamassia:
Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings. Lecture Notes in Computer Science 2125, Springer 2001, ISBN 3-540-42423-7
Session 1 - Invited Talk
- Mihalis Yannakakis:
Approximation of Multiobjective Optimization Problems. 1
Session 2A
- Ferran Hurtado, Giuseppe Liotta, Henk Meijer:
Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. 2-13 - Marshall W. Bern, David Eppstein:
Optimal Möbius Transformations for Information Visualization and Meshing. 14-25
Session 2B
- Philip M. Long:
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming. 26-37 - Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele:
On the Complexity of Scheduling Conditional Real-Time Code. 38-49
Session 3A
- Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold:
Time Responsive External Data Structures for Moving Points. 50-61 - Menelaos I. Karavelas:
Voronoi Diagrams for Moving Disks and Applications. 62-74
Session 3B
- Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. 75-86 - Wolfgang Espelage, Frank Gurski, Egon Wanke:
Deciding Clique-Width for Graphs of Bounded Tree-Width. 87-98
Session 4A
- Vladlen Koltun:
Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions. 99-110 - Marshall W. Bern, David Eppstein:
Optimization over Zonotopes and Training Support Vector Machines. 111-121 - Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold:
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. 122-134
Session 4B
- Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar:
Seller-Focused Algorithms for Online Auctioning. 135-147 - Edith Cohen, Haim Kaplan, Uri Zwick:
Competitive Analysis of the LRFU Paging Algorithm. 148-154 - Avrim Blum, Adam Kalai, Jon M. Kleinberg:
Admission Control to Minimize Rejections. 155-164
Session 5 - Invited Talk
- Mikhail J. Atallah, Wenliang Du:
Secure Multi-party Computational Geometry. 165-179
Session 6A
- Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison:
The Grid Placement Problem. 180-191 - Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia:
On the Reflexivity of Point Sets. 192-204
Session 6B
- Refael Hassin, Shlomi Rubinstein:
A 7/8-Approximation Algorithm for Metric Max TSP. 205-209 - Thomas Erlebach, Hans Kellerer, Ulrich Pferschy:
Approximating Multi-objective Knapsack Problems. 210-221
Session 7A
- Ulrik Brandes, Sabine Cornelsen:
Visual Ranking of Link Structures. 222-233 - Xin He:
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs. 234-245
Session 7B
- Haim Kaplan, Tova Milo:
Short and Simple Labels for Small Distances and Other Functions. 246-257 - Andreas Björklund, Andrzej Lingas:
Fast Boolean Matrix Multiplication for Highly Clustered Data. 258-263
Session 8A
- Adrian Dumitrescu, János Pach:
Partitioning Colored Point Sets into Monochromatic Parts. 264-275 - Songrit Maneewongvatana, David M. Mount:
The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. 276-286 - Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
I/O-Efficient Shortest Path Queries in Geometric Spanners. 287-299
Session 8B
- Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Higher-Dimensional Packing with Order Constraints. 300-312 - Nir Menakerman, Raphael Rom:
Bin Packing with Item Fragmentation. 313-324 - Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky:
Practical Approximation Algorithms for Separable Packing Linear Programs. 325-337
Session 9 - Invited Talk
- Frank Thomson Leighton:
The Challenges of Delivering Content on the Internet. 338
Session 10A
- Walter Didimo, Maurizio Pizzonia:
Upward Embeddings and Orientations of Undirected Planar Graphs. 339-351 - Markus Eiglsperger, Michael Kaufmann:
An Approach for Mixed Upward Planarization. 352-364
Session 10B
- David A. Bader, Bernard M. E. Moret, Mi Yan:
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. 365-376 - Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin:
Computing Phylogenetic Roots with Bounded Degrees and Errors. 377-388
Session 11A
- Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram:
A Decomposition-Based Approach to Layered Manufacturing. 389-400 - Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena:
When Can You Fold a Map? 401-413
Session 11B
- Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen:
Search Trees with Relaxed Balance and Near-Optimal Height. 414-425 - Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Dynamic Data Structures. 426-437
Session 12A
- Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan:
Optimal Algorithms for Two-Guard Walkability of Simple Polygons. 438-449 - John H. Reif, Zheng Sun:
Movement Planning in the Presence of Flows. 450-461
Session 12B
- David Eppstein:
Small Maximal Independent Sets and Faster Exact Graph Coloring. 462-470 - Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh:
On External-Memory Planar Depth First Search. 471-482
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
