ALENEX A

21 papers

YearTitle / Authors
1999A Case Study on the Cost of Geometric Computing.
Stefan Schirra
1999A Self Organizing Bin Packing Heuristic.
János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
1999Accessing the Internal Organization of Data Structures in the JDSL Library.
Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia
1999Adaptive Algorithms for Cache-Efficient Trie Search.
Anurag Acharya, Huican Zhu, Kai Shen
1999Algorithm Engineering and Experimentation, International Workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers
Michael T. Goodrich, Catherine C. McGeoch
1999Algorithms for Restoration Planning in a Telecommunications Network.
Sebastian Cwilich, Mei Deng, David F. Lynch, S. J. Philips, Jeffery R. Westbrook
1999Binary Space Partitions in Plücker Space.
David M. Mount, Fan-Tao Pu
1999Circular Drawings of Biconnected Graphs.
Janet M. Six, Ioannis G. Tollis
1999Computing the
Tetsuo Shibuya
1999Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning.
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov
1999Designing Practical Efficient Algorithms for Symmetric Multiprocessors.
David R. Helman, Joseph F. JáJá
1999Efficient Bulk Operations on Dynamic R-trees.
Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter
1999Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes.
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
1999Fast Priority Queues for Cached Memory.
Peter Sanders
1999Finding the Right Cutting Planes for the TSP.
Matthew S. Levine
1999Heuristics and Experimental Design for Bigraph Crossing Number Minimization.
Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
1999Image Watermarking for Copyright Protection.
Gregory L. Heileman, Carlos E. Pizano, Chaouki T. Abdallah
1999Implementing Weighted b-Matching Algorithms: Insights from a Computational Study.
Matthias Müller-Hannemann, Alexander Schwartz
1999Object-Oriented Design of Graph Oriented Data Structures.
Maurizio Pizzonia, Giuseppe Di Battista
1999Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm.
Martin Zachariasen, Pawel Winter
1999Practical Point-in-Polygon Tests Using CSG Representations of Polygons.
Robert J. Walker, Jack Snoeyink