Content
February 2021, Volume 41, Issue 2
- 526-543 Italian domination in the Cartesian product of paths
by Hong Gao & Tingting Feng & Yuansheng Yang - 544-552 The balanced double star has maximum exponential second Zagreb index
by Roberto Cruz & Juan Daniel Monsalve & Juan Rada - 553-577 Zero forcing versus domination in cubic graphs
by Randy Davila & Michael A. Henning
January 2021, Volume 41, Issue 1
- 1-11 Single machine lot scheduling with optional job-rejection
by Baruch Mor & Gur Mosheiov & Dana Shapira - 12-27 A randomized approximation algorithm for metric triangle packing
by Yong Chen & Zhi-Zhong Chen & Guohui Lin & Lusheng Wang & An Zhang - 28-42 Improved approximation algorithms for two-stage flexible flow shop scheduling
by Anzhen Peng & Longcheng Liu & Weifeng Lin - 43-55 Sequence submodular maximization meets streaming
by Ruiqi Yang & Dachuan Xu & Longkun Guo & Dongmei Zhang - 56-72 Secure Italian domination in graphs
by M. Dettlaff & M. Lemańska & J. A. Rodríguez-Velázquez - 73-79 Quaternary splitting algorithm in group testing
by Jinn Lu & Hung-Lin Fu - 80-104 Top-k overlapping densest subgraphs: approximation algorithms and computational complexity
by Riccardo Dondi & Mohammad Mehdi Hosseinzadeh & Giancarlo Mauri & Italo Zoppis - 105-117 The t-latency bounded strong target set selection problem in some kinds of special family of graphs
by Xianliang Liu & Zishen Yang & Wei Wang - 118-127 A greedy algorithm for the fault-tolerant outer-connected dominating set problem
by Xiaozhi Wang & Xianyue Li & Bo Hou & Wen Liu & Lidong Wu & Suogang Gao - 128-142 Non-monotone submodular function maximization under k-system constraint
by Majun Shi & Zishen Yang & Donghyun Kim & Wei Wang - 143-169 A scenario-based robust optimization with a pessimistic approach for nurse rostering problem
by Mohammad Reza Hassani & J. Behnamian - 170-196 On multi-path routing for reliable communications in failure interdependent complex networks
by Zishen Yang & Wei Wang & Donghyun Kim - 197-212 New construction of error-correcting pooling designs from singular linear spaces over finite fields
by Gang Wang & You Gao - 213-233 Discount allocation for cost minimization in online social networks
by Qiufen Ni & Smita Ghosh & Chuanhe Huang & Weili Wu & Rong Jin - 234-266 On characterizations for subclasses of directed co-graphs
by Frank Gurski & Dominique Komander & Carolin Rehs
November 2020, Volume 40, Issue 4
- 861-868 Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect
by Dexin Zou & Chong Jiang & Weiwei Liu - 869-875 Connected max cut is polynomial for graphs without the excluded minor $$K_5\backslash e$$ K 5 \ e
by Brahim Chaourar - 876-900 A characterization of optimal multiprocessor schedules and new dominance rules
by Rico Walter & Alexander Lawrinenko - 901-906 A short proof for stronger version of DS decomposition in set function optimization
by Xiang Li & H. George Du - 907-928 Influence maximization problem: properties and algorithms
by Wenguo Yang & Yapu Zhang & Ding-Zhu Du - 929-952 New approximation algorithms for machine scheduling with rejection on single and parallel machine
by Peihai Liu & Xiwen Lu - 953-973 General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number
by Tomáš Vetrík & Selvaraj Balachandran - 974-1007 Online maximum matching with recourse
by Spyros Angelopoulos & Christoph Dürr & Shendan Jin - 1008-1019 Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
by Zhiwei Guo & Hajo Broersma & Ruonan Li & Shenggui Zhang - 1020-1029 Intersecting families in $$\left( {\begin{array}{c}{[m]}\\ \ell \end{array}}\right) \cup \left( {\begin{array}{c}{[n]}\\ k\end{array}}\right) $$ [ m ] ℓ ∪ [ n ] k
by Jun Wang & Huajun Zhang - 1030-1043 A linear time algorithm for the p-maxian problem on trees with distance constraint
by Trung Kien Nguyen & Nguyen Thanh Hung & Huong Nguyen-Thu - 1044-1064 Minimizing maximum delivery completion time for order scheduling with rejection
by Ren-Xia Chen & Shi-Sheng Li - 1065-1074 An approximation algorithm for submodular hitting set problem with linear penalties
by Shaojing Du & Suogang Gao & Bo Hou & Wen Liu - 1075-1091 Partial inverse min–max spanning tree problem
by Javad Tayyebi & Ali Reza Sepasian - 1092-1120 Maximizing user type diversity for task assignment in crowdsourcing
by Ana Wang & Meirui Ren & Hailong Ma & Lichen Zhang & Peng Li & Longjiang Guo - 1121-1135 The maximum Wiener index of maximal planar graphs
by Debarun Ghosh & Ervin Győri & Addisu Paulos & Nika Salia & Oscar Zamora
October 2020, Volume 40, Issue 3
- 571-589 The complexity of total edge domination and some related results on trees
by Zhuo Pan & Yu Yang & Xianyue Li & Shou-Jun Xu - 590-609 A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
by Pawan Aurora & Shashank K. Mehta - 610-635 Selfish colorful bin packing games
by Vittorio Bilò & Francesco Cellinese & Giovanna Melideo & Gianpiero Monaco - 636-659 A rapid learning automata-based approach for generalized minimum spanning tree problem
by Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie - 660-696 A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints
by Norelhouda Sekkal & Fayçal Belkaid - 697-712 Average eccentricity, minimum degree and maximum degree in graphs
by P. Dankelmann & F. J. Osaye - 713-732 Maximum weight induced matching in some subclasses of bipartite graphs
by B. S. Panda & Arti Pandey & Juhi Chaudhary & Piyush Dane & Manav Kashyap - 733-756 Personalized manufacturing service composition recommendation: combining combinatorial optimization and collaborative filtering
by Shuangyao Zhao & Qiang Zhang & Zhanglin Peng & Xiaonong Lu - 757-773 Complexity and characterization aspects of edge-related domination for graphs
by Zhuo Pan & Xianyue Li & Shou-Jun Xu - 774-795 Single machine batch scheduling with two non-disjoint agents and splitable jobs
by Zhichao Geng & Jiayu Liu - 796-805 Bottleneck subset-type restricted matching problems
by Oleg Duginov - 806-824 A $$(1.4 + \epsilon )$$ ( 1.4 + ϵ ) -approximation algorithm for the 2-Max-Duo problem
by Yong Chen & Guohui Lin & Tian Liu & Taibo Luo & Bing Su & Yao Xu & Peng Zhang - 825-847 Boosting node activity by recommendations in social networks
by Wenguo Yang & Shengminjie Chen & Suixiang Gao & Ruidong Yan - 848-860 Approximating the $$\tau $$ τ -relaxed soft capacitated facility location problem
by Lu Han & Dachuan Xu & Yicheng Xu & Dongmei Zhang
August 2020, Volume 40, Issue 2
- 279-302 Crossing minimization in perturbed drawings
by Radoslav Fulek & Csaba D. Tóth - 303-332 A class of exponential neighbourhoods for the quadratic travelling salesman problem
by Brad D. Woods & Abraham P. Punnen - 333-365 Coordination mechanisms for scheduling selfish jobs with favorite machines
by Cong Chen & Yinfeng Xu - 366-378 Approximation algorithms for the selling with preference
by Pan Li & Qiang Hua & Zhijun Hu & Hing-Fung Ting & Yong Zhang - 379-411 Searching and inferring colorful topological motifs in vertex-colored graphs
by Diego P. Rubert & Eloi Araujo & Marco A. Stefanes & Jens Stoye & Fábio V. Martinez - 412-430 More on limited packings in graphs
by Xuqing Bai & Hong Chang & Xueliang Li - 431-453 Integer linear programming formulations of the filter partitioning minimization problem
by Hazhar Rahmani & Jason M. O’Kane - 454-481 The band collocation problem
by Hakan Kutucu & Arif Gursoy & Mehmet Kurt & Urfat Nuriyev - 482-500 Power domination on triangular grids with triangular and hexagonal shape
by Prosenjit Bose & Valentin Gledel & Claire Pennarun & Sander Verdonschot - 501-511 On the Roman domination subdivision number of a graph
by J. Amjadi & R. Khoeilar & M. Chellali & Z. Shao - 512-546 On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering
by Tanima Chatterjee & Bhaskar DasGupta & Laura Palmieri & Zainab Al-Qurashi & Anastasios Sidiropoulos - 547-569 Multiprocessor open shop problem: literature review and future directions
by Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan
July 2020, Volume 40, Issue 1
- 1-20 Plane graphs with $$\Delta =7$$Δ=7 are entirely 10-colorable
by Jiangxu Kong & Xiaoxue Hu & Yiqiao Wang - 21-35 Approximating the asymmetric p-center problem in parameterized complete digraphs
by Wei Ding & Ke Qiu - 36-44 A variation of DS decomposition in set function optimization
by Xiang Li & H. George Du & Panos M. Pardalos - 45-58 Planar graphs without 4- and 6-cycles are (7 : 2)-colorable
by Haitao Wu & Yaojun Chen & Xiaolan Hu - 59-68 Fractional Gallai–Edmonds decomposition and maximal graphs on fractional matching number
by Yan Liu & Mengxia Lei & Xueli Su - 69-97 A $$\frac{5}{2}$$52-approximation algorithm for coloring rooted subtrees of a degree 3 tree
by Anuj Rawat & Mark Shayman - 98-109 Secure domination of honeycomb networks
by M. R. Chithra & Manju K. Menon - 110-140 Joint chance constrained shortest path problem with Copula theory
by Zohreh Hosseini Nodeh & Ali Babapour Azar & Rashed Khanjani Shiraz & Salman Khodayifar & Panos M. Pardalos - 141-169 Classification optimization for training a large dataset with Naïve Bayes
by Thi Thanh Sang Nguyen & Pham Minh Thu Do - 170-180 An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
by Ji Tian & Yan Zhou & Ruyan Fu - 181-204 New restrictions on defective coloring with applications to steinberg-type graphs
by Addie Armstrong & Nancy Eaton - 205-226 KATZ centrality with biogeography-based optimization for influence maximization problem
by Abbas Salehi & Behrooz Masoumi - 227-233 The strong chromatic index of graphs with edge weight eight
by Lily Chen & Shumei Chen & Ren Zhao & Xiangqian Zhou - 234-278 Analysis of Divide-and-Conquer strategies for the 0–1 minimization knapsack problem
by Fernando A. Morales & Jairo A. Martínez
May 2020, Volume 39, Issue 4
- 933-954 An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
by Yi Chu & Boxiao Liu & Shaowei Cai & Chuan Luo & Haihang You - 955-987 Co-density and fractional edge cover packing
by Qiulan Zhao & Zhibin Chen & Jiajun Sang - 988-1016 On the robustness of a synchronized multi-robot system
by Sergey Bereg & Andrew Brunner & Luis-Evaristo Caraballo & José-Miguel Díaz-Báñez & Mario A. Lopez - 1017-1037 Maximum independent and disjoint coverage
by Amit Kumar Dhar & Raghunath Reddy Madireddy & Supantha Pandit & Jagpreet Singh - 1038-1059 Neighbour-distinguishing labellings of powers of paths and powers of cycles
by Atílio G. Luiz & C. N. Campos & Simone Dantas & Diana Sasaki - 1060-1078 Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
by Dawei Li & Xiwen Lu - 1079-1095 Stabilizing social structure via modifying local patterns
by Sajjad Salehi & Fattaneh Taghiyareh - 1096-1128 The quadratic cycle cover problem: special cases and efficient bounds
by Frank Meijer & Renata Sotirov - 1129-1152 Local antimagic orientation of graphs
by Yulin Chang & Fei Jing & Guanghui Wang - 1153-1207 Efficient reassembling of three-regular planar graphs
by Assaf Kfoury & Laura Sisson - 1208-1220 A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
by Qingqin Nong & Jiazhu Fang & Suning Gong & Dingzhu Du & Yan Feng & Xiaoying Qu
April 2020, Volume 39, Issue 3
- 637-661 Bicriteria scheduling of equal length jobs on uniform parallel machines
by Qiulan Zhao & Jinjiang Yuan - 662-686 The complexity of symmetric connectivity in directional wireless sensor networks
by Tien Tran & Dung T. Huynh - 687-707 Compact quadratizations for pseudo-Boolean functions
by Endre Boros & Yves Crama & Elisabeth Rodríguez-Heck - 708-724 Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles
by Feifeng Zheng & Yaxin Pang & Ming Liu & Yinfeng Xu - 725-746 A primal-dual algorithm for the minimum partial set multi-cover problem
by Yingli Ran & Yishuo Shi & Changbing Tang & Zhao Zhang - 747-763 Algorithmic and complexity aspects of problems related to total Roman domination for graphs
by Abolfazl Poureidi & Nader Jafari Rad - 764-775 Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
by Vincent T’kindt & Lei Shang & Federico Della Croce - 776-791 On reduced second Zagreb index
by Lkhagva Buyantogtokh & Batmend Horoldagva & Kinkar Chandra Das - 792-825 Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
by Rupaj Kumar Nayak & Nirmalya Kumar Mohanty - 826-848 Linear time algorithms for finding independent spanning trees on pyramid networks
by Shuo-I Wang & Fu-Hsing Wang - 849-858 Marginal contributions and derivatives for set functions in cooperative games
by Daniel Li Li & Erfang Shan - 859-873 On the sizes of bi-k-maximal graphs
by Liqiong Xu & Yingzhi Tian & Hong-Jian Lai - 874-898 Contrast in greyscales of graphs
by Natalia Castro & María A. Garrido-Vizuete & Rafael Robles & María Trinidad Villar-Liñán - 899-914 3D camera sensor scheduling algorithms for indoor multi-objective tracking
by Yi Hong & Yongcai Wang & Yuqing Zhu & Deying Li & Zhibo Chen & Jing Li - 915-932 Fractional matching preclusion number of graphs and the perfect matching polytope
by Ruizhi Lin & Heping Zhang
February 2020, Volume 39, Issue 2
- 305-314 Price of dependence: stochastic submodular maximization with dependent items
by Shaojie Tang - 315-333 The average covering tree value for directed graph games
by Anna Khmelnitskaya & Özer Selçuk & Dolf Talman - 334-350 On the edge metric dimension of convex polytopes and its related graphs
by Yuezhong Zhang & Suogang Gao - 351-364 The Wiener index of hypergraphs
by Xiangxiang Liu & Ligong Wang & Xihe Li - 365-384 On the zero forcing number of a graph involving some classical parameters
by Shuchao Li & Wanting Sun - 385-411 A new approximate cluster deletion algorithm for diamond-free graphs
by Sabrine Malek & Wady Naanaa - 412-424 On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
by H. Hocquard & J. Przybyło - 425-436 Domination and matching in power and generalized power hypergraphs
by Yanxia Dong & Moo Young Sohn & Zuosong Liang - 437-456 Nontrivial path covers of graphs: existence, minimization and maximization
by Renzo Gómez & Yoshiko Wakabayashi - 457-491 Degree bounded bottleneck spanning trees in three dimensions
by Patrick J. Andersen & Charl J. Ras - 492-508 Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
by Jianping Li & Suding Liu & Junran Lichen & Wencheng Wang & Yujie Zheng - 509-518 A new upper bound on the work function algorithm for the k-server problem
by Wenming Zhang & Yongxi Cheng - 519-546 Research on the impact of green innovation alliance mode on decision-making of two-cycle closed-loop supply chain
by Chunmei Ma & Dan Huang - 547-580 A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA–VNS algorithm
by Wenjuan Fan & Yi Wang & Tongzhu Liu & Guixian Tong - 581-588 Equitable partition of graphs into induced linear forests
by Xin Zhang & Bei Niu - 589-601 On alternating paths and the smallest positive eigenvalue of trees
by Sonu Rani & Sasmita Barik - 602-617 A new leader guided optimization for the flexible job shop problem
by Fraj Naifar & Mariem Gzara & Moalla Taicir Loukil - 618-635 Local search strikes again: PTAS for variants of geometric covering and packing
by Pradeesha Ashok & Aniket Basu Roy & Sathish Govindarajan
January 2020, Volume 39, Issue 1
- 1-14 Approximation algorithms for two-stage flexible flow shop scheduling
by Minghui Zhang & Yan Lan & Xin Han - 15-32 The seeding algorithm for k-means problem with penalties
by Min Li & Dachuan Xu & Jun Yue & Dongmei Zhang & Peng Zhang - 33-54 Less is more approach for competing groups scheduling with different learning effects
by Baoyu Liao & Xingming Wang & Xing Zhu & Shanlin Yang & Panos M. Pardalos - 55-71 Graphs with equal domination and covering numbers
by Andrzej Lingas & Mateusz Miotk & Jerzy Topp & Paweł Żyliński - 72-76 Neighbor product distinguishing total colorings of 2-degenerate graphs
by Enqiang Zhu & Chanjuan Liu & Jiguo Yu - 77-89 Bounds on upper transversals in hypergraphs
by Michael A. Henning & Anders Yeo - 90-114 Algorithmic results on double Roman domination in graphs
by S. Banerjee & Michael A. Henning & D. Pradhan - 115-137 On the extremal graphs with respect to the total reciprocal edge-eccentricity
by Lifang Zhao & Hongshuai Li & Yuping Gao - 138-148 Approximation algorithm for a generalized Roman domination problem in unit ball graphs
by Limin Wang & Yalin Shi & Zhao Zhang & Zan-Bo Zhang & Xiaoyan Zhang - 149-155 Remarks on Barnette’s conjecture
by Jan Florek - 156-169 Tree-coloring problems of bounded treewidth graphs
by Bi Li & Xin Zhang - 170-184 The structure of graphs with given number of blocks and the maximum Wiener index
by Stéphane Bessy & François Dross & Katarína Hriňáková & Martin Knor & Riste Škrekovski - 185-215 Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs
by Shuwan Zhu & Wenjuan Fan & Tongzhu Liu & Shanlin Yang & Panos M. Pardalos - 216-245 Efficient algorithms for measuring the funnel-likeness of DAGs
by Marcelo Garlet Millani & Hendrik Molter & Rolf Niedermeier & Manuel Sorge - 246-272 Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
by Jingjing Huo & Yiqiao Wang & Weifan Wang & Wenjing Xia - 273-292 On the König deficiency of zero-reducible graphs
by Miklós Bartha & Miklós Krész - 293-303 Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
by Chao Song & Changqing Xu
November 2019, Volume 38, Issue 4
- 987-1004 Minimum cost stability in exchange networks
by Yuqing Zhu & Ruidong Yan & Deying Li - 1005-1018 Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
by Xianyue Li & Xichao Shu & Huijing Huang & Jingjing Bai - 1019-1042 Minimizing data collection latency with unmanned aerial vehicle in wireless sensor networks
by Chuanwen Luo & Yongcai Wang & Yi Hong & Wenping Chen & Xingjian Ding & Yuqing Zhu & Deying Li - 1043-1065 Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
by Kenjiro Takazawa - 1066-1076 MapReduce machine covering problem on a small number of machines
by Yiwei Jiang & Ping Zhou & Wei Zhou - 1077-1085 Antimagic orientations for the complete k-ary trees
by Chen Song & Rong-Xia Hao - 1086-1100 Multiple Canadians on the road: minimizing the distance competitive ratio
by Pierre Bergé & Jean Desmarchelier & Wen Guo & Aurélie Lefebvre & Arpad Rimmel & Joanna Tomasik - 1101-1127 Minimum budget for misinformation blocking in online social networks
by Canh V. Pham & Quat V. Phu & Huan X. Hoang & Jun Pei & My T. Thai - 1128-1142 The $$\alpha $$ α -spectral radius of uniform hypergraphs concerning degrees and domination number
by Qiannan Wang & Liying Kang & Erfang Shan & Zuosong Liang - 1143-1154 Fractional matching preclusion of the restricted HL-graphs
by Shunzhe Zhang & Huiqing Liu & Dong Li & Xiaolan Hu - 1155-1179 On the approximability of the two-phase knapsack problem
by Kameng Nip & Zhenbo Wang - 1180-1195 Node set optimization problem for complete Josephus cubes
by Micheal Arockiaraj & Jessie Abraham & Arul Jeya Shalini - 1196-1212 Approximation of Steiner forest via the bidirected cut relaxation
by Ali Çivril - 1213-1262 Random walk’s correlation function for multi-objective NK landscapes and quadratic assignment problem
by Madalina M. Drugan - 1263-1285 Information security decisions for two firms in a market with different types of customers
by Xiaofei Qian & Jun Pei & Xinbao Liu & Mi Zhou & Panos M. Pardalos - 1286-1295 Orderings of a class of trees with respect to the Merrifield–Simmons index and the Hosoya index
by Wenwen Tian & Fei Zhao & Zheng Sun & Xuesong Mei & Guangde Chen - 1296-1304 On the maximum size of subfamilies of labeled set with given matching number
by Huajun Zhang
October 2019, Volume 38, Issue 3
- 667-679 Extremal digraphs for an upper bound on the Roman domination number
by Lyes Ouldrabah & Mostafa Blidia & Ahmed Bouchou - 680-688 On the k-domination number of digraphs
by Lyes Ouldrabah & Mostafa Blidia & Ahmed Bouchou - 689-697 Improved approximation algorithms for the combination problem of parallel machine scheduling and path
by Li Guan & Jianping Li & Weidong Li & Junran Lichen - 698-711 Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
by Yuan Gao & Jinjiang Yuan - 712-720 On perfect Roman domination number in trees: complexity and bounds
by Mahsa Darkooti & Abdollah Alhevaz & Sadegh Rahimi & Hadi Rahbani - 721-738 A new lower bound on the domination number of a graph
by Majid Hajian & Michael A. Henning & Nader Jafari Rad - 739-747 Packing parameters in graphs: new bounds and a solution to an open problem
by Doost Ali Mojdeh & Babak Samadi - 748-793 Hybrid algorithms for placement of virtual machines across geo-separated data centers
by Fernando Stefanello & Vaneet Aggarwal & Luciana S. Buriol & Mauricio G. C. Resende - 794-807 The clique-perfectness and clique-coloring of outer-planar graphs
by Zuosong Liang & Erfang Shan & Liying Kang - 808-835 An evolutionary approach for the target search problem in uncertain environment
by M. Barkaoui & J. Berger & A. Boukhtouta - 836-845 2-Rainbow domination stability of graphs
by Zepeng Li & Zehui Shao & Shou-jun Xu - 846-866 A lower bound for online rectangle packing
by Leah Epstein - 867-886 Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach
by Gergely Kovács & Benedek Nagy & Béla Vizvári - 887-910 Characterizations of matroids with an element lying in a restricted number of circuits
by Ping Li & Lan Wang & Yang Wu & Hong-Jian Lai - 911-926 Semipaired domination in maximal outerplanar graphs
by Michael A. Henning & Pawaton Kaemawichanurat - 927-956 Integer programming formulations for the shared multicast tree problem
by Marika Ivanova & Dag Haugland - 957-971 Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
by Shi-Sheng Li & Ren-Xia Chen & Qi Feng & Cheng-Wen Jiao - 972-986 Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
by Shih-Shun Kao & Kung-Jui Pai & Sun-Yuan Hsieh & Ro-Yu Wu & Jou-Ming Chang
August 2019, Volume 38, Issue 2
- 333-340 On two conjectures concerning total domination subdivision number in graphs
by Rana Khoeilar & Hossein Karami & Seyed Mahmoud Sheikholeslami - 341-361 A linear time–cost tradeoff problem with multiple milestones under a comb graph
by Byung-Cheon Choi & Changmuk Kang - 362-374 Parameterized Mixed Graph Coloring
by Peter Damaschke - 375-401 Approximation algorithms for Median Hub Location Problems
by Marcelo P. L. Benedito & Lehilton L. C. Pedrosa - 402-420 A temporal logic programming approach to planning
by Kai Yang & Cong Tian & Nan Zhang & Zhenhua Duan & Hongwei Du - 421-442 On the extremal cacti of given parameters with respect to the difference of zagreb indices
by Shuchao Li & Licheng Zhang & Minjie Zhang - 443-455 Minimum Szeged index among unicyclic graphs with perfect matchings
by Hechao Liu & Hanyuan Deng & Zikai Tang - 456-480 The edge coloring game on trees with the number of colors greater than the game chromatic index
by Wai Lam Fong & Wai Hong Chan - 481-501 Clustering without replication in combinatorial circuits
by Zola Donovan & Gregory Gutin & Vahan Mkrtchyan & K. Subramani - 502-544 Gene tree reconciliation including transfers with replacement is NP-hard and FPT
by Damir Hasić & Eric Tannier - 545-555 Optimal r-dynamic coloring of sparse graphs
by Dan Yi & Junlei Zhu & Lixia Feng & Jiaxin Wang & Mengyini Yang - 556-569 The eigenvectors to the p-spectral radius of general hypergraphs
by Liying Kang & Lele Liu & Erfang Shan - 570-588 The rank of a complex unit gain graph in terms of the rank of its underlying graph
by Yong Lu & Ligong Wang & Qiannan Zhou - 589-607 A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
by Jun Liang & Dingjun Lou & Zongrong Qin & Qinglin Yu - 608-617 A tight linear time $$\frac{13}{12}$$ 13 12 -approximation algorithm for the $$P2 || C_{\max }$$ P 2 | | C max problem
by Federico Della Croce & Rosario Scatamacchia & Vincent T’kindt - 618-634 Approximation algorithm for squared metric two-stage stochastic facility location problem
by Jin Zhang & Min Li & Yishui Wang & Chenchen Wu & Dachuan Xu - 635-645 The connected vertex cover problem in k-regular graphs
by Yuchao Li & Wei Wang & Zishen Yang - 646-665 Jointly stable matchings
by Shuichi Miyazaki & Kazuya Okamoto
July 2019, Volume 38, Issue 1
- 1-20 Maximizing profit of multiple adoptions in social networks with a martingale approach
by Bin Liu & Yuxia Yan & Qizhi Fang & Junyu Dong & Weili Wu & Huijuan Wang - 21-49 Robust multiobjective portfolio optimization: a set order relations approach
by Chen Chen & Yu Wei - 50-71 Minmax scheduling problems with common due-date and completion time penalty
by Baruch Mor - 72-85 Hitting a path: a generalization of weighted connectivity via game theory
by Dávid Szeszlér - 86-110 The Best-or-Worst and the Postdoc problems with random number of candidates
by L. Bayón & P. Fortuny & J. Grau & A. M. Oller-Marcén & M. M. Ruiz - 111-129 Two-stage stochastic days-off scheduling of multi-skilled analysts with training options
by Douglas S. Altner & Erica K. Mason & Les D. Servi - 130-149 Efficient closed domination in digraph products
by Iztok Peterin & Ismael G. Yero - 150-164 An improved approximation algorithm for the minimum 3-path partition problem
by Yong Chen & Randy Goebel & Guohui Lin & Bing Su & Yao Xu & An Zhang - 165-184 Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
by Mattia D’Emidio & Luca Forlizzi & Daniele Frigioni & Stefano Leucci & Guido Proietti - 185-196 Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
by Yulin Chang & Qiancheng Ouyang & Guanghui Wang