ALENEX A

16 papers

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