Frontiers in Algorithmics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

30

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer International Publishing

9783319080154, 9783319080161

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-08016-1_9 ◽

2014 ◽

pp. 94-104 ◽

Author(s):

Longkun Guo

Keyword(s):

Shortest Paths ◽

Download Full-text

On the Advice Complexity of One-Dimensional Online Bin Packing

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-08016-1_29 ◽

2014 ◽

pp. 320-329 ◽

Author(s):

Xiaofan Zhao ◽

Hong Shen

Keyword(s):

Bin Packing ◽

One Dimensional ◽

Advice Complexity

Download Full-text

On the Complexity of Constrained Sequences Alignment Problems

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-08016-1_28 ◽

2014 ◽

pp. 309-319

Author(s):

Yong Zhang ◽

Joseph Wun-Tat Chan ◽

Francis Y. L. Chin ◽

Hing-Fung Ting ◽

Deshi Ye ◽

...

Keyword(s):

Sequences Alignment

Download Full-text

On Star-Cover and Path-Cover of a Tree

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-08016-1_27 ◽

2014 ◽

pp. 298-308 ◽

Author(s):

Jie You ◽

Qilong Feng ◽

Jiong Guo ◽

Feng Shi

Keyword(s):

Download Full-text

Near Optimal Algorithms for Online Maximum Weighted b-Matching

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-08016-1_22 ◽

2014 ◽

pp. 240-251 ◽

Author(s):

Hingfung Ting ◽

Xiangzhong Xiang

Keyword(s):

Optimal Algorithms

Download Full-text

Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-08016-1_13 ◽

2014 ◽

pp. 141-150

Author(s):

Hwee Kim ◽

Yo-Sub Han

Keyword(s):

String Matching ◽

Approximate String Matching

Download Full-text

Spanning Distribution Forests of Graphs

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-08016-1_11 ◽

2014 ◽

pp. 117-127 ◽

Author(s):

Keisuke Inoue ◽

Takao Nishizeki

Download Full-text

Monotone Grid Drawings of Planar Graphs

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-08016-1_10 ◽

2014 ◽

pp. 105-116 ◽

Author(s):

Md. Iqbal Hossain ◽

Md. Saidur Rahman

Keyword(s):

Download Full-text

Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-08016-1_23 ◽

2014 ◽

pp. 252-263 ◽

Author(s):

Chaoyi Wang ◽

Hao Chen ◽

Zihan Lei ◽

Ziyang Tang ◽

Tian Liu ◽

...

Keyword(s):

Bipartite Graphs ◽

Np Complete ◽

Convex Bipartite Graphs

Download Full-text

Dynamic Matchings in Left Weighted Convex Bipartite Graphs

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-08016-1_30 ◽

2014 ◽

pp. 330-342 ◽

Author(s):

Quan Zu ◽

Miaomiao Zhang ◽

Bin Yu

Keyword(s):

Bipartite Graphs ◽

Convex Bipartite Graphs

Download Full-text