Algorithms - ESA’ 99 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540662518, 9783540484813

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees

Algorithms - ESA’ 99 - Lecture Notes in Computer Science ◽

10.1007/3-540-48481-7_22 ◽

1999 ◽

pp. 248-256 ◽

Cited By ~ 1

Author(s):

Ting Chen ◽

Ming-Yang Kao

Keyword(s):

Lower Bounds ◽

Upper And Lower Bounds ◽

Evolutionary Trees ◽

Informational Asymmetry

Download Full-text

Approximation Algorithms for Restoration Capacity Planning

Algorithms - ESA’ 99 - Lecture Notes in Computer Science ◽

10.1007/3-540-48481-7_10 ◽

1999 ◽

pp. 101-115 ◽

Cited By ~ 1

Author(s):

Steven J. Phillips ◽

Jeffery R. Westbrook

Keyword(s):

Approximation Algorithms ◽

Capacity Planning

Download Full-text

Efficient Algorithms for Integer Programs with Two Variables per Constraint

Algorithms - ESA’ 99 - Lecture Notes in Computer Science ◽

10.1007/3-540-48481-7_11 ◽

1999 ◽

pp. 116-126

Author(s):

Reuven Bar-Yehuda ◽

Dror Rawitz

Keyword(s):

Efficient Algorithms ◽

Integer Programs

Download Full-text

Convex Quadratic Programming Relaxations for Network Scheduling Problems

Algorithms - ESA’ 99 - Lecture Notes in Computer Science ◽

10.1007/3-540-48481-7_12 ◽

1999 ◽

pp. 127-138 ◽

Cited By ~ 7

Author(s):

Martin Skutella

Keyword(s):

Quadratic Programming ◽

Convex Quadratic Programming ◽

Scheduling Problems ◽

Network Scheduling

Download Full-text

Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices (Extended Abstract)

Algorithms - ESA’ 99 - Lecture Notes in Computer Science ◽

10.1007/3-540-48481-7_19 ◽

1999 ◽

pp. 212-223 ◽

Cited By ~ 5

Author(s):

Volker Heun

Keyword(s):

Protein Folding ◽

Side Chain ◽

Chain Model ◽

Cubic Lattices

Download Full-text

How Long Does a Bit Live in a Computer?

Algorithms - ESA’ 99 - Lecture Notes in Computer Science ◽

10.1007/3-540-48481-7_3 ◽

1999 ◽

pp. 28-28

Author(s):

Bernhard Korte

Download Full-text

Load Balancing Using Bisectors — A Tight Average-Case Analysis

Algorithms - ESA’ 99 - Lecture Notes in Computer Science ◽

10.1007/3-540-48481-7_16 ◽

1999 ◽

pp. 172-183 ◽

Cited By ~ 1

Author(s):

Stefan Bischof ◽

Thomas Schickinger ◽

Angelika Steger

Keyword(s):

Load Balancing ◽

Case Analysis ◽

Average Case Analysis ◽

Average Case

Download Full-text

Dilworth’s Theorem and Its Application for Path Systems of a Cycle—Implementation and Analysis

Algorithms - ESA’ 99 - Lecture Notes in Computer Science ◽

10.1007/3-540-48481-7_43 ◽

1999 ◽

pp. 498-509 ◽

Cited By ~ 5

Author(s):

András A. Benczúr ◽

Jörg Förster ◽

Zoltán Király

Keyword(s):

Dilworth’S Theorem

Download Full-text

Efficient Algorithms for On-Line Symbol Ranking Compression

Algorithms - ESA’ 99 - Lecture Notes in Computer Science ◽

10.1007/3-540-48481-7_25 ◽

1999 ◽

pp. 277-288 ◽

Cited By ~ 2

Author(s):

Giovanni Manzini

Keyword(s):

Efficient Algorithms ◽

On Line

Download Full-text

A Fast General Methodology for Information—Theoretically Optimal Encodings of Graphs

Algorithms - ESA’ 99 - Lecture Notes in Computer Science ◽

10.1007/3-540-48481-7_47 ◽

1999 ◽

pp. 540-549 ◽

Cited By ~ 2

Author(s):

Xin He ◽

Ming-Yang Kao ◽

Hsueh-I Lu

Keyword(s):

General Methodology

Download Full-text

Algorithms - ESA’ 99 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees

Approximation Algorithms for Restoration Capacity Planning

Efficient Algorithms for Integer Programs with Two Variables per Constraint

Convex Quadratic Programming Relaxations for Network Scheduling Problems

Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices (Extended Abstract)

How Long Does a Bit Live in a Computer?

Load Balancing Using Bisectors — A Tight Average-Case Analysis

Dilworth’s Theorem and Its Application for Path Systems of a Cycle—Implementation and Analysis

Efficient Algorithms for On-Line Symbol Ranking Compression

A Fast General Methodology for Information—Theoretically Optimal Encodings of Graphs

Algorithms - ESA’ 99 - Lecture Notes in Computer Science
Latest Publications