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

9783642296994, 9783642297007

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An Improved Approximation Algorithm for the Bandpass Problem

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

10.1007/978-3-642-29700-7_32 ◽

2012 ◽

pp. 351-358 ◽

Cited By ~ 2

Author(s):

Weitian Tong ◽

Randy Goebel ◽

Wei Ding ◽

Guohui Lin

Keyword(s):

Approximation Algorithm ◽

Bandpass Problem

Online Exploration of All Vertices in a Simple Polygon

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

10.1007/978-3-642-29700-7_29 ◽

2012 ◽

pp. 315-326 ◽

Cited By ~ 1

Author(s):

Yuya Higashikawa ◽

Naoki Katoh

Keyword(s):

Simple Polygon

Fast Relative Lempel-Ziv Self-index for Similar Sequences

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

10.1007/978-3-642-29700-7_27 ◽

2012 ◽

pp. 291-302 ◽

Cited By ~ 9

Author(s):

Huy Hoang Do ◽

Jesper Jansson ◽

Kunihiko Sadakane ◽

Wing-Kin Sung

Zero-Sum Flow Numbers of Regular Graphs

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

10.1007/978-3-642-29700-7_25 ◽

2012 ◽

pp. 269-278 ◽

Cited By ~ 4

Author(s):

Tao-Ming Wang ◽

Shih-Wei Hu

Keyword(s):

Regular Graphs ◽

Zero Sum

The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter

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

10.1007/978-3-642-29700-7_20 ◽

2012 ◽

pp. 212-223 ◽

Cited By ~ 1

Author(s):

Junping Zhou ◽

Minghao Yin

Keyword(s):

Upper Bound ◽

Worst Case

Algorithms for Bandwidth Consecutive Multicolorings of Graphs

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

10.1007/978-3-642-29700-7_11 ◽

2012 ◽

pp. 117-128 ◽

Cited By ~ 1

Author(s):

Kazuhide Nishikawa ◽

Takao Nishizeki ◽

Xiao Zhou

Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations

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

10.1007/978-3-642-29700-7_21 ◽

2012 ◽

pp. 224-234

Author(s):

Chihao Zhang ◽

Hongyang Zhang

Keyword(s):

Fixed Parameter Tractability ◽

Fixed Parameter

Erratum: The Approximability of the Exemplar Breakpoint Distance Problem

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

10.1007/978-3-642-29700-7_34 ◽

2012 ◽

pp. 368-368 ◽

Cited By ~ 2

Author(s):

Zhixiang Chen ◽

Bin Fu ◽

Binhai Zhu

Keyword(s):

Breakpoint Distance ◽

Distance Problem

Kernels for Packing and Covering Problems

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

10.1007/978-3-642-29700-7_19 ◽

2012 ◽

pp. 199-211 ◽

Cited By ~ 7

Author(s):

Jianer Chen ◽

Henning Fernau ◽

Peter Shaw ◽

Jianxin Wang ◽

Zhibiao Yang

Keyword(s):

Covering Problems ◽

Packing And Covering

A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing

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

10.1007/978-3-642-29700-7_16 ◽

2012 ◽

pp. 172-181 ◽

Cited By ~ 2

Author(s):

Richard Beigel ◽

Bin Fu

Keyword(s):

Bin Packing ◽

Approximation Schemes ◽

Time Approximation

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

An Improved Approximation Algorithm for the Bandpass Problem

Online Exploration of All Vertices in a Simple Polygon

Fast Relative Lempel-Ziv Self-index for Similar Sequences

Zero-Sum Flow Numbers of Regular Graphs

The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter

Algorithms for Bandwidth Consecutive Multicolorings of Graphs

Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations

Erratum: The Approximability of the Exemplar Breakpoint Distance Problem

Kernels for Packing and Covering Problems

A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing

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