Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540228561, 9783540277989

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Coloring Octrees

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_9 ◽

2004 ◽

pp. 62-71

Author(s):

Udo Adamy ◽

Michael Hoffmann ◽

József Solymosi ◽

Miloš Stojaković

Download Full-text

Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_48 ◽

2004 ◽

pp. 450-461 ◽

Cited By ~ 2

Author(s):

Tatsuie Tsukiji ◽

Zhi-Zhong Chen

Download Full-text

New Approximation Algorithms for Some Dynamic Storage Allocation Problems

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_37 ◽

2004 ◽

pp. 339-348 ◽

Cited By ~ 3

Author(s):

Shuai Cheng Li ◽

Hon Wai Leong ◽

Steven K. Quek

Keyword(s):

Approximation Algorithms ◽

Storage Allocation ◽

Dynamic Storage Allocation ◽

Allocation Problems ◽

Dynamic Storage

Download Full-text

Maximization of the Size and the Weight of Schedules of Degradable Intervals

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_25 ◽

2004 ◽

pp. 219-228 ◽

Cited By ~ 2

Author(s):

Fabien Baille ◽

Evripidis Bampis ◽

Christian Laforest

Download Full-text

Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_14 ◽

2004 ◽

pp. 112-121 ◽

Cited By ~ 1

Author(s):

Ying Du ◽

Danny Z. Chen ◽

Xiaodong Wu

Keyword(s):

Experimental Study ◽

Approximation Algorithms ◽

Multicommodity Flow ◽

Normalized Cut ◽

Cut Problems

Download Full-text

A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_31 ◽

2004 ◽

pp. 278-289 ◽

Cited By ~ 11

Author(s):

Tadao Takaoka

Keyword(s):

Shortest Path ◽

Shortest Path Problem ◽

All Pairs Shortest Path

Download Full-text

The Worst-Case Time Complexity for Generating All Maximal Cliques

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_19 ◽

2004 ◽

pp. 161-170 ◽

Cited By ~ 29

Author(s):

Etsuji Tomita ◽

Akira Tanaka ◽

Haruhisa Takahashi

Keyword(s):

Time Complexity ◽

Worst Case

Download Full-text

Towards Constructing Optimal Strip Move Sequences

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_6 ◽

2004 ◽

pp. 33-42 ◽

Cited By ~ 2

Author(s):

Meena Mahajan ◽

Raghavan Rama ◽

S. Vijayakumar

Download Full-text

A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_5 ◽

2004 ◽

pp. 23-32

Author(s):

Philipp Woelfel

Keyword(s):

Construction Method

Download Full-text

An Efficient Local Alignment Algorithm for Masked Sequences

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_47 ◽

2004 ◽

pp. 440-449 ◽

Cited By ~ 1

Author(s):

Jin Wook Kim ◽

Kunsoo Park

Keyword(s):

Local Alignment ◽

Alignment Algorithm

Download Full-text

Lecture Notes in Computer Science - Computing and CombinatoricsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Coloring Octrees

Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard

New Approximation Algorithms for Some Dynamic Storage Allocation Problems

Maximization of the Size and the Weight of Schedules of Degradable Intervals

Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study

A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application

The Worst-Case Time Complexity for Generating All Maximal Cliques

Towards Constructing Optimal Strip Move Sequences

A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs

An Efficient Local Alignment Algorithm for Masked Sequences

Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications