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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642330896, 9783642330902

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximating Earliest Arrival Flows in Arbitrary Networks

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

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

2012 ◽

pp. 551-562 ◽

Cited By ~ 5

Author(s):

Martin Groß ◽

Jan-Philipp W. Kappmeier ◽

Daniel R. Schmidt ◽

Melanie Schmidt

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

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 ◽

Cited By ~ 2

Author(s):

Yasuaki Kobayashi ◽

Hisao Tamaki

Keyword(s):

Fixed Parameter ◽

Fixed Parameter Algorithm ◽

Crossing Minimization

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 ◽

Cited By ~ 12

Author(s):

Meng He ◽

J. Ian Munro ◽

Gelin Zhou

Keyword(s):

Data Structures ◽

Succinct Data Structures ◽

Path Queries

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 ◽

Cited By ~ 1

Author(s):

Efi Fogel ◽

Michael Hemmer ◽

Asaf Porat ◽

Dan Halperin

Keyword(s):

3D Space

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 ◽

Cited By ~ 7

Author(s):

Daniel Delling ◽

Renato F. Werneck

Keyword(s):

Graph Bisection

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 ◽

Cited By ~ 9

Author(s):

Gernot Veit Batz ◽

Peter Sanders

Keyword(s):

Route Planning ◽

Time Dependent ◽

Objective Functions

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 ◽

Cited By ~ 17

Author(s):

Manisha Bansal ◽

Naveen Garg ◽

Neelima Gupta

Keyword(s):

Facility Location ◽

Capacitated Facility Location

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 ◽

Cited By ~ 1

Author(s):

Tim Nonner

Keyword(s):

Polynomial Time ◽

Shortest Path ◽

Approximation Schemes ◽

Time Approximation ◽

Polynomial Time Approximation

Succinct Posets

Algorithms – ESA 2012 - Lecture Notes in Computer Science ◽

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

2012 ◽

pp. 743-754 ◽

Cited By ~ 6

Author(s):

J. Ian Munro ◽

Patrick K. Nicholson

Algorithms – ESA 2012 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Approximating Earliest Arrival Flows in Arbitrary Networks

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

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

Succinct Data Structures for Path Queries

Lines through Segments in 3D Space

Better Bounds for Graph Bisection

Time-Dependent Route Planning with Generalized Objective Functions

A 5-Approximation for Capacitated Facility Location

Polynomial-Time Approximation Schemes for Shortest Path with Alternatives

Succinct Posets

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