Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642387555, 9783642387562

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Arbitrated Quantum Signature Schemes: Attacks and Security

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38756-2_8 ◽

2013 ◽

pp. 48-59 ◽

Cited By ~ 5

Author(s):

Xiangfu Zou ◽

Daowen Qiu

Keyword(s):

Quantum Signature ◽

Arbitrated Quantum Signature ◽

Signature Schemes

Download Full-text

Kernelization and Lower Bounds of the Signed Domination Problem

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38756-2_27 ◽

2013 ◽

pp. 261-271 ◽

Cited By ~ 1

Author(s):

Ying Zheng ◽

Jianxin Wang ◽

Qilong Feng

Keyword(s):

Lower Bounds ◽

Signed Domination ◽

Domination Problem

Download Full-text

The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38756-2_24 ◽

2013 ◽

pp. 231-240

Author(s):

Carlos A. Martinhon ◽

Luérbio Faria

Keyword(s):

Colored Graphs

Download Full-text

Zero-Visibility Cops and Robber Game on a Graph

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38756-2_19 ◽

2013 ◽

pp. 175-186 ◽

Cited By ~ 2

Author(s):

Dariusz Dereniowski ◽

Danny Dyer ◽

Ryan M. Tifenbach ◽

Boting Yang

Keyword(s):

Cops And Robber

Download Full-text

Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38756-2_16 ◽

2013 ◽

pp. 142-152 ◽

Cited By ~ 10

Author(s):

Min Lu ◽

Tian Liu ◽

Ke Xu

Keyword(s):

Bipartite Graphs ◽

Independent Domination ◽

Convex Bipartite Graphs

Download Full-text

An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38756-2_10 ◽

2013 ◽

pp. 72-83 ◽

Cited By ~ 3

Author(s):

Mingyu Xiao ◽

Hiroshi Nagamochi

Keyword(s):

Independent Set ◽

Exact Algorithm ◽

Maximum Independent Set

Download Full-text

Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38756-2_6 ◽

2013 ◽

pp. 24-35 ◽

Cited By ~ 2

Author(s):

Pawan Aurora ◽

Sumit Singh ◽

Shashank K. Mehta

Keyword(s):

Packing Problem ◽

Partial Degree

Download Full-text

On Edge-Independent Sets

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38756-2_28 ◽

2013 ◽

pp. 272-283 ◽

Cited By ~ 1

Author(s):

Ton Kloks ◽

Ching-Hao Liu ◽

Sheung-Hung Poon

Keyword(s):

Independent Sets

Download Full-text

Multi-Multiway Cut Problem on Graphs of Bounded Branch Width

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38756-2_32 ◽

2013 ◽

pp. 315-324 ◽

Cited By ~ 2

Author(s):

Xiaojie Deng ◽

Bingkai Lin ◽

Chihao Zhang

Keyword(s):

Multiway Cut ◽

Branch Width

Download Full-text

On the Complexity of Approximate Sum of Sorted List

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38756-2_29 ◽

2013 ◽

pp. 284-293

Author(s):

Bin Fu

Download Full-text

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Arbitrated Quantum Signature Schemes: Attacks and Security

Kernelization and Lower Bounds of the Signed Domination Problem

The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs

Zero-Visibility Cops and Robber Game on a Graph

Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs

An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs

Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds

On Edge-Independent Sets

Multi-Multiway Cut Problem on Graphs of Bounded Branch Width

On the Complexity of Approximate Sum of Sorted List

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science
Latest Publications