Algorithm Theory — SWAT'96 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

38

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540614227, 9783540685296

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Efficient algorithms for Lempel-Ziv encoding

Algorithm Theory — SWAT'96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61422-2_148 ◽

1996 ◽

pp. 392-403 ◽

Author(s):

Leszek Gasieniec ◽

Marek Karpinski ◽

Wojciech Plandowski ◽

Wojciech Rytter

Keyword(s):

Efficient Algorithms

Download Full-text

Safe and efficient traffic laws for mobile robots

Algorithm Theory — SWAT'96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61422-2_145 ◽

1996 ◽

pp. 357-367

Author(s):

Sonne Preminger ◽

Eli Upfal

Keyword(s):

Download Full-text

A fast heuristic for approximating the minimum weight triangulation

Algorithm Theory — SWAT'96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61422-2_140 ◽

1996 ◽

pp. 296-308 ◽

Author(s):

Christos Levcopoulos ◽

Drago Krznaric

Keyword(s):

Minimum Weight ◽

Minimum Weight Triangulation

Download Full-text

Computing the unrooted maximum agreement subtree in sub-quadratic time

Algorithm Theory — SWAT'96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61422-2_126 ◽

1996 ◽

pp. 124-135 ◽

Author(s):

T. W. Lam ◽

W. K. Sung ◽

H. F. Ting

Download Full-text

Facility dispersion and remote subgraphs

Algorithm Theory — SWAT'96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61422-2_120 ◽

1996 ◽

pp. 53-65 ◽

Author(s):

Barun Chandra ◽

Magnús M. Halldórsson

Download Full-text

Derandomization via small sample spaces

Algorithm Theory — SWAT'96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61422-2_115 ◽

1996 ◽

pp. 1-3

Author(s):

Noga Alon

Keyword(s):

Download Full-text

Neighborhood graphs and distributed Δ+1-coloring

Algorithm Theory — SWAT'96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61422-2_134 ◽

1996 ◽

pp. 223-233

Author(s):

Pierre Kelsen

Download Full-text

Greedily finding a dense subgraph

Algorithm Theory — SWAT'96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61422-2_127 ◽

1996 ◽

pp. 136-148 ◽

Author(s):

Yuichi Asahiro ◽

Kazuo Iwama ◽

Hisao Tamaki ◽

Takeshi Tokuyama

Keyword(s):

Download Full-text

Using sparsification for parametric minimum spanning tree problems

Algorithm Theory — SWAT'96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61422-2_128 ◽

1996 ◽

pp. 149-160 ◽

Author(s):

David Fernández-Baca ◽

Giora Slutzki ◽

David Eppstein

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree

Download Full-text

Randomized approximation of the constraint satisfaction problem

Algorithm Theory — SWAT'96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61422-2_122 ◽

1996 ◽

pp. 76-87 ◽

Author(s):

Hoong Chuin Lau ◽

Osamu Watanabe

Keyword(s):

Constraint Satisfaction ◽

Constraint Satisfaction Problem

Download Full-text