The SCEAS System
Navigation Menu

Conferences in DBLP

Algorithm Engineering and Experimentation (ALENEX) (alenex)
2003 (conf/alenex/2003)

  1. Lars Arge
    Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:- [Conf]
  2. Erik D. Demaine
    Open Problems from ALENEX 2003. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:- [Conf]
  3. David Applegate, Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor
    The Cutting-Stock Approach to Bin Packing: Theory and Experiments. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:1-15 [Conf]
  4. Christos Gkantsidis, Milena Mihail, Ellen W. Zegura
    The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:16-25 [Conf]
  5. John Hershberger, Matthew Maxel, Subhash Suri
    Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:26-36 [Conf]
  6. Olivier Devillers, Sylvain Pion
    Efficient Exact Geometric Predicates for Delauny Triangulations. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:37-44 [Conf]
  7. Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim
    Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:45-55 [Conf]
  8. F. Betul Atalay, David M. Mount
    Interpolation over Light Fields with Applications in Computer Graphics. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:56-68 [Conf]
  9. Gonzalo Navarro, Rodrigo Paredes
    Practical Constraction of Metric t-Spanners. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:69-81 [Conf]
  10. Lars Arge, Andrew Danner, Sha-Mayn Teh
    I/O-efficient Point Location Using Persistent B-Trees. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:82-92 [Conf]
  11. Ranjan Sinha, Justin Zobel
    Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:93-105 [Conf]
  12. Luzi Anderegg, Stephan Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer
    Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:106-118 [Conf]
  13. Mauricio G. C. Resende, Renato Fonseca F. Werneck
    On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:119-127 [Conf]
  14. Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang
    Fast Prefix Matching of Bounded Strings. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:128-140 [Conf]
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002