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

9783540602200, 9783540447474

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Computing a shortest watchman path in a simple polygon in polynomial-time

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-60220-8_56 ◽

1995 ◽

pp. 122-134 ◽

Cited By ~ 5

Author(s):

Svante Carlsson ◽

Håkan Jonsson

Keyword(s):

Polynomial Time ◽

Simple Polygon

Download Full-text

Approximation of Constraint Satisfaction via local search

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-60220-8_85 ◽

1995 ◽

pp. 461-472 ◽

Cited By ~ 2

Author(s):

Hoong Chuin Lau

Keyword(s):

Local Search ◽

Constraint Satisfaction

Download Full-text

A linear algorithm for the maximal planar subgraph problem

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-60220-8_77 ◽

1995 ◽

pp. 369-380 ◽

Cited By ~ 10

Author(s):

Hristo N. Djidjev

Keyword(s):

Linear Algorithm

Download Full-text

On approximation properties of the Independent set problem for degree 3 graphs

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-60220-8_84 ◽

1995 ◽

pp. 449-460 ◽

Cited By ~ 49

Author(s):

Piotr Berman ◽

Toshihiro Fujito

Keyword(s):

Independent Set ◽

Approximation Properties ◽

Independent Set Problem

Download Full-text

On the difficulty of range searching

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-60220-8_86 ◽

1995 ◽

pp. 473-481 ◽

Cited By ~ 1

Author(s):

Arne Andersson ◽

Kurt Swanson

Keyword(s):

Range Searching

Download Full-text

Quadrangulations of planar sets

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-60220-8_64 ◽

1995 ◽

pp. 218-227 ◽

Cited By ~ 7

Author(s):

Godfried Toussaint

Download Full-text

Obstructions to within a few vertices or edges of acyclic

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-60220-8_81 ◽

1995 ◽

pp. 415-427 ◽

Cited By ~ 1

Author(s):

Kevin Cattell ◽

Michael J. Dinneen ◽

Michael R. Fellows

Keyword(s):

Few Vertices

Download Full-text

Improved length bounds for the shortest superstring problem

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-60220-8_88 ◽

1995 ◽

pp. 494-505 ◽

Cited By ~ 9

Author(s):

Chris Armen ◽

Clifford Stein

Download Full-text

Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-60220-8_89 ◽

1995 ◽

pp. 506-517 ◽

Cited By ~ 5

Author(s):

Vineet Bafna ◽

Babu Narayanan ◽

R. Ravi

Keyword(s):

Independent Sets ◽

Axis Parallel

Download Full-text

Regular-factors in the complements of partial k-trees

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-60220-8_80 ◽

1995 ◽

pp. 403-414 ◽

Cited By ~ 1

Author(s):

Damon Kaller ◽

Arvind Gupta ◽

Tom Shermer

Download Full-text

Lecture Notes in Computer Science - Algorithms and Data StructuresLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Computing a shortest watchman path in a simple polygon in polynomial-time

Approximation of Constraint Satisfaction via local search

A linear algorithm for the maximal planar subgraph problem

On approximation properties of the Independent set problem for degree 3 graphs

On the difficulty of range searching

Quadrangulations of planar sets

Obstructions to within a few vertices or edges of acyclic

Improved length bounds for the shortest superstring problem

Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)

Regular-factors in the complements of partial k-trees

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