Issue 1/2013
Content (16 Articles)
Open Access
The three-dimensional matching problem in Kalmanson matrices
Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
On the outer-connected domination in graphs
M. H. Akhbari, R. Hasni, O. Favaron, H. Karami, S. M. Sheikholeslami
Parameterized complexity of k-anonymity: hardness and tractability
Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola
Optimal key tree structure for two-user replacement and deletion problems
Weiwei Wu, Minming Li, Enhong Chen
Maximum latency scheduling problem on two-person cooperative games
Yanhong Gu, Jing Fan, Guochun Tang, Jiaofei Zhong
An adaptive multistart tabu search approach to solve the maximum clique problem
Qinghua Wu, Jin-Kao Hao
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
Hervé Hocquard, Mickaël Montassier
Practical unicast and convergecast scheduling schemes for cognitive radio networks
Shouling Ji, Arif Selcuk Uluagac, Raheem Beyah, Zhipeng Cai
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten