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

TOTAL DOCUMENTS

30

(FIVE YEARS 30)

H-INDEX

2

(FIVE YEARS 2)

Published By Springer International Publishing

9783030398804, 9783030398811

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Packing Trees into 1-Planar Graphs

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

10.1007/978-3-030-39881-1_8 ◽

2020 ◽

pp. 81-93

Author(s):

Felice De Luca ◽

Emilio Di Giacomo ◽

Seok-Hee Hong ◽

Stephen Kobourov ◽

William Lenhart ◽

...

Keyword(s):

Download Full-text

Optimum Algorithm for the Mutual Visibility Problem

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

10.1007/978-3-030-39881-1_4 ◽

2020 ◽

pp. 31-42

Author(s):

Subhash Bhagat

Keyword(s):

Optimum Algorithm

Download Full-text

Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks

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

10.1007/978-3-030-39881-1_3 ◽

2020 ◽

pp. 22-27

Author(s):

Louxin Zhang

Keyword(s):

Phylogenetic Networks

Download Full-text

Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams

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

10.1007/978-3-030-39881-1_23 ◽

2020 ◽

pp. 273-285

Author(s):

Hirofumi Suzuki ◽

Masakazu Ishihata ◽

Shin-ichi Minato

Keyword(s):

Binary Decision Diagrams ◽

Decision Diagrams ◽

Survivable Networks ◽

Binary Decision

Download Full-text

Packing Arc-Disjoint Cycles in Bipartite Tournaments

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

10.1007/978-3-030-39881-1_21 ◽

2020 ◽

pp. 249-260 ◽

Author(s):

Ajay Saju Jacob ◽

R. Krithika

Keyword(s):

Disjoint Cycles

Download Full-text

Space Efficient Separator Algorithms for Planar Graphs

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

10.1007/978-3-030-39881-1_2 ◽

2020 ◽

pp. 15-21

Author(s):

Osamu Watanabe

Keyword(s):

Download Full-text

Partitioning a Graph into Complementary Subgraphs

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

10.1007/978-3-030-39881-1_19 ◽

2020 ◽

pp. 223-235

Author(s):

Julliano Rosa Nascimento ◽

Uéverton S. Souza ◽

Jayme L. Szwarcfiter

Download Full-text

Packing and Covering with Segments

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

10.1007/978-3-030-39881-1_17 ◽

2020 ◽

pp. 198-210

Author(s):

Joseph S. B. Mitchell ◽

Supantha Pandit

Keyword(s):

Packing And Covering

Download Full-text

Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons

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

10.1007/978-3-030-39881-1_13 ◽

2020 ◽

pp. 146-157

Author(s):

Chuzo Iwamoto ◽

Tatsuaki Ibusuki

Keyword(s):

Computational Complexity ◽

Art Gallery ◽

Art Gallery Problem ◽

Orthogonal Polygons

Download Full-text

Drawing Planar Graphs

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

10.1007/978-3-030-39881-1_1 ◽

2020 ◽

pp. 3-14

Author(s):

Md. Saidur Rahman ◽

Md. Rezaul Karim

Keyword(s):

Download Full-text