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

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

Download Full-text

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

Download Full-text

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

Download Full-text

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

Download Full-text

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

Download Full-text

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

Download Full-text

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

Download Full-text

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

Download Full-text

Energy-Efficient Wireless Network Design

Algorithms and Computation - Lecture Notes in Computer Science ◽

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

2003 ◽

pp. 585-594 ◽

Cited By ~ 6

Author(s):

Ioannis Caragiannis ◽

Christos Kaklamanis ◽

Panagiotis Kanellopoulos

Keyword(s):

Network Design ◽

Wireless Network ◽

Energy Efficient ◽

Wireless Network Design

Download Full-text

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

Download Full-text

Algorithms and Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

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

Energy-Efficient Wireless Network Design

Efficient Algorithms for Optimizing Whole Genome Alignment with Noise

Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications