Printed from https://ideas.repec.org/s/spr/jcomop7.html
Content
July 2017, Volume 34, Issue 1
- 279-301 Maximizing target-temporal coverage of mission-driven camera sensor networks
by Yi Hong & Deying Li & Donghyun Kim & Wenping Chen & Jiguo Yu & Alade O. Tokuta - 302-313 Local ratio method on partial set multi-cover
by Yingli Ran & Yishuo Shi & Zhao Zhang - 314-329 Centralized and decentralized rumor blocking problems
by Xin Chen & Qingqin Nong & Yan Feng & Yongchang Cao & Suning Gong & Qizhi Fang & Ker-I Ko
May 2017, Volume 33, Issue 4
- 1145-1167 A lower bound for the adaptive two-echelon capacitated vehicle routing problem
by Liang Song & Hao Gu & Hejiao Huang - 1168-1182 Optimal RSUs deployment with delay bound along highways in VANET
by Chunyan Liu & Hejiao Huang & Hongwei Du - 1183-1225 A tighter insertion-based approximation of the crossing number
by Markus Chimani & Petr Hliněný - 1226-1256 Maximum flows in generalized processing networks
by Michael Holzhauser & Sven O. Krumke & Clemens Thielen - 1257-1265 Lambda number for the direct product of some family of graphs
by Byeong Moon Kim & Yoomi Rho & Byung Chul Song - 1266-1275 Paired-domination number of claw-free odd-regular graphs
by Wei Yang & Xinhui An & Baoyindureng Wu - 1276-1299 Optimal RSUs placement with delay bounded message dissemination in vehicular networks
by Chunyan Liu & Hejiao Huang & Hongwei Du & Xiaohua Jia - 1300-1323 Approximation of knapsack problems with conflict and forcing graphs
by Ulrich Pferschy & Joachim Schauer - 1324-1342 On the coefficients of the independence polynomial of graphs
by Shuchao Li & Lin Liu & Yueyu Wu - 1343-1353 Even factors of graphs
by Jian Cheng & Cun-Quan Zhang & Bao-Xuan Zhu - 1354-1364 Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
by Ying Bai & Xiangwen Li & Gexin Yu - 1365-1377 A new graph parameter and a construction of larger graph without increasing radio k-chromatic number
by Ushnish Sarkar & Avishek Adhikari - 1378-1394 Bounds for the traveling salesman paths of two-dimensional modular lattices
by Florian Pausinger - 1395-1410 A new effective branch-and-bound algorithm to the high order MIMO detection problem
by Ye Tian & Ke Li & Wei Yang & Zhiyong Li - 1411-1420 A new upper bound for the online square packing problem in a strip
by Guosong Yu & Yanling Mao & Jiaoliao Xiao - 1421-1442 On irreducible no-hole L(2, 1)-coloring of subdivision of graphs
by Nibedita Mandal & Pratima Panigrahi - 1443-1453 The (vertex-)monochromatic index of a graph
by Xueliang Li & Di Wu - 1454-1468 A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
by Baruch Mor & Gur Mosheiov - 1469-1491 The solution of a generalized secretary problem via analytic expressions
by Adam Woryna
April 2017, Volume 33, Issue 3
- 809-813 Polynomial-time approximation algorithms for the coloring problem in some cases
by D. S. Malyshev - 814-846 The triangle k-club problem
by Filipa D. Carvalho & Maria Teresa Almeida - 847-865 A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable
by Miao Zhang & Min Chen & Yiqiao Wang - 866-881 Total completion time minimization in online hierarchical scheduling of unit-size jobs
by Jueliang Hu & Yiwei Jiang & Ping Zhou & An Zhang & Qinghui Zhang - 882-896 Possible winner problems on partial tournaments: a parameterized study
by Yongjie Yang & Jiong Guo - 897-923 On the odd girth and the circular chromatic number of generalized Petersen graphs
by Amir Daneshgar & Meysam Madani - 924-933 Packing spanning trees and spanning 2-connected k-edge-connected essentially $$(2k-1)$$ ( 2 k - 1 ) -edge-connected subgraphs
by Xiaofeng Gu - 934-944 Scheduling with release times and rejection on two parallel machines
by Xueling Zhong & Zhangming Pan & Dakui Jiang - 945-955 Two-agent scheduling problems on a single-machine to minimize the total weighted late work
by Zhang Xingong & Wang Yong - 956-967 Construction independent spanning trees on locally twisted cubes in parallel
by Yu-Huei Chang & Jinn-Shyong Yang & Sun-Yuan Hsieh & Jou-Ming Chang & Yue-Li Wang - 968-976 A note on the annihilation number and 2-domination number of a tree
by Jeremy Lyle & Sean Patterson - 977-1010 The no-wait job shop with regular objective: a method based on optimal job insertion
by Reinhard Bürgy & Heinz Gröflin - 1011-1020 A new sufficient condition for a tree T to have the (2, 1)-total number $$\Delta +1$$ Δ + 1
by Qiaojun Shu & Weifan Wang & Yiqiao Wang - 1021-1029 Convex median and anti-median at prescribed distance
by K. Pravas & A. Vijayakumar - 1030-1056 Augmenting weighted graphs to establish directed point-to-point connectivity
by Mehdy Roayaei & Mohammadreza Razzazi - 1057-1089 Efficient reassembling of graphs, part 1: the linear case
by Assaf Kfoury & Saber Mirzaei - 1090-1105 Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
by Tao Wang - 1106-1121 On the minimum routing cost clustered tree problem
by Chen-Wan Lin & Bang Ye Wu - 1122-1143 Power load forecasting by wavelet least squares support vector machine with improved fruit fly optimization algorithm
by Niu Dongxiao & Ma Tiannan & Liu Bingyi
February 2017, Volume 33, Issue 2
- 365-372 Complexity properties of complementary prisms
by Marcio Antônio Duarte & Lucia Penso & Dieter Rautenbach & Uéverton Santos Souza - 373-388 An improved parameterized algorithm for the p-cluster vertex deletion problem
by Bang Ye Wu & Li-Hsuan Chen - 389-402 Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
by J. M. G. Salmerón & G. Aparicio & L. G. Casado & I. García & E. M. T. Hendrix & B. G.-Tóth - 403-421 Matching colored points with rectangles
by L. E. Caraballo & C. Ochoa & P. Pérez-Lantero & J. Rojas-Ledesma - 422-444 Maximum cardinality neighbourly sets in quadrilateral free graphs
by K. S. Neethi & Sanjeev Saxena - 445-472 Handling precedence constraints in scheduling problems by the sequence pair representation
by Andrzej Kozik - 473-495 An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
by Manzhan Gu & Xiwen Lu & Jinwei Gu - 496-529 A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis
by Aleck Johnsen & Ming-Yang Kao & Shinnosuke Seki - 530-542 Online bin packing problem with buffer and bounded size revisited
by Minghui Zhang & Xin Han & Yan Lan & Hing-Fung Ting - 543-550 Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
by Clément Charpentier & Sylvain Gravier & Thomas Lecorre - 551-566 A heuristic for the time constrained asymmetric linear sum assignment problem
by Peter Brown & Yuedong Yang & Yaoqi Zhou & Wayne Pullan - 567-579 A coordination mechanism for a scheduling game with parallel-batching machines
by Q. Q. Nong & G. Q. Fan & Q. Z. Fang - 580-589 More bounds for the Grundy number of graphs
by Zixing Tang & Baoyindureng Wu & Lin Hu & Manoucheher Zaker - 590-608 Online MapReduce scheduling problem of minimizing the makespan
by Cong Chen & Yinfeng Xu & Yuqing Zhu & Chengyu Sun - 609-625 On (s, t)-relaxed strong edge-coloring of graphs
by Dan He & Wensong Lin - 626-644 Resource constrained scheduling with general truncated job-dependent learning effect
by Hongyu He & Mengqi Liu & Ji-Bo Wang - 645-659 On nonlinear multi-covering problems
by Reuven Cohen & Mira Gonen & Asaf Levin & Shmuel Onn - 660-680 Anti-forcing spectra of perfect matchings of graphs
by Kai Deng & Heping Zhang - 681-712 Approximation algorithms for pricing with negative network externalities
by Zhigang Cao & Xujin Chen & Xiaodong Hu & Changjun Wang - 713-725 Roman game domination number of a graph
by A. Bahremandpour & S. M. Sheikholeslami & L. Volkmann - 726-741 Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks
by Amiyne Zakouni & Jiawei Luo & Fouad Kharroubi - 742-778 Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
by Rafael F. Santos & Alessandro Andrioni & Andre C. Drummond & Eduardo C. Xavier - 779-790 The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
by Lin Sun & Xiaohan Cheng & Jianliang Wu - 791-802 Approximation algorithm for partial positive influence problem in social network
by Yingli Ran & Zhao Zhang & Hongwei Du & Yuqing Zhu - 803-808 Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescence
by Zaixin Lu & Zhao Zhang & Weili Wu
January 2017, Volume 33, Issue 1
- 1-12 Anti-Ramsey coloring for matchings in complete bipartite graphs
by Zemin Jin & Yuping Zang - 13-27 On consecutive edge magic total labelings of connected bipartite graphs
by Bumtle Kang & Suh-Ryung Kim & Ji Yeon Park - 28-34 Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
by Xiao Wang & Baoyindureng Wu - 35-59 On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
by Vicky Mak-Hau - 60-80 Benders decomposition for set covering problems
by S. Haddadi - 81-105 Lower bounds for positive semidefinite zero forcing and their applications
by Boting Yang - 106-122 A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks
by Limin Wang & Wenxue Du & Zhao Zhang & Xiaoyan Zhang - 123-131 Erdős–Gallai-type results for colorful monochromatic connectivity of a graph
by Qingqiong Cai & Xueliang Li & Di Wu - 132-146 A novel approach for detecting multiple rumor sources in networks with partial observations
by Zhao Zhang & Wen Xu & Weili Wu & Ding-Zhu Du - 147-155 A linear-time algorithm for clique-coloring problem in circular-arc graphs
by Zuosong Liang & Erfang Shan & Yuzhong Zhang - 156-164 Coupon coloring of some special graphs
by Yongtang Shi & Meiqin Wei & Jun Yue & Yan Zhao - 165-182 Total weight choosability of Mycielski graphs
by Yunfang Tang & Xuding Zhu - 183-201 A computational approach to the multi-period many-to-one matching with ties
by Xinsheng Xiong & Yong Zhao & Yang Chen - 202-214 On the b-coloring of tight graphs
by Mekkia Kouider & Mohamed Zamime - 215-236 Almost separable matrices
by Matthew Aldridge & Leonardo Baldassini & Karen Gunderson - 237-253 Neighbor product distinguishing total colorings
by Tong Li & Cunquan Qu & Guanghui Wang & Xiaowei Yu - 254-264 Code for polyomino and computer search of isospectral polyominoes
by Xiaodong Liang & Rui Wang & Ji xiang Meng - 265-274 Total coloring of planar graphs without adjacent short cycles
by Huijuan Wang & Bin Liu & Yan Gu & Xin Zhang & Weili Wu & Hongwei Gao - 275-282 A solution to a conjecture on the generalized connectivity of graphs
by Lily Chen & Xueliang Li & Mengmeng Liu & Yaping Mao - 283-291 On the difference of two generalized connectivities of a graph
by Yuefang Sun & Xueliang Li - 292-316 Broadcasting on cactus graphs
by Maja Čevnik & Janez Žerovnik - 317-325 On (p, 1)-total labelling of planar graphs
by Lin Sun & Jian-Liang Wu - 326-332 Maximal independent sets in a generalisation of caterpillar graph
by K. S. Neethi & Sanjeev Saxena - 333-338 Graphs with multiplicative vertex-coloring 2-edge-weightings
by Joanna Skowronek-Kaziów - 339-364 Minimized-cost cube query on heterogeneous information networks
by Dan Yin & Hong Gao & Zhaonian Zou & Jianzhong Li
November 2016, Volume 32, Issue 4
- 983-984 Preface: Special issue on computing and combinatorics conference and wireless algorithms, systems, and applications conference
by Zhipeng Cai & Chaokun Wang & Anu Bourgeois - 985-1001 $$(\alpha , \tau )$$ ( α , τ ) -Monitoring for event detection in wireless sensor networks
by Ran Bi & Jianzhong Li & Hong Gao & Yingshu Li - 1002-1016 Approximate event detection over multi-modal sensing data
by Jing Gao & Jianzhong Li & Yingshu Li - 1017-1035 An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
by Chenchen Wu & Dachuan Xu & Donglei Du & Wenqing Xu - 1036-1051 On the performance of mildly greedy players in cut games
by Vittorio Bilò & Mauro Paladini - 1052-1067 An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models
by Cui Wang & Jiguo Yu & Dongxiao Yu & Baogui Huang & Shanshan Yu - 1068-1088 Efficient accuracy evaluation for multi-modal sensed data
by Yan Zhang & Hongzhi Wang & Hong Gao & Jianzhong Li - 1089-1106 Directed Steiner trees with diffusion costs
by Dimitri Watel & Marc-Antoine Weisser & Cédric Bentz & Dominique Barth - 1107-1132 Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results
by Tim Wylie & Michael A. Schuh & Rafal A. Angryk - 1133-1164 Approximate sorting of data streams with limited storage
by Farzad Farnoud & Eitan Yaakobi & Jehoshua Bruck - 1165-1181 Exemplar or matching: modeling DCJ problems with unequal content genome data
by Zhaoming Yin & Jijun Tang & Stephen W. Schaeffer & David A. Bader - 1182-1195 Reconfiguration of dominating sets
by Akira Suzuki & Amer E. Mouawad & Naomi Nishimura - 1196-1196 Editorial for Special Issue: COCOA2014
by Zhao Zhang - 1197-1216 Towards the price of leasing online
by Sebastian Abshoff & Peter Kling & Christine Markarian & Friedhelm Meyer auf der Heide & Peter Pietrzyk - 1217-1231 Approximation schemes for Euclidean vehicle routing problems with time windows
by Liang Song & Hejiao Huang & Hongwei Du - 1232-1253 Serve or skip: the power of rejection in online bottleneck matching
by Barbara M. Anthony & Christine Chung - 1254-1287 Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
by Annalisa De Bonis - 1288-1304 The minimum vulnerability problem on specific graph classes
by Yusuke Aoki & Bjarni V. Halldórsson & Magnús M. Halldórsson & Takehiro Ito & Christian Konrad & Xiao Zhou - 1305-1326 The popular matching and condensation problems under matroid constraints
by Naoyuki Kamiyama - 1327-1370 A practical greedy approximation for the directed Steiner tree problem
by Dimitri Watel & Marc-Antoine Weisser - 1371-1399 Integer programming methods for special college admissions problems
by Kolos Csaba Ágoston & Péter Biró & Iain McBride
October 2016, Volume 32, Issue 3
- 657-671 Improved algorithmic results for unsplittable stable allocation problems
by Ágnes Cseh & Brian C. Dean - 672-695 Solving constrained optimization problems by solution-based decomposition search
by Amine Lamine & Mahdi Khemakhem & Brahim Hnich & Habib Chabchoub - 696-720 Robustness of power-law networks: its assessment and optimization
by Huiling Zhang & Yilin Shen & My T. Thai - 721-724 On strongly planar not-all-equal 3SAT
by Ali Dehghan - 725-740 Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
by Shasha Ma & Liancui Zuo - 741-764 The extremal spectral radii of $$k$$ k -uniform supertrees
by Honghai Li & Jia-Yu Shao & Liqun Qi - 765-774 A combinatorial proof for the circular chromatic number of Kneser graphs
by Daphne Der-Fen Liu & Xuding Zhu - 775-783 First-Fit colorings of graphs with no cycles of a prescribed even length
by Manouchehr Zaker & Hossein Soltani - 784-799 Scheduling two job families on a single machine with two competitive agents
by Shi-Sheng Li & Ren-Xia Chen & Qi Feng - 800-811 Characterisation of forests with trivial game domination numbers
by M. J. Nadjafi-Arani & Mark Siggers & Hossein Soltani - 812-841 A minimized-rule based approach for improving data currency
by Mohan Li & Jianzhong Li - 842-854 The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation
by Sabine Büttner & Sven O. Krumke - 855-871 Signed total Roman domination in graphs
by Lutz Volkmann - 872-884 The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
by Kien Trung Nguyen & Ali Reza Sepasian - 885-905 Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
by Natashia Boland & Thomas Kalinowski & Simranjit Kaur - 906-916 Neighbor sum distinguishing total choosability of planar graphs
by Cunquan Qu & Guanghui Wang & Guiying Yan & Xiaowei Yu - 917-926 Finding a contra-risk path between two nodes in undirected graphs
by Mehdi Ghiyasvand & Iman Keshtkar - 927-940 A $$(3,1)^{*}$$ ( 3 , 1 ) ∗ -choosable theorem on planar graphs
by Min Chen & André Raspaud & Weifan Wang - 941-950 Maximum size of digraphs with some parameters
by Huiqiu Lin & Jinlong Shu & Baoyindureng Wu - 951-959 Packing feedback arc sets in reducible flow graphs
by Han Xiao - 960-969 A diagnosis algorithm by using graph-coloring under the PMC model
by Qiang Zhu & Guodong Guo & Wenliang Tang & Cun-Quan Zhang - 970-981 Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
by Imed Kacem & Hans Kellerer & Maryam Seifaddini
August 2016, Volume 32, Issue 2
- 331-340 Introduction: Special issue dedicated to the memory of professor Wenqi Huang
by Weidong Chen & Zhixiang Chen - 341-353 Optimal space coverage with white convex polygons
by Shayan Ehsani & MohammadAmin Fazli & Mohammad Ghodsi & MohammadAli Safari - 354-367 Euclidean movement minimization
by Nima Anari & MohammadAmin Fazli & Mohammad Ghodsi & MohammadAli Safari - 368-384 Multi-start iterated tabu search for the minimum weight vertex cover problem
by Taoqing Zhou & Zhipeng Lü & Yang Wang & Junwen Ding & Bo Peng - 385-395 Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
by Qijia Liu & Jinjiang Yuan - 396-415 Multi-neighborhood based path relinking for two-sided assembly line balancing problem
by Zhaoyang Yang & Guojun Zhang & Haiping Zhu - 416-444 A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
by Lei Wang & Aihua Yin - 445-468 Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
by Xinyun Wu & Shengfeng Yan & Xin Wan & Zhipeng Lü - 469-491 A three-phased local search approach for the clique partitioning problem
by Yi Zhou & Jin-Kao Hao & Adrien Goëffon - 492-512 Tabu search for the real-world carpooling problem
by Can Huang & Defu Zhang & Yain-Whar Si & Stephen C. H. Leung - 513-530 A hybrid algorithm based on variable neighbourhood for the strip packing problem
by Defu Zhang & Yuxin Che & Furong Ye & Yain-Whar Si & Stephen C. H. Leung - 531-549 Solving the maximum vertex weight clique problem via binary quadratic programming
by Yang Wang & Jin-Kao Hao & Fred Glover & Zhipeng Lü & Qinghua Wu - 550-562 The expected values of Hosoya index and Merrifield–Simmons index in a random polyphenylene chain
by Guihua Huang & Meijun Kuang & Hanyuan Deng - 563-593 An effective discrete dynamic convexized method for solving the winner determination problem
by Geng Lin & Wenxing Zhu & M. Montaz Ali - 594-607 An $$O^{*}(1.4366^n)$$ O ∗ ( 1 . 4366 n ) -time exact algorithm for maximum $$P_2$$ P 2 -packing in cubic graphs
by Maw-Shang Chang & Li-Hsuan Chen & Ling-Ju Hung - 608-625 Total and paired domination numbers of $$C_m$$ C m bundles over a cycle $$C_n$$ C n
by Fu-Tao Hu & Moo Young Sohn & Xue-gang Chen - 626-638 A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
by Jihui Wang & Qiaoling Ma & Xue Han & Xiuyun Wang - 639-644 A note on the duality between matchings and vertex covers in balanced hypergraphs
by Robert Scheidweiler & Eberhard Triesch - 645-655 An improved bound on 2-distance coloring plane graphs with girth 5
by Wei Dong & Wensong Lin
July 2016, Volume 32, Issue 1
- 1-2 Special Issue for FAW 2014
by Jianer Chen & John E. Hopcroft - 3-24 Algorithms for the workflow satisfiability problem engineered for counting constraints
by D. Cohen & J. Crampton & A. Gagarin & G. Gutin & M. Jones - 25-50 Dynamic matchings in left vertex weighted convex bipartite graphs
by Quan Zu & Miaomiao Zhang & Bin Yu - 51-66 Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
by Wei Xu & Fuzhou Gong - 67-78 Kernelization and randomized Parameterized algorithms for Co-path Set problem
by Qilong Feng & Qian Zhou & Jianxin Wang - 79-94 Constrained pairwise and center-star sequences alignment problems
by Yong Zhang & Joseph Wun-Tat Chan & Francis Y. L. Chin & Hing-Fung Ting & Deshi Ye & Feng Zhang & Jianyu Shi - 95-110 Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs
by Hao Chen & Zihan Lei & Tian Liu & Ziyang Tang & Chaoyi Wang & Ke Xu - 111-143 Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
by Feng Shi & Qilong Feng & Jie You & Jianxin Wang - 144-158 Efficient approximation algorithms for computing k disjoint constrained shortest paths
by Longkun Guo - 159-173 Partial degree bounded edge packing problem for graphs and $$k$$ k -uniform hypergraphs
by Pawan Aurora & Sumit Singh & Shashank K. Mehta - 174-187 Strong minimum energy hierarchical topology in wireless sensor networks
by B. S. Panda & D. Pushparaj Shetty - 188-197 List edge and list total coloring of planar graphs with maximum degree 8
by Huijuan Wang & Bin Liu & Xin Zhang & Lidong Wu & Weili Wu & Hongwei Gao - 198-225 New analysis and computational study for the planar connected dominating set problem
by Marjan Marzban & Qian-Ping Gu & Xiaohua Jia - 226-243 A complexity dichotomy and a new boundary class for the dominating set problem
by D. S. Malyshev - 244-259 2-Distance coloring of a planar graph without 3, 4, 7-cycles
by Yuehua Bu & Xia Lv - 260-266 Upper bounds for the total rainbow connection of graphs
by Hui Jiang & Xueliang Li & Yingying Zhang - 267-277 Computing unique maximum matchings in $$O(m)$$ O ( m ) time for König–Egerváry graphs and unicyclic graphs
by Vadim E. Levit & Eugen Mandrescu - 278-292 Distributed wireless link scheduling in the SINR model
by Dongxiao Yu & Yuexuan Wang & Qiangsheng Hua & Jiguo Yu & Francis C. M. Lau - 293-298 On strongly planar 3SAT
by Lidong Wu - 299-317 Signed mixed Roman domination numbers in graphs
by H. Abdollahzadeh Ahangar & L. Asgharsharghi & S. M. Sheikholeslami & L. Volkmann - 318-330 Complete forcing numbers of primitive coronoids
by Shou-Jun Xu & Xiu-Song Liu & Wai Hong Chan & Heping Zhang
May 2016, Volume 31, Issue 4
- 1373-1382 An $$O(n\log n)$$ O ( n log n ) algorithm for finding edge span of cacti
by Robert Janczewski & Krzysztof Turowski - 1383-1398 On judicious partitions of graphs
by Muhuo Liu & Baogang Xu - 1399-1404 Acyclic coloring of graphs with some girth restriction
by Jiansheng Cai & Binlu Feng & Guiying Yan - 1405-1416 On identifying codes in the Cartesian product of a path and a complete graph
by Jason Hedetniemi - 1417-1429 A simple greedy approximation algorithm for the minimum connected $$k$$ k -Center problem
by Dongyue Liang & Liquan Mei & James Willson & Wei Wang - 1430-1442 Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
by Renyu Xu & Jianliang Wu & Jin Xu - 1443-1460 Optimization techniques for robust multivariate location and scatter estimation
by C. Chatzinakos & L. Pitsoulis & G. Zioutas - 1461-1478 Heuristics for the network design problem with connectivity requirements
by Roman E. Shangin & Panos Pardalos - 1479-1492 The 2-surviving rate of planar graphs without 5-cycles
by Tingting Wu & Jiangxu Kong & Weifan Wang - 1493-1504 New results on two-machine flow-shop scheduling with rejection
by Liqi Zhang & Lingfa Lu & Shisheng Li - 1505-1517 An approximation algorithm for maximum weight budgeted connected set cover
by Yingli Ran & Zhao Zhang & Ker-I Ko & Jun Liang - 1518-1549 On statistical bounds of heuristic solutions to location problems
by Kenneth Carling & Xiangli Meng - 1550-1568 A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring
by Donghyun Kim & Wei Wang & Deying Li & Joong-Lyul Lee & Weili Wu & Alade O. Tokuta - 1569-1585 Online integrated production–distribution scheduling problems without preemption
by Xin Feng & Yongxi Cheng & Feifeng Zheng & Yinfeng Xu - 1586-1608 Equality in a bound that relates the size and the restrained domination number of a graph
by Johannes H. Hattingh & Ernst J. Joubert - 1609-1622 Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
by Hailing Liu & Jinjiang Yuan & Wenjie Li - 1623-1641 OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
by Kejia Zhang & Qilong Han & Guisheng Yin & Haiwei Pan - 1642-1649 Sizes and transmissions of digraphs with a given clique number
by Zejun Huang & Huiqiu Lin - 1650-1664 Total coloring of planar graphs without short cycles
by Hua Cai & Jianliang Wu & Lin Sun - 1665-1677 A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
by Larisa Komosko & Mikhail Batsyn & Pablo San Segundo & Panos M. Pardalos - 1678-1684 On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence
by Ailian Wang & Weili Wu & Lei Cui - 1685-1708 On the directed cut cone and polytope
by David Avis & Conor Meagher - 1709-1719 Construction of optimal constant-dimension subspace codes
by Wayne Pullan & Xin-Wen Wu & Zihui Liu - 1720-1745 Budget-constrained minimum cost flows
by Michael Holzhauser & Sven O. Krumke & Clemens Thielen