Lecture Notes in Computer Science - Algorithms and Data Structures
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642033667, 9783642033674

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-03367-4_25 ◽

2009 ◽

pp. 278-289 ◽

Cited By ~ 15

Author(s):

David Eppstein ◽

Emma S. Spiro

Keyword(s):

H Index

Download Full-text

A Pseudopolynomial Algorithm for Alexandrov’s Theorem

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-03367-4_38 ◽

2009 ◽

pp. 435-446 ◽

Cited By ~ 7

Author(s):

Daniel Kane ◽

Gregory N. Price ◽

Erik D. Demaine

Keyword(s):

Pseudopolynomial Algorithm

Download Full-text

Algorithms Meet Art, Puzzles, and Magic

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-03367-4_17 ◽

2009 ◽

pp. 193-193

Author(s):

Erik D. Demaine

Download Full-text

Orientation-Constrained Rectangular Layouts

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-03367-4_24 ◽

2009 ◽

pp. 266-277 ◽

Cited By ~ 2

Author(s):

David Eppstein ◽

Elena Mumford

Download Full-text

Computing the Implicit Voronoi Diagram in Triple Precision

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-03367-4_43 ◽

2009 ◽

pp. 495-506 ◽

Cited By ~ 1

Author(s):

David L. Millman ◽

Jack Snoeyink

Keyword(s):

Voronoi Diagram

Download Full-text

Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-03367-4_40 ◽

2009 ◽

pp. 459-470 ◽

Cited By ~ 12

Author(s):

Martin Knauer ◽

Joachim Spoerhase

Keyword(s):

Approximation Algorithms ◽

Spanning Tree

Download Full-text

A Comparison of Performance Measures for Online Algorithms

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-03367-4_11 ◽

2009 ◽

pp. 119-130 ◽

Cited By ~ 12

Author(s):

Joan Boyar ◽

Sandy Irani ◽

Kim S. Larsen

Keyword(s):

Performance Measures ◽

Online Algorithms

Download Full-text

Worst-Case Optimal Adaptive Prefix Coding

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-03367-4_28 ◽

2009 ◽

pp. 315-326 ◽

Cited By ~ 5

Author(s):

Travis Gagie ◽

Yakov Nekrich

Keyword(s):

Worst Case

Download Full-text

A Distribution-Sensitive Dictionary with Low Space Overhead

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-03367-4_10 ◽

2009 ◽

pp. 110-118 ◽

Cited By ~ 2

Author(s):

Prosenjit Bose ◽

John Howat ◽

Pat Morin

Download Full-text

Drawing Graphs with Right Angle Crossings

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-03367-4_19 ◽

2009 ◽

pp. 206-217 ◽

Cited By ~ 24

Author(s):

Walter Didimo ◽

Peter Eades ◽

Giuseppe Liotta

Download Full-text

Lecture Notes in Computer Science - Algorithms and Data StructuresLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics

A Pseudopolynomial Algorithm for Alexandrov’s Theorem

Algorithms Meet Art, Puzzles, and Magic

Orientation-Constrained Rectangular Layouts

Computing the Implicit Voronoi Diagram in Triple Precision

Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem

A Comparison of Performance Measures for Online Algorithms

Worst-Case Optimal Adaptive Prefix Coding

A Distribution-Sensitive Dictionary with Low Space Overhead

Drawing Graphs with Right Angle Crossings

Lecture Notes in Computer Science - Algorithms and Data Structures
Latest Publications