Geodesic

Volume 18 (2014) no. 4

Sommaire

Guest Editors' Foreword
p. 491-492
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
p. 493-513
Parameterized Algorithms for the H-Packing with t-Overlap Problem
p. 515-538
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
p. 539-555
Editing Simple Graphs
p. 557-576
Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics
p. 577-602
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs
p. 603-631