Frontiers in Algorithmics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540693109, 9783540693116

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Versioning Tree Structures by Path-Merging

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69311-6_13 ◽

2008 ◽

pp. 101-112 ◽

Cited By ~ 1

Author(s):

Khaireel A. Mohamed ◽

Tobias Langner ◽

Thomas Ottmann

Keyword(s):

Tree Structures

Download Full-text

Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69311-6_28 ◽

2008 ◽

pp. 264-275 ◽

Cited By ~ 6

Author(s):

Huixiang Zhang ◽

Guanzhong Dai ◽

Lei Yao ◽

Hairui Zhou

Keyword(s):

Congestion Control ◽

Variable Structure ◽

Fast Convergence ◽

Control Protocol

Download Full-text

A Linear In-situ Algorithm for the Power of Cyclic Permutation

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69311-6_14 ◽

2008 ◽

pp. 113-123 ◽

Cited By ~ 8

Author(s):

Jinyun Xue ◽

Bo Yang ◽

Zhengkang Zuo

Keyword(s):

Cyclic Permutation

Download Full-text

A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69311-6_5 ◽

2008 ◽

pp. 16-27 ◽

Cited By ~ 1

Author(s):

Minzhu Xie ◽

Jianxin Wang ◽

Wei Zhou ◽

Jianer Chen

Keyword(s):

Parameterized Algorithm ◽

The Individual

Download Full-text

The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69311-6_23 ◽

2008 ◽

pp. 208-220

Author(s):

Katerina Asdre ◽

Stavros D. Nikolopoulos

Keyword(s):

Polynomial Solution ◽

Path Cover ◽

Terminal Set ◽

Cover Problem

Download Full-text

Matching for Graphs of Bounded Degree

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69311-6_19 ◽

2008 ◽

pp. 171-173 ◽

Cited By ~ 1

Author(s):

Yijie Han

Keyword(s):

Bounded Degree

Download Full-text

Multi-bidding Strategy in Sponsored Keyword Auction

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69311-6_15 ◽

2008 ◽

pp. 124-134 ◽

Cited By ~ 4

Author(s):

Tian-Ming Bu ◽

Xiaotie Deng ◽

Qi Qi

Keyword(s):

Bidding Strategy

Download Full-text

Visiting a Polygon on the Optimal Way to a Query Point

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69311-6_26 ◽

2008 ◽

pp. 245-251

Author(s):

Ramtin Khosravi ◽

Mohammad Ghodsi

Keyword(s):

Query Point

Download Full-text

Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69311-6_8 ◽

2008 ◽

pp. 45-54 ◽

Cited By ~ 4

Author(s):

Seung-Ho Kang ◽

In-Seon Jeong ◽

Mun-Ho Choi ◽

Hyeong-Seok Lim

Keyword(s):

Haplotype Assembly ◽

Genotype Information ◽

Related Genotype

Download Full-text

A Scalable Algorithm for Graph-Based Active Learning

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69311-6_32 ◽

2008 ◽

pp. 311-322 ◽

Cited By ~ 3

Author(s):

Wentao Zhao ◽

Jun Long ◽

En Zhu ◽

Yun Liu

Keyword(s):

Active Learning ◽

Scalable Algorithm

Download Full-text

Frontiers in Algorithmics - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Versioning Tree Structures by Path-Merging

Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback

A Linear In-situ Algorithm for the Power of Cyclic Permutation

A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem

The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs

Matching for Graphs of Bounded Degree

Multi-bidding Strategy in Sponsored Keyword Auction

Visiting a Polygon on the Optimal Way to a Query Point

Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information

A Scalable Algorithm for Graph-Based Active Learning

Frontiers in Algorithmics - Lecture Notes in Computer Science
Latest Publications