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

TOTAL DOCUMENTS

23

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642280757, 9783642280764

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Nash Equilibria with Minimum Potential in Undirected Broadcast Games

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

10.1007/978-3-642-28076-4_22 ◽

2012 ◽

pp. 217-228 ◽

Author(s):

Yasushi Kawase ◽

Kazuhisa Makino

Keyword(s):

Nash Equilibria ◽

Minimum Potential

Download Full-text

Drawing Unordered Trees on k-Grids

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

10.1007/978-3-642-28076-4_20 ◽

2012 ◽

pp. 198-210 ◽

Author(s):

Christian Bachmaier ◽

Marco Matzeder

Keyword(s):

Unordered Trees

Download Full-text

On the Round-Trip 1-Center and 1-Median Problems

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

10.1007/978-3-642-28076-4_12 ◽

2012 ◽

pp. 100-111 ◽

Author(s):

Biing-Feng Wang ◽

Jhih-Hong Ye ◽

Pei-Jung Chen

Keyword(s):

Median Problems

Download Full-text

Approximating the Multi-level Bottleneck Assignment Problem

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

10.1007/978-3-642-28076-4_9 ◽

2012 ◽

pp. 64-75 ◽

Author(s):

Trivikram Dokka ◽

Anastasia Kouvela ◽

Frits C. R. Spieksma

Keyword(s):

Assignment Problem ◽

Bottleneck Assignment Problem ◽

Download Full-text

Range Aggregate Maximal Points in the Plane

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

10.1007/978-3-642-28076-4_8 ◽

2012 ◽

pp. 52-63 ◽

Author(s):

Ananda Swarup Das ◽

Prosenjit Gupta ◽

Anil Kishore Kalavagattu ◽

Jatin Agarwal ◽

Kannan Srinathan ◽

...

Keyword(s):

Download Full-text

Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments

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

10.1007/978-3-642-28076-4_7 ◽

2012 ◽

pp. 40-51 ◽

Author(s):

Sang Won Bae

Keyword(s):

Voronoi Diagrams ◽

Tight Bound ◽

Download Full-text

Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression

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

10.1007/978-3-642-28076-4_4 ◽

2012 ◽

pp. 5-16

Author(s):

Takeaki Uno ◽

Ryuhei Uehara ◽

Shin-ichi Nakano

Download Full-text

Heuristics for the Maximum 2-layer RAC Subgraph Problem

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

10.1007/978-3-642-28076-4_21 ◽

2012 ◽

pp. 211-216 ◽

Author(s):

Emilio Di Giacomo ◽

Walter Didimo ◽

Luca Grilli ◽

Giuseppe Liotta ◽

Salvatore A. Romeo

Download Full-text

Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers

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

10.1007/978-3-642-28076-4_23 ◽

2012 ◽

pp. 229-240

Author(s):

Vorapong Suppakitpaisarn ◽

Masato Edahiro ◽

Hiroshi Imai

Keyword(s):

Hamming Weight ◽

Download Full-text

Universal Line-Sets for Drawing Planar 3-Trees

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

10.1007/978-3-642-28076-4_15 ◽

2012 ◽

pp. 136-147 ◽

Author(s):

Md. Iqbal Hossain ◽

Debajyoti Mondal ◽

Md. Saidur Rahman ◽

Sammi Abida Salma

Download Full-text