Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

32

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer International Publishing

9783319046563, 9783319046570

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Bichromatic Point-Set Embeddings of Trees with Fewer Bends

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-04657-0_31 ◽

2014 ◽

pp. 337-348

Author(s):

Khaled Mahmud Shahriar ◽

Md. Saidur Rahman

Keyword(s):

Download Full-text

Editing the Simplest Graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-04657-0_24 ◽

2014 ◽

pp. 249-260 ◽

Author(s):

Peter Damaschke ◽

Olof Mogren

Download Full-text

Some Extensions of the Bottleneck Paths Problem

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-04657-0_18 ◽

2014 ◽

pp. 176-187 ◽

Author(s):

Tong-Wook Shinn ◽

Tadao Takaoka

Keyword(s):

Bottleneck Paths

Download Full-text

The ${\mathcal{G}}$ -Packing with t-Overlap Problem

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-04657-0_13 ◽

2014 ◽

pp. 114-124 ◽

Author(s):

Jazmín Romero ◽

Alejandro López-Ortiz

Download Full-text

Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-04657-0_27 ◽

2014 ◽

pp. 286-297

Author(s):

Jiong Guo ◽

Yash Raj Shrestha

Keyword(s):

Forbidden Subgraphs ◽

Vertex Deletion

Download Full-text

Generalized Class Cover Problem with Axis-Parallel Strips

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-04657-0_4 ◽

2014 ◽

pp. 8-21

Author(s):

Apurva Mudgal ◽

Supantha Pandit

Keyword(s):

Axis Parallel ◽

Cover Problem ◽

Parallel Strips

Download Full-text

Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-04657-0_23 ◽

2014 ◽

pp. 237-248

Author(s):

Wing-Kai Hon ◽

Ton Kloks ◽

Ching-Hao Liu ◽

Hsiang-Hsuan Liu ◽

Sheung-Hung Poon ◽

...

Keyword(s):

Independent Sets ◽

Independent Domination

Download Full-text

A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-04657-0_9 ◽

2014 ◽

pp. 68-79 ◽

Author(s):

Jean-François Baffier ◽

Vorapong Suppakitpaisarn

Keyword(s):

Network Flow ◽

Heuristic Method ◽

Flow Algorithm ◽

Download Full-text

Approximating the Bipartite TSP and Its Biased Generalization

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-04657-0_8 ◽

2014 ◽

pp. 56-67 ◽

Author(s):

Aleksandar Shurbevski ◽

Hiroshi Nagamochi ◽

Yoshiyuki Karuno

Download Full-text

ℓ1-Embeddability of 2-Dimensional ℓ1-Rigid Periodic Graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-04657-0_32 ◽

2014 ◽

pp. 349-360

Author(s):

Norie Fu

Keyword(s):

Periodic Graphs

Download Full-text