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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319621265, 9783319621272

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximating Small Balanced Vertex Separators in Almost Linear Time

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-319-62127-2_20 ◽

2017 ◽

pp. 229-240 ◽

Cited By ~ 1

Author(s):

Sebastian Brandt ◽

Roger Wattenhofer

Keyword(s):

Linear Time ◽

Vertex Separators

Download Full-text

Faster Algorithm for Truth Discovery via Range Cover

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-319-62127-2_39 ◽

2017 ◽

pp. 461-472 ◽

Cited By ~ 2

Author(s):

Ziyun Huang ◽

Hu Ding ◽

Jinhui Xu

Keyword(s):

Truth Discovery

Download Full-text

Algorithms for Covering Multiple Barriers

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-319-62127-2_45 ◽

2017 ◽

pp. 533-544 ◽

Cited By ~ 1

Author(s):

Shimin Li ◽

Haitao Wang

Download Full-text

Covering Segments with Unit Squares

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-319-62127-2_1 ◽

2017 ◽

pp. 1-12 ◽

Cited By ~ 1

Author(s):

Ankush Acharyya ◽

Subhas C. Nandy ◽

Supantha Pandit ◽

Sasanka Roy

Download Full-text

On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-319-62127-2_49 ◽

2017 ◽

pp. 581-592 ◽

Cited By ~ 1

Author(s):

Jie Xue ◽

Yuan Li ◽

Ravi Janardan

Keyword(s):

Convex Hull

Download Full-text

Dynamic Graph Coloring

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-319-62127-2_9 ◽

2017 ◽

pp. 97-108 ◽

Cited By ~ 7

Author(s):

Luis Barba ◽

Jean Cardinal ◽

Matias Korman ◽

Stefan Langerman ◽

André van Renssen ◽

...

Keyword(s):

Graph Coloring ◽

Dynamic Graph

Download Full-text

Effectiveness of Local Search for Art Gallery Problems

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-319-62127-2_5 ◽

2017 ◽

pp. 49-60 ◽

Cited By ~ 3

Author(s):

Sayan Bandyapadhyay ◽

Aniket Basu Roy

Keyword(s):

Local Search ◽

Art Gallery ◽

Art Gallery Problems

Download Full-text

The Complexity of Tree Partitioning

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-319-62127-2_4 ◽

2017 ◽

pp. 37-48 ◽

Cited By ~ 2

Author(s):

Zhao An ◽

Qilong Feng ◽

Iyad Kanj ◽

Ge Xia

Download Full-text

Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-319-62127-2_27 ◽

2017 ◽

pp. 313-324 ◽

Cited By ~ 3

Author(s):

Erik D. Demaine ◽

Quanquan C. Liu

Keyword(s):

Pebble Game

Download Full-text

Improved Distance Sensitivity Oracles via Tree Partitioning

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-319-62127-2_30 ◽

2017 ◽

pp. 349-360

Author(s):

Ran Duan ◽

Tianyi Zhang

Download Full-text

Lecture Notes in Computer Science - Algorithms and Data StructuresLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Approximating Small Balanced Vertex Separators in Almost Linear Time

Faster Algorithm for Truth Discovery via Range Cover

Algorithms for Covering Multiple Barriers

Covering Segments with Unit Squares

On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull

Dynamic Graph Coloring

Effectiveness of Local Search for Art Gallery Problems

The Complexity of Tree Partitioning

Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

Improved Distance Sensitivity Oracles via Tree Partitioning

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