
Conferences in DBLP
 Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Efficient Implementation of the WARMUP Algorithm for the Construction of LengthRestricted Prefix Codes. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:117 [Conf]
 Matthias MüllerHannemann, Alexander Schwartz
Implementing Weighted bMatching Algorithms: Insights from a Computational Study. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:1836 [Conf]
 David R. Helman, Joseph JáJá
Designing Practical Efficient Algorithms for Symmetric Multiprocessors. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:3756 [Conf]
 Janet M. Six, Ioannis G. Tollis
Circular Drawings of Biconnected Graphs. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:5773 [Conf]
 Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
Heuristics and Experimental Design for Bigraph Crossing Number Minimization. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:7493 [Conf]
 David M. Mount, FanTao Pu
Binary Space Partitions in Plücker Space. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:94113 [Conf]
 Robert J. Walker, Jack Snoeyink
Practical PointinPolygon Tests Using CSG Representations of Polygons. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:114123 [Conf]
 Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia
Accessing the Internal Organization of Data Structures in the JDSL Library. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:124139 [Conf]
 Maurizio Pizzonia, Giuseppe Di Battista
ObjectOriented Design of Graph Oriented Data Structures. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:140155 [Conf]
 Stefan Schirra
A Case Study on the Cost of Geometric Computing. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:156176 [Conf]
 Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov
Design and Implementation of the FiducciaMattheyses Heuristic for VLSI Netlist Partitioning. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:177193 [Conf]
 S. Cwilich, M. Deng, D. F. Lynch, S. J. Philips, Jeffery Westbrook
Algorithms for Restoration Planning in a Telecommunications Network. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:194209 [Conf]
 Tetsuo Shibuya
Computing the n × m Shortest Paths Efficently. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:210225 [Conf]
 Gregory L. Heileman, Carlos E. Pizano, Chaouki T. Abdallah
Image Watermarking for Copyright Protection. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:226245 [Conf]
 János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
A Self Organizing Bin Packing Heuristic. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:246265 [Conf]
 Matthew S. Levine
Finding the Right Cutting Planes for the TSP. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:266281 [Conf]
 Martin Zachariasen, Pawel Winter
ObstacleAvoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:282295 [Conf]
 Anurag Acharya, Huican Zhu, Kai Shen
Adaptive Algorithms for CacheEfficient Trie Search. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:296311 [Conf]
 Peter Sanders
Fast Priority Queues for Cached Memory. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:312327 [Conf]
 Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter
Efficient Bulk Operations on Dynamic Rtrees. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:328348 [Conf]
