Conferences in DBLP

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

1. Markus Behle, Friedrich Eisenbrand
   0/1 Vertex and Facet Enumeration with BDDs. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
2. Kamesh Madduri, David A. Bader, Jonathan W. Berry, Joseph R. Crobak
   An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
3. Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes
   In Transit to Constant Time Shortest-Path Queries in Road Networks. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
4. Juha Kärkkäinen, Joong Chae Na
   Faster Filters for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
5. Herman J. Haverkort, Laura Toma, Yi Zhuang
   Computing Visibility on Terrains in External Memory. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
6. Tommi A. Junttila, Petteri Kaski
   Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
7. Shen Pan, Cary Cherng, Kevin Dick, Richard E. Ladner
   Algorithms to Take Advantage of Hardware Prefetching. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
8. Melih Onus, Andréa Richa, Christian Scheideler
   Linearization: Locally Self-Stabilizing Sorting in Graphs. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
9. Yoav Amit, Joseph S. B. Mitchell, Eli Packer
   Locating Guards for Visibility Coverage of Polygons. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
10. Daisuke Okanohara, Kunihiko Sadakane
    Practical Entropy-Compressed Rank/Select Dictionary. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
    
11. Deepak Ajwani, Ulrich Meyer, Vitaly Osipov
    Improved External Memory BFS Implementation. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
    
12. Peter Sanders, Frederik Transier
    Intersection in Integer Inverted Indices. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
    
13. Martin Kutz, Pascal Schweitzer
    ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
    
14. Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner
    Computing Many-to-Many Shortest Paths Using Highway Hierarchies. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
    
15. Fred S. Annexstein, Ken Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa
    Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]