Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2012] | [2013] | [2014] | [2015] | [2016] | [2017] | [2018] | [Japanese] / [English]
COMP2015-1
Algorithms for Dominating Set Reconfiguration Problem
Arash Haddadan (Univ. of Waterloo), Takehiro Ito (Tohoku Univ.), Amer E. Mouawad, Naomi Nishimura (Univ. of Waterloo), Hirotaka Ono (Kyushu Univ.), Akira Suzuki (Tohoku Univ.), Youcef Tebbal (Univ. of Waterloo)
pp. 1 - 7
COMP2015-2
Approximability of width parameters
Koichi Yamazaki (Gunma Univ.)
pp. 9 - 13
COMP2015-3
Frontier Method for Enumerating and Indexing the Vertex Induced Subgraphs
Hirofumi Suzuki, Shin-ichi Minato (Hokkaido Univ.)
pp. 15 - 20
COMP2015-4
Computational Complexity of Generalized Makespan Minimization Problem
Tsunehiko Nagayama, Kunihiko Sadakane (Univ. of Tokyo)
pp. 21 - 25
COMP2015-5
On Complexity of Loosely-Stabilizing Leader Election in Population Protocol Models
Taisuke Izumi, Kenji Hata (NITECH)
pp. 27 - 31
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.