WALCOM: Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

22

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540778905, 9783540778912

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Multi-commodity Source Location Problems and Price of Greed

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77891-2_16 ◽

2008 ◽

pp. 169-179 ◽

Author(s):

Hiro Ito ◽

Mike Paterson ◽

Kenya Sugihara

Keyword(s):

Source Location ◽

Location Problems

Download Full-text

Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77891-2_15 ◽

2008 ◽

pp. 157-168 ◽

Author(s):

Andrzej Lingas ◽

Agnieszka Wasylewicz ◽

Paweł Żyliński

Keyword(s):

Approximation Algorithm ◽

Linear Time ◽

Covering Problem

Download Full-text

Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77891-2_14 ◽

2008 ◽

pp. 144-156 ◽

Author(s):

Henning Fernau ◽

Daniel Raible

Keyword(s):

Exact Algorithms ◽

Cubic Graphs ◽

Acyclic Subgraph

Download Full-text

Guarding Exterior Region of a Simple Polygon

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77891-2_10 ◽

2008 ◽

pp. 100-110

Author(s):

Arindam Karmakar ◽

Sasanka Roy ◽

Sandip Das

Keyword(s):

Simple Polygon ◽

Exterior Region

Download Full-text

Cover Ratio of Absolute Neighbor

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77891-2_7 ◽

2008 ◽

pp. 70-80

Author(s):

Kensuke Onishi ◽

Mamoru Hoshi

Keyword(s):

Download Full-text

Multilevel Bandwidth and Radio Labelings of Graphs

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77891-2_22 ◽

2008 ◽

pp. 234-239

Author(s):

Riadh Khennoufa ◽

Olivier Togni

Download Full-text

Listing All Plane Graphs

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77891-2_20 ◽

2008 ◽

pp. 210-221 ◽

Author(s):

Katsuhisa Yamanaka ◽

Shin-ichi Nakano

Keyword(s):

Download Full-text

Four-Connected Spanning Subgraphs of Doughnut Graphs

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77891-2_13 ◽

2008 ◽

pp. 132-143 ◽

Author(s):

Md. Rezaul Karim ◽

Md. Saidur Rahman

Keyword(s):

Spanning Subgraphs

Download Full-text

Computing Nice Projections of Convex Polyhedra

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77891-2_11 ◽

2008 ◽

pp. 111-119

Author(s):

Md. Ashraful Alam ◽

Masud Hasan

Keyword(s):

Convex Polyhedra

Download Full-text

Upward Drawings of Trees on the Minimum Number of Layers

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77891-2_9 ◽

2008 ◽

pp. 88-99 ◽

Author(s):

Md. Jawaherul Alam ◽

Md. Abul Hassan Samee ◽

Md. Mashfiqui Rabbi ◽

Md. Saidur Rahman

Keyword(s):

Number Of Layers ◽

Download Full-text