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

9783540571551, 9783540479185

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On approximating the longest path in a graph

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_267 ◽

1993 ◽

pp. 421-432 ◽

Cited By ~ 16

Author(s):

David Karger ◽

Rajeev Motwani ◽

G. D. S. Ramkumar

Keyword(s):

Longest Path

Download Full-text

Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_244 ◽

1993 ◽

pp. 151-162 ◽

Cited By ~ 16

Author(s):

Giuseppe Battista ◽

Giuseppe Liotta ◽

Francesco Vargiu

Keyword(s):

Planar Graphs ◽

Orthogonal Representations

Download Full-text

Detecting race conditions in parallel programs that use one semaphore

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_272 ◽

1993 ◽

pp. 471-482 ◽

Cited By ~ 3

Author(s):

Hsueh -I Lu ◽

Philip N. Klein ◽

Robert H. B. Netzer

Keyword(s):

Parallel Programs ◽

Race Conditions

Download Full-text

Repetitive hidden-surface-removal for polyhedral scenes

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_278 ◽

1993 ◽

pp. 541-552 ◽

Cited By ~ 1

Author(s):

Marco Pellegrini

Keyword(s):

Hidden Surface Removal ◽

Polyhedral Scenes ◽

Surface Removal

Download Full-text

Efficient approximate shortest-path queries among isothetic rectangular obstacles

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_276 ◽

1993 ◽

pp. 518-529 ◽

Cited By ~ 3

Author(s):

Pinaki Mitra ◽

Binay Bhattacharya

Keyword(s):

Shortest Path ◽

Approximate Shortest Path ◽

Path Queries

Download Full-text

The exhaustion of shared memory: Stochastic results

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_274 ◽

1993 ◽

pp. 494-505

Author(s):

Robert S. Maier ◽

René Schott

Keyword(s):

Shared Memory

Download Full-text

An algorithm for finding predecessors in integer sets

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_273 ◽

1993 ◽

pp. 483-493

Author(s):

Bruce Maggs ◽

Monika Rauch

Download Full-text

Tree reconstruction from partial orders

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_265 ◽

1993 ◽

pp. 397-408

Author(s):

Sampath Kannan ◽

Tandy Warnow

Keyword(s):

Partial Orders ◽

Tree Reconstruction

Download Full-text

A complete and efficient algorithm for the intersection of a general and a convex polyhedron

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_258 ◽

1993 ◽

pp. 314-324 ◽

Cited By ~ 9

Author(s):

Katrin Dobrindt ◽

Kurt Mehlhorn ◽

Mariette Yvinec

Keyword(s):

Efficient Algorithm ◽

Convex Polyhedron

Download Full-text

Probing a set of hyperplanes by lines and related problems

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_237 ◽

1993 ◽

pp. 72-82 ◽

Cited By ~ 1

Author(s):

Yasukazu Aoki ◽

Hiroshi Imai ◽

Keiko Imai ◽

David Rappaport

Download Full-text

Lecture Notes in Computer Science - Algorithms and Data StructuresLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On approximating the longest path in a graph

Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)

Detecting race conditions in parallel programs that use one semaphore

Repetitive hidden-surface-removal for polyhedral scenes

Efficient approximate shortest-path queries among isothetic rectangular obstacles

The exhaustion of shared memory: Stochastic results

An algorithm for finding predecessors in integer sets

Tree reconstruction from partial orders

A complete and efficient algorithm for the intersection of a general and a convex polyhedron

Probing a set of hyperplanes by lines and related problems

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