On the parameterized complexity of the Multi-MCT and Multi-MCST problems Wenbin ChenMatthew C. SchmidtNagiza F. Samatova OriginalPaper 10 March 2009 Pages: 151 - 158
Efficient algorithms for supergraph query processing on graph databases Shuo ZhangXiaofeng GaoHong Gao OriginalPaper 17 March 2009 Pages: 159 - 191
Approximation and hardness results for label cut and related problems Peng ZhangJin-Yi CaiWen-Bo Zhao OriginalPaper 14 March 2009 Pages: 192 - 208
Bounding the total domination subdivision number of a graph in terms of its order Odile FavaronHossein KaramiSeyyed Mahmoud Sheikholeslami OriginalPaper 21 May 2009 Pages: 209 - 218
Approximating the chromatic index of multigraphs Guantao ChenXingxing YuWenan Zang OriginalPaper 29 May 2009 Pages: 219 - 246
Minimizing the sum cost in linear extensions of a poset Longcheng LiuBiao WuEnyu Yao OriginalPaper 29 May 2009 Pages: 247 - 253
Approximating capacitated tree-routings in networks Ehab MorsyHiroshi Nagamochi OriginalPaper 30 May 2009 Pages: 254 - 267