Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

44
(FIVE YEARS 0)

H-INDEX

8
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540669166, 9783540466321
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Faster Algorithm for Finding Disjoint Paths in Grids

1999 ◽  
pp. 393-402 ◽  
Author(s):  
Wun-Tat Chan ◽  
Francis Y. L. Chin ◽  
Hing-Fung Ting
Keyword(s):  
Disjoint Paths

Survivable Networks with Bounded Delay: The Edge Failure Case

1999 ◽  
pp. 205-214 ◽  
Author(s):  
Serafino Cicerone ◽  
Gabriele Di Stefano ◽  
Dagmar Handke
Keyword(s):  
Survivable Networks ◽  
Bounded Delay ◽  
Edge Failure

Upper Bounds for MaxSat: Further Improved

1999 ◽  
pp. 247-258 ◽  
Author(s):  
Nikhil Bansal ◽  
Venkatesh Raman
Keyword(s):  
Upper Bounds

scholarly journals Station Layouts in the Presence of Location Constraints

1999 ◽  
pp. 269-278 ◽  
Author(s):  
Christos Kaklamanis ◽  
Lefteris M. Kirousis ◽  
Prosenjit Bose ◽  
Evangelos Kranakis ◽  
Danny Krizanc ◽  
...  

Generalized Maximum Independent Sets for Trees in Subquadratic Time

1999 ◽  
pp. 435-445 ◽  
Author(s):  
B. K. Bhattacharya ◽  
M. E. Houle
Keyword(s):  
Independent Sets

Approximating Multicast Congestion

1999 ◽  
pp. 367-372 ◽  
Author(s):  
Santosh Vempala ◽  
Berthold Vöcking

A Linear Algorithm for Finding Total Colorings of Partial k-Trees

1999 ◽  
pp. 347-356
Author(s):  
Shuji Isobe ◽  
Xiao Zhou ◽  
Takao Nishizeki
Keyword(s):  
Linear Algorithm

Static Dictionaries Supporting Rank

1999 ◽  
pp. 18-26 ◽  
Author(s):  
Venkatesh Raman ◽  
S. Srinivasa Rao

How Many People Can Hide in a Terrain?

1999 ◽  
pp. 184-194 ◽  
Author(s):  
Stephan Eidenbenz
Load More ...
Sign in / Sign up

Export Citation Format

Share Document