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

9783540241317, 9783540305514

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30551-4_64 ◽

2004 ◽

pp. 742-753 ◽

Cited By ~ 3

Author(s):

Jung-Heum Park ◽

Hee-Chul Kim ◽

Hyeong-Seok Lim

Keyword(s):

Disjoint Path

Download Full-text

On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30551-4_31 ◽

2004 ◽

pp. 342-351

Author(s):

Qi Cheng ◽

Ming-Deh Huang

Keyword(s):

Elliptic Curve ◽

Discrete Logarithm ◽

Discrete Logarithm Problem

Download Full-text

Multicriteria Global Minimum Cuts

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30551-4_8 ◽

2004 ◽

pp. 65-76 ◽

Cited By ~ 1

Author(s):

Amitai Armon ◽

Uri Zwick

Keyword(s):

Global Minimum ◽

Minimum Cuts

Download Full-text

New Bounds on Map Labeling with Circular Labels

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30551-4_53 ◽

2004 ◽

pp. 606-617 ◽

Cited By ~ 6

Author(s):

Minghui Jiang ◽

Sergey Bereg ◽

Zhongping Qin ◽

Binhai Zhu

Keyword(s):

Map Labeling

Download Full-text

Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30551-4_52 ◽

2004 ◽

pp. 594-605 ◽

Cited By ~ 4

Author(s):

Jerzy W. Jaromczyk ◽

Zbigniew Lonc

Download Full-text

Error Compensation in Leaf Root Problems

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30551-4_35 ◽

2004 ◽

pp. 389-401 ◽

Cited By ~ 8

Author(s):

Michael Dom ◽

Jiong Guo ◽

Falk Hüffner ◽

Rolf Niedermeier

Keyword(s):

Error Compensation

Download Full-text

On p-Norm Based Locality Measures of Space-Filling Curves

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30551-4_33 ◽

2004 ◽

pp. 364-376 ◽

Cited By ~ 3

Author(s):

H. K. Dai ◽

H. C. Su

Keyword(s):

Space Filling ◽

Space Filling Curves

Download Full-text

Efficient Job Scheduling Algorithms with Multi-type Contentions

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30551-4_29 ◽

2004 ◽

pp. 318-329

Author(s):

Zhenming Chen ◽

Vikas Singh ◽

Jinhui Xu

Keyword(s):

Job Scheduling ◽

Scheduling Algorithms

Download Full-text

On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30551-4_17 ◽

2004 ◽

pp. 172-183 ◽

Cited By ~ 3

Author(s):

Vittorio Bilò ◽

Michele Flammini ◽

Giovanna Melideo ◽

Luca Moscardelli

Keyword(s):

Wireless Networks ◽

Nash Equilibria ◽

Ad Hoc ◽

Ad Hoc Wireless Networks

Download Full-text

Augmenting the Edge-Connectivity of a Spider Tree

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30551-4_16 ◽

2004 ◽

pp. 159-171

Author(s):

Davide Bilò ◽

Guido Proietti

Keyword(s):

Edge Connectivity

Download Full-text

Algorithms and Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements

On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

Multicriteria Global Minimum Cuts

New Bounds on Map Labeling with Circular Labels

Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations

Error Compensation in Leaf Root Problems

On p-Norm Based Locality Measures of Space-Filling Curves

Efficient Job Scheduling Algorithms with Multi-type Contentions

On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks

Augmenting the Edge-Connectivity of a Spider Tree

Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications