Experimental Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

38

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By Springer International Publishing

9783319079585, 9783319079592

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An Evaluation of Dynamic Labeling Schemes for Tree Networks

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07959-2_17 ◽

2014 ◽

pp. 199-210 ◽

Author(s):

Noy Rotbart ◽

Marcos Vaz Salles ◽

Iasonas Zotos

Keyword(s):

Tree Networks ◽

Labeling Schemes

Download Full-text

Faster Compressed Suffix Trees for Repetitive Text Collections

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07959-2_36 ◽

2014 ◽

pp. 424-435 ◽

Author(s):

Gonzalo Navarro ◽

Alberto Ordóñez

Keyword(s):

Suffix Trees ◽

Text Collections

Download Full-text

Tree-Based Coarsening and Partitioning of Complex Networks

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07959-2_31 ◽

2014 ◽

pp. 364-375 ◽

Author(s):

Roland Glantz ◽

Henning Meyerhenke ◽

Christian Schulz

Keyword(s):

Complex Networks

Download Full-text

Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07959-2_10 ◽

2014 ◽

pp. 111-122 ◽

Author(s):

Stephan Erb ◽

Moritz Kobitzsch ◽

Peter Sanders

Keyword(s):

Shortest Paths ◽

Download Full-text

Partitioning Complex Networks via Size-Constrained Clustering

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07959-2_30 ◽

2014 ◽

pp. 351-363 ◽

Author(s):

Henning Meyerhenke ◽

Peter Sanders ◽

Christian Schulz

Keyword(s):

Complex Networks ◽

Constrained Clustering

Download Full-text

Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07959-2_14 ◽

2014 ◽

pp. 162-173 ◽

Author(s):

David Eppstein ◽

Michael T. Goodrich ◽

Michael Mitzenmacher ◽

Paweł Pszona

Keyword(s):

Download Full-text

From Theory to Practice: Plug and Play with Succinct Data Structures

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07959-2_28 ◽

2014 ◽

pp. 326-337 ◽

Author(s):

Simon Gog ◽

Timo Beller ◽

Alistair Moffat ◽

Matthias Petri

Keyword(s):

Data Structures ◽

Succinct Data Structures ◽

Plug And Play ◽

Theory To Practice

Download Full-text

Selecting Data for Experiments: Past, Present and Future

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07959-2_1 ◽

2014 ◽

pp. 1-9

Author(s):

Jon Bentley

Download Full-text

The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07959-2_2 ◽

2014 ◽

pp. 10-21 ◽

Author(s):

Péter Biró ◽

David F. Manlove ◽

Iain McBride

Keyword(s):

Integer Programming ◽

Programming Models

Download Full-text

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07959-2_24 ◽

2014 ◽

pp. 283-294 ◽

Author(s):

Annalisa D’Andrea ◽

Mattia D’Emidio ◽

Daniele Frigioni ◽

Stefano Leucci ◽

Guido Proietti

Keyword(s):

Shortest Path ◽

Experimental Evaluation ◽

Shortest Path Tree ◽

Tree Algorithms

Download Full-text