On two conjectures concerning total domination subdivision number in graphs Rana KhoeilarHossein KaramiSeyed Mahmoud Sheikholeslami OriginalPaper 29 January 2019 Pages: 333 - 340
A linear time–cost tradeoff problem with multiple milestones under a comb graph Byung-Cheon ChoiChangmuk Kang OriginalPaper 01 February 2019 Pages: 341 - 361
Parameterized Mixed Graph Coloring Peter Damaschke OriginalPaper Open access 07 February 2019 Pages: 362 - 374
Approximation algorithms for Median Hub Location Problems Marcelo P. L. BeneditoLehilton L. C. Pedrosa OriginalPaper 07 February 2019 Pages: 375 - 401
A temporal logic programming approach to planning Kai YangCong TianHongwei Du OriginalPaper 09 February 2019 Pages: 402 - 420
On the extremal cacti of given parameters with respect to the difference of zagreb indices Shuchao LiLicheng ZhangMinjie Zhang OriginalPaper 19 February 2019 Pages: 421 - 442
Minimum Szeged index among unicyclic graphs with perfect matchings Hechao LiuHanyuan DengZikai Tang OriginalPaper 19 February 2019 Pages: 443 - 455
The edge coloring game on trees with the number of colors greater than the game chromatic index Wai Lam FongWai Hong Chan OriginalPaper 19 February 2019 Pages: 456 - 480
Clustering without replication in combinatorial circuits Zola DonovanGregory GutinK. Subramani OriginalPaper 21 February 2019 Pages: 481 - 501
Gene tree reconciliation including transfers with replacement is NP-hard and FPT Damir HasićEric Tannier OriginalPaper 22 February 2019 Pages: 502 - 544
Optimal r-dynamic coloring of sparse graphs Dan YiJunlei ZhuMengyini Yang OriginalPaper 27 February 2019 Pages: 545 - 555
The eigenvectors to the p-spectral radius of general hypergraphs Liying KangLele LiuErfang Shan OriginalPaper 28 February 2019 Pages: 556 - 569
The rank of a complex unit gain graph in terms of the rank of its underlying graph Yong LuLigong WangQiannan Zhou OriginalPaper 07 March 2019 Pages: 570 - 588
A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs Jun LiangDingjun LouQinglin Yu OriginalPaper 11 March 2019 Pages: 589 - 607
A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max }\) problem Federico Della CroceRosario ScatamacchiaVincent T’kindt OriginalPaper 18 March 2019 Pages: 608 - 617
Approximation algorithm for squared metric two-stage stochastic facility location problem Jin ZhangMin LiDachuan Xu OriginalPaper 19 March 2019 Pages: 618 - 634
The connected vertex cover problem in k-regular graphs Yuchao LiWei WangZishen Yang OriginalPaper 19 March 2019 Pages: 635 - 645
