Vol. 26 No. 2 (2022): Special Issue on Selected Papers from the 15th International Conference and Workshops on Algorithms and Computation, WALCOM 2021

Published: 2022-06-01

Guest Editors’ Foreword

Seok-Hee Hong, Subhas Nandy, Ryuhei Uehara

207-208
- article (PDF)
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs

Ahmad Biniaz

209-224
- article (PDF)
On Compatible Matchings

Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber

225-240
- article (PDF)
Computing L(p,1)-Labeling with Combined Parameters

Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono

241-255
- article (PDF)
An Improvement of Reed’s Treewidth Approximation

Mahdi Belbasi, Martin Fürer

257-282
- article (PDF)