Algorithms – ESA 2012 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

71

(FIVE YEARS 0)

H-INDEX

11

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642330896, 9783642330902

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Lower Bounds for Sorted Geometric Queries in the I/O Model

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33090-2_6 ◽

2012 ◽

pp. 48-59

Author(s):

Peyman Afshani ◽

Norbert Zeh

Keyword(s):

Lower Bounds ◽

Geometric Queries

Download Full-text

A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33090-2_59 ◽

2012 ◽

pp. 683-694 ◽

Author(s):

Yasuaki Kobayashi ◽

Hisao Tamaki

Keyword(s):

Fixed Parameter ◽

Fixed Parameter Algorithm ◽

Crossing Minimization

Download Full-text

Succinct Data Structures for Path Queries

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33090-2_50 ◽

2012 ◽

pp. 575-586 ◽

Author(s):

Meng He ◽

J. Ian Munro ◽

Gelin Zhou

Keyword(s):

Data Structures ◽

Succinct Data Structures ◽

Download Full-text

Lines through Segments in 3D Space

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33090-2_40 ◽

2012 ◽

pp. 455-466 ◽

Author(s):

Efi Fogel ◽

Michael Hemmer ◽

Asaf Porat ◽

Dan Halperin

Keyword(s):

Download Full-text

Better Bounds for Graph Bisection

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33090-2_36 ◽

2012 ◽

pp. 407-418 ◽

Author(s):

Daniel Delling ◽

Renato F. Werneck

Keyword(s):

Graph Bisection

Download Full-text

Time-Dependent Route Planning with Generalized Objective Functions

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33090-2_16 ◽

2012 ◽

pp. 169-180 ◽

Author(s):

Gernot Veit Batz ◽

Peter Sanders

Keyword(s):

Route Planning ◽

Time Dependent ◽

Objective Functions

Download Full-text

A 5-Approximation for Capacitated Facility Location

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33090-2_13 ◽

2012 ◽

pp. 133-144 ◽

Author(s):

Manisha Bansal ◽

Naveen Garg ◽

Neelima Gupta

Keyword(s):

Facility Location ◽

Capacitated Facility Location

Download Full-text

Polynomial-Time Approximation Schemes for Shortest Path with Alternatives

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33090-2_65 ◽

2012 ◽

pp. 755-765 ◽

Author(s):

Tim Nonner

Keyword(s):

Polynomial Time ◽

Shortest Path ◽

Approximation Schemes ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Succinct Posets

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33090-2_64 ◽

2012 ◽

pp. 743-754 ◽

Author(s):

J. Ian Munro ◽

Patrick K. Nicholson

Download Full-text

Hierarchical Hub Labelings for Shortest Paths

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33090-2_4 ◽

2012 ◽

pp. 24-35 ◽

Author(s):

Ittai Abraham ◽

Daniel Delling ◽

Andrew V. Goldberg ◽

Renato F. Werneck

Keyword(s):

Download Full-text