Lecture Notes in Computer Science - Algorithms and Complexity
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540625926, 9783540683230

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The optimum cost chromatic partition problem

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-62592-5_58 ◽

1997 ◽

pp. 25-36 ◽

Cited By ~ 16

Author(s):

Klaus Jansen

Keyword(s):

Partition Problem ◽

Optimum Cost

Download Full-text

Nice drawings for planar bipartite graphs

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-62592-5_66 ◽

1997 ◽

pp. 122-134 ◽

Cited By ~ 10

Author(s):

Ulrich Fößmeier ◽

Michael Kaufmann

Keyword(s):

Bipartite Graphs

Download Full-text

Topological chaos for elementary cellular automata

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-62592-5_76 ◽

1997 ◽

pp. 241-252 ◽

Cited By ~ 1

Author(s):

Gianpiero Cattaneo ◽

Michele Finelli ◽

Luciano Margara

Keyword(s):

Cellular Automata ◽

Elementary Cellular Automata ◽

Topological Chaos

Download Full-text

Tree contractions and evolutionary trees

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-62592-5_81 ◽

1997 ◽

pp. 299-310 ◽

Cited By ~ 1

Author(s):

Ming-Yang Kao

Keyword(s):

Evolutionary Trees

Download Full-text

Relaxed balanced red-black trees

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-62592-5_72 ◽

1997 ◽

pp. 193-204 ◽

Cited By ~ 9

Author(s):

S. Hanke ◽

Th. Ottmann ◽

E. Soisalon-Soininen

Download Full-text

On sets with easy certificates and the existence of one-way permutations

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-62592-5_78 ◽

1997 ◽

pp. 264-275 ◽

Cited By ~ 5

Author(s):

Lane A. Hemaspaandra ◽

Jörg Rothe ◽

Gerd Wechsung

Download Full-text

An optimal algorithm for one-separation of a set of isothetic polygons

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-62592-5_65 ◽

1997 ◽

pp. 110-121

Author(s):

Amitava Datta ◽

Kamala Krithivasan ◽

Thomas Ottmann

Keyword(s):

Optimal Algorithm

Download Full-text

The algorithmic complexity of chemical threshold testing

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-62592-5_73 ◽

1997 ◽

pp. 205-216 ◽

Cited By ~ 2

Author(s):

Peter Damaschke

Keyword(s):

Algorithmic Complexity ◽

Threshold Testing

Download Full-text

Fault tolerant K-center problems

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-62592-5_59 ◽

1997 ◽

pp. 37-48 ◽

Cited By ~ 1

Author(s):

Samir Khuller ◽

Robert Pless ◽

Yoram J. Sussmann

Keyword(s):

Fault Tolerant

Download Full-text

Hardness of approximating problems on cubic graphs

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-62592-5_80 ◽

1997 ◽

pp. 288-298 ◽

Cited By ~ 47

Author(s):

Paola Alimonti ◽

Viggo Kann

Keyword(s):

Cubic Graphs

Download Full-text

Lecture Notes in Computer Science - Algorithms and ComplexityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The optimum cost chromatic partition problem

Nice drawings for planar bipartite graphs

Topological chaos for elementary cellular automata

Tree contractions and evolutionary trees

Relaxed balanced red-black trees

On sets with easy certificates and the existence of one-way permutations

An optimal algorithm for one-separation of a set of isothetic polygons

The algorithmic complexity of chemical threshold testing

Fault tolerant K-center problems

Hardness of approximating problems on cubic graphs

Lecture Notes in Computer Science - Algorithms and Complexity
Latest Publications