Vol. 18 No. 4 (2014): Special Issue on Selected Papers from the Eighth International Workshop on Algorithms and Computation, WALCOM 2014

Published: 2014-12-01

Guest Editors' Foreword

Sudebkumar Prasant Pal, Kunihiko Sadakane

491-492
- article (PDF)
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs

B. Panda, Arti Pandey

493-513
- article (PDF)
Parameterized Algorithms for the H-Packing with t-Overlap Problem

Alejandro López-Ortiz, Jazmín Romero

515-538
- article (PDF)
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

Yuya Higashikawa, Mordecai Golin, Naoki Katoh

539-555
- article (PDF)
Editing Simple Graphs

Peter Damaschke, Olof Mogren

557-576
- article (PDF)
Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics

Nils Kriege, Petra Mutzel, Till Schäfer

577-602
- article (PDF)
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs

Jiong Guo, Yash Raj Shrestha

603-631
- article (PDF)