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

9783540515425, 9783540482376

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Computing the furthest site voronoi diagram for a set of discs

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-51542-9_7 ◽

1989 ◽

pp. 57-66 ◽

Cited By ~ 4

Author(s):

David Rappaport

Keyword(s):

Voronoi Diagram

Download Full-text

Finding All Shortest Path Edge Sequences on a convex polyhedron

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-51542-9_23 ◽

1989 ◽

pp. 251-266 ◽

Cited By ~ 3

Author(s):

Yie-Huei Hwang ◽

Ruei-Chuan Chang ◽

Hung-Yi Tu

Keyword(s):

Shortest Path ◽

Convex Polyhedron

Download Full-text

Analysis of kdt-trees: Kd-trees improved by local reorganisations

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-51542-9_4 ◽

1989 ◽

pp. 24-38 ◽

Cited By ~ 9

Author(s):

Walter Cunto ◽

Gustavo Lau ◽

Philippe Flajolet

Download Full-text

Fully persistent arrays

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-51542-9_8 ◽

1989 ◽

pp. 67-74 ◽

Cited By ~ 18

Author(s):

Paul F. Dietz

Download Full-text

Efficient spatial point location

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-51542-9_2 ◽

1989 ◽

pp. 3-11 ◽

Cited By ~ 8

Author(s):

Franco P. Preparata ◽

Roberto Tamassia

Keyword(s):

Point Location ◽

Spatial Point

Download Full-text

Linear time algorithms for computing reachability regions from polygonal figures

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-51542-9_14 ◽

1989 ◽

pp. 163-170

Author(s):

Rongyao Zhao

Keyword(s):

Linear Time ◽

Linear Time Algorithms

Download Full-text

Selecting the Kth largest-area convex polygon

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-51542-9_22 ◽

1989 ◽

pp. 243-250

Author(s):

Jeffrey S. Salowe

Keyword(s):

Convex Polygon

Download Full-text

Dynamic data structures for series parallel digraphs

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-51542-9_30 ◽

1989 ◽

pp. 352-372 ◽

Cited By ~ 2

Author(s):

Giuseppe F. Italiano ◽

Alberto Marchetti Spaccamela ◽

Umberto Nanni

Keyword(s):

Data Structures ◽

Dynamic Data Structures ◽

Dynamic Data

Download Full-text

Weighted orthogonal linear L ∞-approximation and applications

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-51542-9_16 ◽

1989 ◽

pp. 183-191 ◽

Cited By ~ 9

Author(s):

Michael E. Houle ◽

Hiroshi Imai ◽

Keiko Imai ◽

Jean-Marc Robert

Download Full-text

Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-51542-9_13 ◽

1989 ◽

pp. 147-162 ◽

Cited By ~ 4

Author(s):

Marek Chrobak ◽

Joseph Naor ◽

Mark B. Novick

Keyword(s):

Spanning Trees ◽

Efficient Algorithms ◽

Bounded Degree

Download Full-text

Lecture Notes in Computer Science - Algorithms and Data StructuresLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Computing the furthest site voronoi diagram for a set of discs

Finding All Shortest Path Edge Sequences on a convex polyhedron

Analysis of kdt-trees: Kd-trees improved by local reorganisations

Fully persistent arrays

Efficient spatial point location

Linear time algorithms for computing reachability regions from polygonal figures

Selecting the Kth largest-area convex polygon

Dynamic data structures for series parallel digraphs

Weighted orthogonal linear L ∞-approximation and applications

Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs

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