Lecture Notes in Computer Science - Algorithms — ESA '95
Latest Publications

TOTAL DOCUMENTS

43

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540603139, 9783540449133

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximating the bandwidth for asteroidal triple-free graphs

Lecture Notes in Computer Science - Algorithms — ESA '95 ◽

10.1007/3-540-60313-1_161 ◽

1995 ◽

pp. 434-447 ◽

Author(s):

T. Kloks ◽

D. Kratsch ◽

H. Müller

Keyword(s):

Asteroidal Triple

Download Full-text

Approximation algorithms for feasible cut and multicut problems

Lecture Notes in Computer Science - Algorithms — ESA '95 ◽

10.1007/3-540-60313-1_158 ◽

1995 ◽

pp. 394-408 ◽

Author(s):

Bo Yu ◽

Joseph Cheriyan

Keyword(s):

Approximation Algorithms

Download Full-text

Geometric pattern matching in d-dimensional space

Lecture Notes in Computer Science - Algorithms — ESA '95 ◽

10.1007/3-540-60313-1_149 ◽

1995 ◽

pp. 264-279 ◽

Author(s):

L. Paul Chew ◽

Dorit Dor ◽

Alon Efrat ◽

Klara Kedem

Keyword(s):

Pattern Matching ◽

Dimensional Space ◽

Geometric Pattern ◽

Geometric Pattern Matching

Download Full-text

Linear size binary space partitions for fat objects

Lecture Notes in Computer Science - Algorithms — ESA '95 ◽

10.1007/3-540-60313-1_148 ◽

1995 ◽

pp. 252-263 ◽

Author(s):

Mark Berg

Keyword(s):

Download Full-text

Efficient computation of the geodesic Voronoi diagram of points in a simple polygon

Lecture Notes in Computer Science - Algorithms — ESA '95 ◽

10.1007/3-540-60313-1_147 ◽

1995 ◽

pp. 238-251 ◽

Author(s):

Evanthia Papadopoulou ◽

D. T. Lee

Keyword(s):

Voronoi Diagram ◽

Simple Polygon ◽

Efficient Computation

Download Full-text

Certificates and fast algorithms for biconnectivity in fully-dynamic graphs

Lecture Notes in Computer Science - Algorithms — ESA '95 ◽

10.1007/3-540-60313-1_142 ◽

1995 ◽

pp. 171-184 ◽

Author(s):

Monika R. Henzinger ◽

Han Poutré

Keyword(s):

Fast Algorithms ◽

Download Full-text

Packing trees

Lecture Notes in Computer Science - Algorithms — ESA '95 ◽

10.1007/3-540-60313-1_138 ◽

1995 ◽

pp. 113-127 ◽

Author(s):

Joseph Gil ◽

Alon Itai

Download Full-text

Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time

Lecture Notes in Computer Science - Algorithms — ESA '95 ◽

10.1007/3-540-60313-1_150 ◽

1995 ◽

pp. 280-294 ◽

Author(s):

Cao An Wang ◽

Francis Chin

Keyword(s):

Voronoi Diagram ◽

Delaunay Triangulation ◽

Linear Time ◽

Simple Polygon ◽

Constrained Delaunay Triangulation

Download Full-text

Sometimes travelling is easy: The master tour problem

Lecture Notes in Computer Science - Algorithms — ESA '95 ◽

10.1007/3-540-60313-1_139 ◽

1995 ◽

pp. 128-141 ◽

Author(s):

Vladimir G. Deineko ◽

Rüdiger Rudolf ◽

Gerhard J. Woeginger

Download Full-text

Maximum skew-symmetric flows

Lecture Notes in Computer Science - Algorithms — ESA '95 ◽

10.1007/3-540-60313-1_141 ◽

1995 ◽

pp. 155-170 ◽

Author(s):

Andrew V. Goldberg ◽

Alexander V. Karzanov

Download Full-text