Content
November 2016, Volume 32, Issue 4
- 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 - 1746-1759 Pseudo-automatic beam orientations in multi-criteria intensity-modulated radiation therapy
by Ahmad-Saher Azizi-Sultan
April 2016, Volume 31, Issue 3
- 943-960 On Barnette’s conjecture and the $$H^{+-}$$ H + - property
by Jan Florek - 961-978 Some extremal properties of the multiplicatively weighted Harary index of a graph
by Shuchao Li & Huihui Zhang - 979-995 A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems
by Zhang Huajun & Zhao Jin & Luo Hui - 996-1012 Bounded information dissemination in multi-channel wireless networks
by Yu Yan & Dongxiao Yu & Yuexuan Wang & Jiguo Yu & Francis C. M. Lau - 1013-1022 A note on the minimum number of choosability of planar graphs
by Huijuan Wang & Lidong Wu & Xin Zhang & Weili Wu & Bin Liu - 1023-1033 Optimal weight allocation in rooted trees
by Shmuel Wimer - 1034-1044 Extended cuts
by Walid Ben-Ameur & Mohamed Didi Biha - 1045-1060 A modified firefly algorithm based on light intensity difference
by Bin Wang & Dong-Xu Li & Jian-Ping Jiang & Yi-Huan Liao - 1061-1089 Cardinality constraints and systems of restricted representatives
by Ioannis Mourtos - 1090-1110 Disjunctive total domination in graphs
by Michael A. Henning & Viroshan Naicker - 1111-1129 Implicit cover inequalities
by Agostinho Agra & Cristina Requejo & Eulália Santos - 1130-1133 A solution to an open problem on lower against number in graphs
by Babak Samadi - 1134-1141 On the efficiency index of a graph
by Rommel Barbosa & Peter Slater - 1142-1159 The 3-rainbow index and connected dominating sets
by Qingqiong Cai & Xueliang Li & Yan Zhao - 1160-1173 Optimizing some constructions with bars: new geometric knapsack problems
by S. Bereg & J. M. Díaz-Báñez & D. Flores-Peñaloza & S. Langerman & P. Pérez-Lantero & J. Urrutia - 1174-1205 On revenue maximization with sharp multi-unit demands
by Ning Chen & Xiaotie Deng & Paul W. Goldberg & Jinshan Zhang - 1206-1220 Improving robustness of next-hop routing
by Glencora Borradaile & W. Sean Kennedy & Gordon Wilfong & Lisa Zhang - 1221-1240 The entire choosability of plane graphs
by Weifan Wang & Tingting Wu & Xiaoxue Hu & Yiqiao Wang - 1241-1268 A reinforcement-learning approach for admission control in distributed network service systems
by Xiaonong Lu & Baoqun Yin & Haipeng Zhang - 1269-1279 Linearizable special cases of the QAP
by Eranda Çela & Vladimir G. Deineko & Gerhard J. Woeginger - 1280-1297 Improved approximation algorithms for single-tiered relay placement
by Gruia Calinescu & Benjamin Grimmer & Satyajayant Misra & Sutep Tongngam & Guoliang Xue & Weiyi Zhang - 1298-1315 Chromatic kernel and its applications
by Hu Ding & Branislav Stojkovic & Zihe Chen & Andrew Hughes & Lei Xu & Andrew Fritz & Nitasha Sehgal & Ronald Berezney & Jinhui Xu - 1316-1334 An improved two-machine flowshop scheduling with intermediate transportation
by Jianming Dong & Xueshi Wang & Jueliang Hu & Guohui Lin - 1335-1344 Problem dependent optimization (PDO)
by Iliya Bluskov - 1345-1372 Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
by Ya-Lei Jin & Yeong-Nan Yeh & Xiao-Dong Zhang
February 2016, Volume 31, Issue 2
- 447-462 $$L(2,1)$$ L ( 2 , 1 ) -labeling for brick product graphs
by Zehui Shao & Jin Xu & Roger K. Yeh - 463-490 On the best possible competitive ratio for the multislope ski-rental problem
by Hiroshi Fujiwara & Takuma Kitano & Toshihiro Fujito - 491-505 On single machine scheduling with resource constraint
by Lidong Wu & Cong-Dian Cheng - 506-514 Integral packing of branchings in capacitaded digraphs
by Mario Leston-Rey - 515-532 Multi-depot vehicle routing problem with time windows under shared depot resources
by Jian Li & Yang Li & Panos M. Pardalos - 533-545 Crossing edges and faces of line arrangements in the plane
by Rom Pinchasi - 546-576 Modified differential evolution with self-adaptive parameters method
by Xiangtao Li & Minghao Yin - 577-603 Verifying safety critical task scheduling systems in PPTL axiom system
by Nan Zhang & Mengfei Yang & Bin Gu & Zhenhua Duan & Cong Tian - 604-634 $$L(j,k)$$ L ( j , k ) -labeling number of Cartesian product of path and cycle
by Qiong Wu & Wai Chee Shiu & Pak Kiu Sun - 635-647 Extremal polyomino chains with respect to general Randić index
by Mingqiang An & Liming Xiong - 648-668 Further results on the reciprocal degree distance of graphs
by Shuchao Li & Huihui Zhang & Minjie Zhang - 669-685 Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph
by M. Reza Khani & Mohammad R. Salavatipour - 686-695 Semi-online scheduling with combined information on two identical machines in parallel
by Qian Cao & Guohua Wan - 696-712 Approximation algorithms for minimum weight partial connected set cover problem
by Dongyue Liang & Zhao Zhang & Xianliang Liu & Wei Wang & Yaolin Jiang - 713-724 2-Edge connected dominating sets and 2-Connected dominating sets of a graph
by Hengzhe Li & Yuxing Yang & Baoyindureng Wu - 725-742 Power domination with bounded time constraints
by Chung-Shou Liao - 743-757 Team selection for prediction tasks
by MohammadAmin Fazli & Azin Ghazimatin & Jafar Habibi & Hamid Haghshenas - 758-773 Degree-constrained orientations of embedded graphs
by Yann Disser & Jannik Matuschke - 774-785 Scheduling dedicated jobs with variative processing times
by Maksim Barketau & Erwin Pesch & Yakov Shafransky - 786-801 Bounding the scaling window of random constraint satisfaction problems
by Jing Shen & Yaofeng Ren - 802-814 Algorithms for finding maximum transitive subtournaments
by Lasse Kiviluoto & Patric R. J. Östergård & Vesa P. Vaskelainen - 815-832 Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
by Chun-Ying Chiang & Wei-Ting Huang & Hong-Gwa Yeh - 833-845 Two cases of polynomial-time solvability for the coloring problem
by D. S. Malyshev - 846-864 An approximation algorithm for the partial vertex cover problem in hypergraphs
by Mourad El Ouali & Helena Fohlin & Anand Srivastav - 865-873 $$k$$ k -Power domination in block graphs
by Chao Wang & Lei Chen & Changhong Lu - 874-880 Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
by Yi Wang & Jian Cheng & Rong Luo & Gregory Mulley - 881-892 Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
by Yanming Chang & Yuejian Peng & Yuping Yao - 893-901 A sufficient condition for a tree to be $$(\Delta +1)$$ ( Δ + 1 ) - $$(2,1)$$ ( 2 , 1 ) -totally labelable
by Zhengke Miao & Qiaojun Shu & Weifan Wang & Dong Chen - 902-911 Acyclic 3-coloring of generalized Petersen graphs
by Enqiang Zhu & Zepeng Li & Zehui Shao & Jin Xu & Chanjuan Liu - 912-917 Degree conditions for weakly geodesic pancyclic graphs and their exceptions
by Emlee W. Nicholson & Bing Wei - 918-941 Evaluating entity-description conflict on duplicated data
by Lingli Li & Jianzhong Li & Hong Gao
January 2016, Volume 31, Issue 1
- 1-12 On the complexity of the minimum outer-connected dominating set problem in graphs
by D. Pradhan - 13-28 The best choice problem for posets; colored complete binary trees
by Wojciech Kaźmierczak - 29-43 Approximation for maximizing monotone non-decreasing set functions with a greedy method
by Zengfu Wang & Bill Moran & Xuezhi Wang & Quan Pan - 44-51 An inequality that relates the size of a bipartite graph with its order and restrained domination number
by Ernst J. Joubert - 52-66 Lower bounds on the total domination number of a graph
by Wyatt J. Desormeaux & Michael A. Henning - 67-77 $$L(p,q)$$ L ( p , q ) -labeling and integer tension of a graph embedded on torus
by Xiaoling L. Zhang & Jianguo G. Qian - 78-78 Erratum to: $$L(p, q)$$ L ( p , q ) -labeling and integer tension of a graph embedded on torus
by Xiaoling Zhang & Jianguo Qian - 79-94 Minimax regret vertex 2-sink location problem in dynamic path networks
by Hongmei Li & Yinfeng Xu & Guanqun Ni - 95-117 Algorithms for randomized time-varying knapsack problems
by Yichao He & Xinlu Zhang & Wenbin Li & Xiang Li & Weili Wu & Suogang Gao - 118-135 Information exchange with collision detection on multiple channels
by Yuepeng Wang & Yuexuan Wang & Dongxiao Yu & Jiguo Yu & Francis C. M. Lau - 136-151 A greedy algorithm for the minimum $$2$$ 2 -connected $$m$$ m -fold dominating set problem
by Yishuo Shi & Yaping Zhang & Zhao Zhang & Weili Wu - 152-181 The blocking job shop with rail-bound transportation
by Reinhard Bürgy & Heinz Gröflin - 182-195 Maximally edge-connected graphs and Zeroth-order general Randić index for $$\alpha \le -1$$ α ≤ - 1
by Guifu Su & Liming Xiong & Xiaofeng Su & Guojun Li - 196-217 On the computational complexity of bridgecard
by Zihan Tan - 218-222 Polynomial algorithms for canonical forms of orientations
by Martin Kochol - 223-238 Some Motzkin–Straus type results for non-uniform hypergraphs
by Ran Gu & Xueliang Li & Yuejian Peng & Yongtang Shi - 239-259 1.61-approximation for min-power strong connectivity with two power levels
by Gruia Călinescu - 260-278 Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
by Kejun Zhao & Xiwen Lu - 279-310 Minimum-latency aggregation scheduling in wireless sensor network
by Longjiang Guo & Yingshu Li & Zhipeng Cai - 311-326 A simplex like approach based on star sets for recognizing convex- $$QP$$ Q P adverse graphs
by Domingos M. Cardoso & Carlos J. Luz - 327-332 Cacti with the smallest, second smallest, and third smallest Gutman index
by Shubo Chen - 333-346 Signed Roman edge domination numbers in graphs
by H. Abdollahzadeh Ahangar & J. Amjadi & S. M. Sheikholeslami & L. Volkmann & Y. Zhao - 347-371 Efficient algorithms for cluster editing
by Lucas Bastos & Luiz Satoru Ochi & Fábio Protti & Anand Subramanian & Ivan César Martins & Rian Gabriel S. Pinheiro - 372-381 An efficient algorithm for distance total domination in block graphs
by Yancai Zhao & Erfang Shan - 382-395 Atoms of cyclic edge connectivity in regular graphs
by Jin-Xin Zhou - 396-404 L(2,1)-labelings of the edge-multiplicity-paths-replacement of a graph
by Damei Lü & Jianping Sun - 405-426 On $$(s,t)$$ ( s , t ) -relaxed $$L(2,1)$$ L ( 2 , 1 ) -labeling of graphs
by Wensong Lin - 427-446 Further properties on the degree distance of graphs
by Hongzhuan Wang & Liying Kang
November 2015, Volume 30, Issue 4
- 839-840 Preface
by Liwei Zhong & Guochun Tang - 841-849 A note of reduced dimension optimization algorithm of assignment problem
by Mengzhuo Bai & Chunyang Ren & Yang Liu - 850-870 Quadratic kernel-free least squares support vector machine for target diseases classification
by Yanqin Bai & Xiao Han & Tong Chen & Hua Yu - 871-891 A two-stage method for member selection of emergency medical service
by Xi Chen & Zhiping Fan & Zhiwu Li & Xueliang Han & Xiao Zhang & Haochen Jia - 892-905 Supply chain scheduling problem in the hospital with periodic working time on a single machine
by Jing Fan & Xiwen Lu - 906-919 Fitting $$\alpha $$ α $$\beta $$ β -crystalline structure onto electron microscopy based on SO(3) rotation group theory
by Beibei Li & Zhihong Zhao & Xuan Shen & Cendi Xue & Liwei Zhong - 920-937 How patient compliance impacts the recommendations for colorectal cancer screening
by Jing Li & Ming Dong & Yijiong Ren & Kaiqi Yin - 938-948 Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process
by Lili Liu & Guochun Tang & Baoqiang Fan & Xingpeng Wang