Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(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

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-46632-0_40 ◽

1999 ◽

pp. 393-402 ◽

Cited By ~ 3

Author(s):

Wun-Tat Chan ◽

Francis Y. L. Chin ◽

Hing-Fung Ting

Keyword(s):

Disjoint Paths

Download Full-text

Survivable Networks with Bounded Delay: The Edge Failure Case

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-46632-0_22 ◽

1999 ◽

pp. 205-214 ◽

Cited By ~ 2

Author(s):

Serafino Cicerone ◽

Gabriele Di Stefano ◽

Dagmar Handke

Keyword(s):

Survivable Networks ◽

Bounded Delay ◽

Edge Failure

Download Full-text

The Engineering of Some Bipartite Matching Programs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-46632-0_1 ◽

1999 ◽

pp. 1-3

Author(s):

Kurt Mehlhorn

Keyword(s):

Bipartite Matching

Download Full-text

Upper Bounds for MaxSat: Further Improved

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-46632-0_26 ◽

1999 ◽

pp. 247-258 ◽

Cited By ~ 32

Author(s):

Nikhil Bansal ◽

Venkatesh Raman

Keyword(s):

Upper Bounds

Download Full-text

Station Layouts in the Presence of Location Constraints

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-46632-0_28 ◽

1999 ◽

pp. 269-278 ◽

Cited By ~ 3

Author(s):

Christos Kaklamanis ◽

Lefteris M. Kirousis ◽

Prosenjit Bose ◽

Evangelos Kranakis ◽

Danny Krizanc ◽

...

Download Full-text

Generalized Maximum Independent Sets for Trees in Subquadratic Time

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-46632-0_44 ◽

1999 ◽

pp. 435-445 ◽

Cited By ~ 3

Author(s):

B. K. Bhattacharya ◽

M. E. Houle

Keyword(s):

Independent Sets

Download Full-text

Approximating Multicast Congestion

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-46632-0_37 ◽

1999 ◽

pp. 367-372 ◽

Cited By ~ 12

Author(s):

Santosh Vempala ◽

Berthold Vöcking

Download Full-text

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

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-46632-0_35 ◽

1999 ◽

pp. 347-356

Author(s):

Shuji Isobe ◽

Xiao Zhou ◽

Takao Nishizeki

Keyword(s):

Linear Algorithm

Download Full-text

Static Dictionaries Supporting Rank

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-46632-0_3 ◽

1999 ◽

pp. 18-26 ◽

Cited By ~ 3

Author(s):

Venkatesh Raman ◽

S. Srinivasa Rao

Download Full-text

How Many People Can Hide in a Terrain?

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-46632-0_20 ◽

1999 ◽

pp. 184-194 ◽

Cited By ~ 2

Author(s):

Stephan Eidenbenz

Download Full-text

Algorithms and Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A Faster Algorithm for Finding Disjoint Paths in Grids

Survivable Networks with Bounded Delay: The Edge Failure Case

The Engineering of Some Bipartite Matching Programs

Upper Bounds for MaxSat: Further Improved

Station Layouts in the Presence of Location Constraints

Generalized Maximum Independent Sets for Trees in Subquadratic Time

Approximating Multicast Congestion

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

Static Dictionaries Supporting Rank

How Many People Can Hide in a Terrain?

Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications