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

9783540281016, 9783540317111

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Hinged Dissection of Polypolyhedra

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/11534273_19 ◽

2005 ◽

pp. 205-217 ◽

Cited By ~ 12

Author(s):

Erik D. Demaine ◽

Martin L. Demaine ◽

Jeffrey F. Lindy ◽

Diane L. Souvaine

Download Full-text

Approximating the Online Set Multicover Problems via Randomized Winnowing

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/11534273_11 ◽

2005 ◽

pp. 110-121 ◽

Cited By ~ 2

Author(s):

Piotr Berman ◽

Bhaskar DasGupta

Download Full-text

Near-Optimal Pricing in Near-Linear Time

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/11534273_37 ◽

2005 ◽

pp. 422-431 ◽

Cited By ~ 33

Author(s):

Jason D. Hartline ◽

Vladlen Koltun

Keyword(s):

Linear Time ◽

Optimal Pricing

Download Full-text

Max-stretch Reduction for Tree Spanners

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/11534273_12 ◽

2005 ◽

pp. 122-133

Author(s):

Kazuo Iwama ◽

Andrzej Lingas ◽

Masaki Okita

Download Full-text

The Multi-radius Cover Problem

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/11534273_4 ◽

2005 ◽

pp. 24-35 ◽

Cited By ~ 2

Author(s):

Refael Hassin ◽

Danny Segev

Keyword(s):

Cover Problem

Download Full-text

Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/11534273_20 ◽

2005 ◽

pp. 218-232 ◽

Cited By ~ 21

Author(s):

Shlomo Moran ◽

Sagi Snir

Download Full-text

Line-Segment Intersection Made In-Place

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/11534273_14 ◽

2005 ◽

pp. 146-157 ◽

Cited By ~ 2

Author(s):

Jan Vahrenhold

Keyword(s):

Line Segment ◽

Line Segment Intersection ◽

Made In

Download Full-text

Parameterized Complexity of Generalized Vertex Cover Problems

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/11534273_5 ◽

2005 ◽

pp. 36-48 ◽

Cited By ~ 30

Author(s):

Jiong Guo ◽

Rolf Niedermeier ◽

Sebastian Wernicke

Keyword(s):

Parameterized Complexity ◽

Vertex Cover

Download Full-text

Derandomization of Dimensionality Reduction and SDP Based Algorithms

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/11534273_35 ◽

2005 ◽

pp. 396-408

Author(s):

Ankur Bhargava ◽

S. Rao Kosaraju

Keyword(s):

Dimensionality Reduction

Download Full-text

Balanced Aspect Ratio Trees Revisited

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/11534273_8 ◽

2005 ◽

pp. 73-85

Author(s):

Amitabh Chaudhary ◽

Michael T. Goodrich

Keyword(s):

Aspect Ratio

Download Full-text

Lecture Notes in Computer Science - Algorithms and Data StructuresLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Hinged Dissection of Polypolyhedra

Approximating the Online Set Multicover Problems via Randomized Winnowing

Near-Optimal Pricing in Near-Linear Time

Max-stretch Reduction for Tree Spanners

The Multi-radius Cover Problem

Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms

Line-Segment Intersection Made In-Place

Parameterized Complexity of Generalized Vertex Cover Problems

Derandomization of Dimensionality Reduction and SDP Based Algorithms

Balanced Aspect Ratio Trees Revisited

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