Special Issue on Selected Papers from the Tenth International Workshop on Algorithms and Computation (WALCOM 2016)

Geodesic

Parcourir par

Volume 21 (2017) no. 3

Sommaire

Guest Editors' Foreword

Mohammed Kaykobad ; Rossella Petreschi

p. 245-246

Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game

Morito Oomine ; Aleksandar Shurbevski ; Hiroshi Nagamochi

p. 247-263

Generalized Bounded Tree Cover of a Graph

Barun Gorain ; Partha Sarathi Mandal ; Krishnendu Mukhopadhyaya

p. 265-280

On Aligned Bar 1-Visibility Graphs

Franz Brandenburg ; Alexander Esch ; Daniel Neuwirth

p. 281-312

Vertex-Coloring with Defects

Patrizio Angelini ; Michael Bekos ; Felice De Luca ; Walter Didimo ; Michael Kaufmann ; Stephen Kobourov ; Fabrizio Montecchiani ; Chrysanthi Raftopoulou ; Vincenzo Roselli ; Antonios Symvonis

p. 313-340

A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs

Md. Iqbal Hossain ; Sammi Abida Salma ; Md. Saidur Rahman ; Debajyoti Mondal

p. 341-352

Hamiltonian chromatic number of block graphs

Devsi Bantva

p. 353-369

Lower Bounds for Graph Exploration Using Local Policies

Aditya Kumar Akash ; Sándor Fekete ; Seoung Kyou Lee ; Alejandro López-Ortiz ; Daniela Maftuleac ; James McLurkin

p. 371-387