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

TOTAL DOCUMENTS

33

(FIVE YEARS 1)

H-INDEX

3

(FIVE YEARS 0)

Published By Springer International Publishing

9783030105631, 9783030105648

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Correction to: Weighted Upper Edge Cover: Complexity and Approximability

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

10.1007/978-3-030-10564-8_33 ◽

2019 ◽

pp. C1-C1

Author(s):

Kaveh Khoshkhah ◽

Mehdi Khosravian Ghadikolaei ◽

Jérôme Monnot ◽

Florian Sikora

Keyword(s):

Download Full-text

A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract)

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

10.1007/978-3-030-10564-8_5 ◽

2018 ◽

pp. 56-66 ◽

Author(s):

Anik Sarker ◽

Wing-kin Sung ◽

M. Sohel Rahman

Keyword(s):

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm

Download Full-text

The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver

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

10.1007/978-3-030-10564-8_16 ◽

2018 ◽

pp. 199-208

Author(s):

Shuji Jimbo ◽

Akira Maruoka

Keyword(s):

Upper Bound ◽

Complete Graphs

Download Full-text

Drawing Clustered Graphs on Disk Arrangements

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

10.1007/978-3-030-10564-8_13 ◽

2018 ◽

pp. 160-171

Author(s):

Tamara Mchedlidze ◽

Marcel Radermacher ◽

Ignaz Rutter ◽

Nina Zimbel

Download Full-text

Greedy Consensus Tree and Maximum Greedy Consensus Tree Problems

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

10.1007/978-3-030-10564-8_24 ◽

2018 ◽

pp. 305-316

Author(s):

Wing-Kin Sung

Keyword(s):

Download Full-text

Maximum-Width Empty Square and Rectangular Annulus

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

10.1007/978-3-030-10564-8_6 ◽

2018 ◽

pp. 69-81

Author(s):

Sang Won Bae ◽

Arpita Baral ◽

Priya Ranjan Sinha Mahapatra

Keyword(s):

Download Full-text

Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems

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

10.1007/978-3-030-10564-8_23 ◽

2018 ◽

pp. 289-301 ◽

Author(s):

Ajinkya Borle ◽

Samuel J. Lomonaco

Keyword(s):

Least Squares ◽

Quantum Annealing ◽

Linear Least Squares ◽

Least Squares Problems ◽

Linear Least Squares Problems

Download Full-text

Covering and Packing of Rectilinear Subdivision

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

10.1007/978-3-030-10564-8_30 ◽

2018 ◽

pp. 381-393 ◽

Author(s):

Satyabrata Jana ◽

Supantha Pandit

Download Full-text

Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem

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

10.1007/978-3-030-10564-8_20 ◽

2018 ◽

pp. 248-260 ◽

Author(s):

Soh Kumabe ◽

Takanori Maehara ◽

Ryoma Sin’ya

Keyword(s):

Knapsack Problem ◽

Polynomial Factor

Download Full-text

Matching Sets of Line Segments

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

10.1007/978-3-030-10564-8_21 ◽

2018 ◽

pp. 261-273

Author(s):

Hyeyun Yang ◽

Antoine Vigneron

Keyword(s):

Download Full-text