ALENEX 1999: Baltimore, MD, USA

@proceedings{DBLP:conf/alenex/1999,
  editor    = {Michael T. Goodrich and
               Catherine C. McGeoch},
  title     = {Algorithm Engineering and Experimentation, International Workshop
               ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected
               Papers},
  booktitle = {ALENEX},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1619},
  year      = {1999},
  isbn      = {3-540-66227-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Combinatorial Algorithms

• Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
  Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. 1-17
  
• Matthias Müller-Hannemann, Alexander Schwartz:
  Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. 18-36
  
• David R. Helman, Joseph JáJá:
  Designing Practical Efficient Algorithms for Symmetric Multiprocessors. 37-56
  

Computational Geometry

• Janet M. Six, Ioannis G. Tollis:
  Circular Drawings of Biconnected Graphs. 57-73
  
• Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh:
  Heuristics and Experimental Design for Bigraph Crossing Number Minimization. 74-93
  
• David M. Mount, Fan-Tao Pu:
  Binary Space Partitions in Plücker Space. 94-113
  
• Robert J. Walker, Jack Snoeyink:
  Practical Point-in-Polygon Tests Using CSG Representations of Polygons. 114-123
  

Software and Applications

• Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia:
  Accessing the Internal Organization of Data Structures in the JDSL Library. 124-139
  
• Maurizio Pizzonia, Giuseppe Di Battista:
  Object-Oriented Design of Graph Oriented Data Structures. 140-155
  
• Stefan Schirra:
  A Case Study on the Cost of Geometric Computing. 156-176
  
• Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov:
  Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning. 177-193
  
• S. Cwilich, M. Deng, D. F. Lynch, S. J. Philips, Jeffery Westbrook:
  Algorithms for Restoration Planning in a Telecommunications Network. 194-209
  
• Tetsuo Shibuya:
  Computing the n × m Shortest Paths Efficently. 210-225
  
• Gregory L. Heileman, Carlos E. Pizano, Chaouki T. Abdallah:
  Image Watermarking for Copyright Protection. 226-245
  

Algorithms for NP-Hard Problems

• János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber:
  A Self Organizing Bin Packing Heuristic. 246-265
  
• Matthew S. Levine:
  Finding the Right Cutting Planes for the TSP. 266-281
  
• Martin Zachariasen, Pawel Winter:
  Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. 282-295
  

Data Structures

• Anurag Acharya, Huican Zhu, Kai Shen:
  Adaptive Algorithms for Cache-Efficient Trie Search. 296-311
  
• Peter Sanders:
  Fast Priority Queues for Cached Memory. 312-327
  
• Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter:
  Efficient Bulk Operations on Dynamic R-trees. 328-348
  

Last update Tue May 22 03:55:59 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page