Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540206958, 9783540245872

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Efficient Algorithms for Optimizing Whole Genome Alignment with Noise

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24587-2_38 ◽

2003 ◽

pp. 364-374 ◽

Cited By ~ 1

Author(s):

T. W. Lam ◽

N. Lu ◽

H. F. Ting ◽

Prudence W. H. Wong ◽

S. M. Yiu

Keyword(s):

Efficient Algorithms ◽

Genome Alignment ◽

Whole Genome ◽

Whole Genome Alignment

On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24587-2_34 ◽

2003 ◽

pp. 319-328 ◽

Cited By ~ 4

Author(s):

Aleksei V. Fishkin ◽

Klaus Jansen ◽

Monaldo Mastrolilli

Keyword(s):

Completion Time ◽

Job Shop ◽

Release Dates ◽

Weighted Completion Time

Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24587-2_8 ◽

2003 ◽

pp. 58-67 ◽

Cited By ~ 1

Author(s):

Atsuko Yamaguchi ◽

Hiroshi Mamitsuka

Keyword(s):

Spanning Trees ◽

Maximum Common Subgraph ◽

Bounded Number ◽

Number Of Spanning Trees

Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24587-2_75 ◽

2003 ◽

pp. 736-745

Author(s):

Soonhak Kwon ◽

Chang Hoon Kim ◽

Chun Pyo Hong

Keyword(s):

Finite Fields ◽

Gauss Period ◽

Sparse Polynomial

An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24587-2_48 ◽

2003 ◽

pp. 464-473

Author(s):

Md. Abul Kashem ◽

M. Ziaur Rahman

Keyword(s):

Parallel Algorithm ◽

Vertex Ranking

Settling the Intractability of Multiple Alignment

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24587-2_37 ◽

2003 ◽

pp. 352-363 ◽

Cited By ~ 10

Author(s):

Isaac Elias

Keyword(s):

Multiple Alignment

An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24587-2_30 ◽

2003 ◽

pp. 280-289 ◽

Cited By ~ 2

Author(s):

Hiroshi Nagamochi ◽

Yuusuke Abe

Keyword(s):

Approximation Algorithm

Drawing Plane Graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24587-2_2 ◽

2003 ◽

pp. 2-5 ◽

Cited By ~ 1

Author(s):

Takao Nishizeki

Keyword(s):

Plane Graphs

The Intractability of Computing the Hamming Distance

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24587-2_11 ◽

2003 ◽

pp. 88-97 ◽

Cited By ~ 1

Author(s):

Bodo Manthey ◽

Rüdiger Reischuk

Keyword(s):

Hamming Distance

A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24587-2_51 ◽

2003 ◽

pp. 495-504 ◽

Cited By ~ 10

Author(s):

Akinobu Eguchi ◽

Satoru Fujishige ◽

Akihisa Tamura

Keyword(s):

Stable Marriage ◽

Marriage Model

Algorithms and Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Efficient Algorithms for Optimizing Whole Genome Alignment with Noise

On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates

Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees

Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic

An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees

Settling the Intractability of Multiple Alignment

An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas

Drawing Plane Graphs

The Intractability of Computing the Hamming Distance

A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model

Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications