Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

51

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540562795, 9783540475019

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Wiring knock-knee layouts: A global approach

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-56279-6_91 ◽

1992 ◽

pp. 388-399

Author(s):

Majid Sarrafzadeh ◽

Dorothea Wagner ◽

Frank Wagner ◽

Karsten Weihe

Keyword(s):

Global Approach

Download Full-text

How to generate realistic sample problems for network optimization

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-56279-6_87 ◽

1992 ◽

pp. 342-350

Author(s):

Masao Iri

Keyword(s):

Network Optimization

Download Full-text

Generating small convergent systems can be extremely hard

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-56279-6_83 ◽

1992 ◽

pp. 299-308

Author(s):

Klaus Madlener ◽

Friedrich Otto ◽

Andrea Sattler-Klein

Download Full-text

On malign input distributions for algorithms

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-56279-6_77 ◽

1992 ◽

pp. 239-248

Author(s):

Kojiro Kobayashi

Download Full-text

Topologically consistent algorithms related to convex polyhedra

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-56279-6_74 ◽

1992 ◽

pp. 209-218 ◽

Author(s):

Kokichi Sugihara

Keyword(s):

Convex Polyhedra

Download Full-text

Relativizations of the P=? NP and other problems: Some developments in structural complexity theory

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-56279-6_70 ◽

1992 ◽

pp. 175-186

Author(s):

Ronald V. Book

Keyword(s):

Complexity Theory ◽

Structural Complexity

Download Full-text

Algorithms for a class of Min-Cut and Max-Cut problem

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-56279-6_62 ◽

1992 ◽

pp. 97-105

Author(s):

Teofilo F. Gonzalez ◽

Toshio Murayama

Keyword(s):

Max Cut Problem ◽

Download Full-text

Self-adjusting augmented search trees

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-56279-6_61 ◽

1992 ◽

pp. 88-96

Author(s):

Tony W. Lai

Keyword(s):

Download Full-text

Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-56279-6_56 ◽

1992 ◽

pp. 41-50 ◽

Author(s):

Sachin Patkar ◽

H. Narayanan

Keyword(s):

Fast Algorithms ◽

Submodular Functions ◽

Generic Rigidity ◽

Principal Lattice

Download Full-text

Approximating treewidth and pathwidth of some classes of perfect graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-56279-6_64 ◽

1992 ◽

pp. 116-125 ◽

Author(s):

Ton Kloks ◽

Hans Bodlaender

Keyword(s):

Download Full-text