Ausgabe 3/2018
Inhalt (18 Artikel)
The Best-or-Worst and the Postdoc problems
L. Bayón, P. Fortuny Ayuso, J. M. Grau, A. M. Oller-Marcén, M. M. Ruiz
Sparse multipartite graphs as partition universal for graphs with bounded degree
Qizhong Lin, Yusheng Li
An algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
Xing Feng, Lianzhu Zhang, Mingzu Zhang
Neighbor sum distinguishing list total coloring of subcubic graphs
You Lu, Chuandong Xu, Zhengke Miao
Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
Asaf Levin, Aleksander Vainer
The matching extension problem in general graphs is co-NP-complete
Jan Hackfeld, Arie M. C. A. Koster
Race to idle or not: balancing the memory sleep time with DVS for energy minimization
Chenchen Fu, Vincent Chau, Minming Li, Chun Jason Xue
Complexity and inapproximability results for the Power Edge Set problem
Sonia Toubaline, Claudia D’Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai
An approximation algorithm for maximum internal spanning tree
Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang