![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
ALENEX 2007: New Orleans, Louisiana, USA
- Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007. SIAM 2007, ISBN 978-1-61197-287-0
- Deepak Ajwani, Ulrich Meyer, Vitaly Osipov:
Improved External Memory BFS Implementation. - Herman J. Haverkort, Laura Toma, Yi Zhuang:
Computing Visibility on Terrains in External Memory. - 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. - Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz
, Dorothea Wagner:
Computing Many-to-Many Shortest Paths Using Highway Hierarchies. - Hannah Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes:
In Transit to Constant Time Shortest-Path Queries in Road Networks. - Daisuke Okanohara, Kunihiko Sadakane:
Practical Entropy-Compressed Rank/Select Dictionary. - Peter Sanders, Frederik Transier:
Intersection in Integer Inverted Indices. - Juha Kärkkäinen, Joong Chae Na:
Faster Filters for Approximate String Matching. - Shen Pan, Cary Cherng, Kevin Dick, Richard E. Ladner
:
Algorithms to Take Advantage of Hardware Prefetching. - Melih Onus, Andréa W. Richa, Christian Scheideler:
Linearization: Locally Self-Stabilizing Sorting in Graphs. - Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa:
Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. - Yoav Amit, Joseph S. B. Mitchell, Eli Packer:
Locating Guards for Visibility Coverage of Polygons. - Tommi A. Junttila, Petteri Kaski:
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. - Martin Kutz, Pascal Schweitzer
:
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm. - Markus Behle, Friedrich Eisenbrand:
0/1 Vertex and Facet Enumeration with BDDs.
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.