2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9781611972870

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Locating Guards for Visibility Coverage of Polygons

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972870.12 ◽

2007 ◽

pp. 120-134 ◽

Cited By ~ 12

Author(s):

Yoav Amit ◽

Joseph S. B. Mitchell ◽

Eli Packer

Download Full-text

Computing Many-to-Many Shortest Paths Using Highway Hierarchies

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972870.4 ◽

2007 ◽

pp. 36-45 ◽

Cited By ~ 32

Author(s):

Sebastian Knopp ◽

Peter Sanders ◽

Dominik Schultes ◽

Frank Schulz ◽

Dorothea Wagner

Keyword(s):

Shortest Paths

Download Full-text

Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972870.13 ◽

2007 ◽

pp. 135-149 ◽

Cited By ~ 67

Author(s):

Tommi Junttila ◽

Petteri Kaski

Keyword(s):

Sparse Graphs

Download Full-text

An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972870.3 ◽

2007 ◽

pp. 23-35 ◽

Cited By ~ 37

Author(s):

Kamesh Madduri ◽

David A. Bader ◽

Jonathan W. Berry ◽

Joseph R. Crobak

Keyword(s):

Experimental Study ◽

Shortest Path ◽

Large Scale ◽

Shortest Path Algorithm

Download Full-text

Linearization: Locally Self-Stabilizing Sorting in Graphs

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972870.10 ◽

2007 ◽

pp. 99-108 ◽

Cited By ~ 30

Author(s):

Melih Onus ◽

Andrea Richa ◽

Christian Scheideler

Download Full-text

Algorithms to Take Advantage of Hardware Prefetching

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972870.9 ◽

2007 ◽

pp. 91-98 ◽

Cited By ~ 3

Author(s):

Shen Pan ◽

Cary Cherng ◽

Kevin Dick ◽

Richard E. Ladner

Keyword(s):

Hardware Prefetching

Download Full-text

Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972870.11 ◽

2007 ◽

pp. 109-119 ◽

Cited By ~ 2

Author(s):

Fred Annexstein ◽

Kenneth A. Berman ◽

Svetlana Strunjaš ◽

Chad Yoshikawa

Download Full-text

Intersection in Integer Inverted Indices

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972870.7 ◽

2007 ◽

pp. 71-83 ◽

Cited By ~ 22

Author(s):

Peter Sanders ◽

Frederik Transier

Keyword(s):

Inverted Indices

Download Full-text

0/1 vertex and facet enumeration with BDDs

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972870.15 ◽

2007 ◽

pp. 158-165 ◽

Cited By ~ 17

Author(s):

Markus Behle ◽

Friedrich Eisenbrand

Download Full-text

Improved external memory BFS implementations

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972870.1 ◽

2007 ◽

pp. 3-12 ◽

Cited By ~ 13

Author(s):

Deepak Ajwani ◽

Ulrich Meyer ◽

Vitaly Osipov

Keyword(s):

External Memory

Download Full-text

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Society For Industrial And Applied Mathematics

Locating Guards for Visibility Coverage of Polygons

Computing Many-to-Many Shortest Paths Using Highway Hierarchies

Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs

An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances

Linearization: Locally Self-Stabilizing Sorting in Graphs

Algorithms to Take Advantage of Hardware Prefetching

Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service

Intersection in Integer Inverted Indices

0/1 vertex and facet enumeration with BDDs

Improved external memory BFS implementations

2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)
Latest Publications