The Laplacian of a uniform hypergraph Shenglong HuLiqun Qi OriginalPaper 05 February 2013 Pages: 331 - 366
General lower bound on the size of \((H;k)\)-stable graphs Andrzej Żak OriginalPaper Open access 15 February 2013 Pages: 367 - 372
Two smaller upper bounds of list injective chromatic number Yuehua BuKai LuSheng Yang OriginalPaper 21 February 2013 Pages: 373 - 388
On the \(p\)-reinforcement and the complexity You LuFu-Tao HuJun-Ming Xu OriginalPaper 23 February 2013 Pages: 389 - 405
Transformation from PLTL to automata via NFGs Cong TianZhenhua DuanMengfei Yang OriginalPaper 07 March 2013 Pages: 406 - 417
Network construction with subgraph connectivity constraints Dana AngluinJames AspnesLev Reyzin OriginalPaper 24 March 2013 Pages: 418 - 432
A tolerance-based heuristic approach for the weighted independent set problem B. I. GoldengorinD. S. MalyshevV. A. Zamaraev OriginalPaper 26 March 2013 Pages: 433 - 450
Embedding signed graphs in the line Eduardo G. PardoMauricio SotoChristopher Thraves OriginalPaper 28 March 2013 Pages: 451 - 471
On the complexity of connectivity in cognitive radio networks through spectrum assignment Hongyu LiangTiancheng LouDongxiao Yu OriginalPaper 30 March 2013 Pages: 472 - 487
Algorithms and complexity results for labeled correlation clustering problem Xianmin LiuJianzhong Li OriginalPaper 31 March 2013 Pages: 488 - 501
Nordhaus–Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers Damei LüJuan DuDan Yi OriginalPaper 04 April 2013 Pages: 502 - 510