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

9783540429852, 9783540456780

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-45678-3_35 ◽

2001 ◽

pp. 403-415

Author(s):

James Aspnes ◽

Julia Hartling ◽

Kao Ming-Yang ◽

Junhyong Kim ◽

Gauri Shah

Keyword(s):

Protein Sequence ◽

Canonical Model ◽

Landscape Analysis ◽

Sequence Design ◽

Grand Canonical

Download Full-text

Multiprocess Time Queue

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-45678-3_51 ◽

2001 ◽

pp. 599-609

Author(s):

Andrej Brodnik ◽

Johan Karlsson

Download Full-text

Approximate Hotlink Assignment

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-45678-3_64 ◽

2001 ◽

pp. 756-767 ◽

Cited By ~ 12

Author(s):

Evangelos Kranakis ◽

Danny Krizanc ◽

Sunil Shende

Download Full-text

A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-45678-3_4 ◽

2001 ◽

pp. 36-48 ◽

Cited By ~ 7

Author(s):

Yoshiyuki Karuno ◽

Hiroshi Nagamochi

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Vehicle Scheduling ◽

Scheduling Problem ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Tight Bounds on Maximal and Maximum Matchings

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-45678-3_27 ◽

2001 ◽

pp. 308-319 ◽

Cited By ~ 2

Author(s):

Therese Biedl ◽

Erik D. Demaine ◽

Christian A. Duncan ◽

Rudolf Fleischer ◽

Stephen G. Kobourov

Download Full-text

Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-45678-3_24 ◽

2001 ◽

pp. 268-278 ◽

Cited By ~ 3

Author(s):

Takeshi Koshiba

Keyword(s):

Polynomial Time ◽

Finite Automata ◽

Polynomial Time Algorithms ◽

Quantum Finite Automata

Download Full-text

How to Color a Checkerboard with a Given Distribution — Matrix Rounding Achieving Low 2 × 2-Discrepancy

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-45678-3_54 ◽

2001 ◽

pp. 636-648 ◽

Cited By ~ 6

Author(s):

Tetsuo Asano ◽

Takeshi Tokuyama

Keyword(s):

Distribution Matrix

Download Full-text

Application of M-Convex Submodular Flow Problem to Mathematical Economics

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-45678-3_2 ◽

2001 ◽

pp. 14-25 ◽

Cited By ~ 2

Author(s):

Kazuo Murota ◽

Akihisa Tamura

Keyword(s):

Flow Problem ◽

Mathematical Economics ◽

Submodular Flow

Download Full-text

Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-45678-3_16 ◽

2001 ◽

pp. 172-184

Author(s):

Francis Y. L. Chin ◽

Stanley P. Y. Fung

Download Full-text

BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-45678-3_15 ◽

2001 ◽

pp. 160-171 ◽

Cited By ~ 14

Author(s):

Zheng Sun ◽

John Reif

Keyword(s):

Approximation Algorithm ◽

Euclidean Spaces ◽

Minimal Paths

Download Full-text

Algorithms and Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model

Multiprocess Time Queue

Approximate Hotlink Assignment

A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

Tight Bounds on Maximal and Maximum Matchings

Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata

How to Color a Checkerboard with a Given Distribution — Matrix Rounding Achieving Low 2 × 2-Discrepancy

Application of M-Convex Submodular Flow Problem to Mathematical Economics

Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees

BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces

Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications