Content
February 2016, Volume 31, Issue 2
- 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 - 949-966 Predictive-reactive scheduling for single surgical suite subject to random emergency surgery
by Bing Wang & Xingbao Han & Xianxia Zhang & Shaohua Zhang - 967-981 Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period
by Dujuan Wang & Feng Liu & Yunqiang Yin & Jianjun Wang & Yanzhang Wang - 982-995 Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling
by Shan Wang & Huiqiao Su & Guohua Wan - 996-1015 Optimizing word set coverage for multi-event summarization
by Jihong Yan & Wenliang Cheng & Chengyu Wang & Jun Liu & Ming Gao & Aoying Zhou - 1016-1026 A surgical scheduling method considering surgeons’ preferences
by Ying Yang & Bing Shen & Wei Gao & Yong Liu & Liwei Zhong - 1027-1041 Patients scheduling problems with deferred deteriorated functions
by Xingong Zhang & Hui Wang & Xingpeng Wang - 1042-1061 Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks
by Fouad Kharroubi & Jing He & Jin Tang & Ming Chen & Lin Chen - 1062-1076 How much the grid network and rescuers’ communication can improve the rescue efficiency in worst-case analysis
by Yinfeng Xu & Huili Zhang - 1077-1094 Strong minimum energy $$2$$ 2 -hop rooted topology for hierarchical wireless sensor networks
by B. S. Panda & D. Pushparaj Shetty - 1095-1106 On the $$\varvec{k}$$ k -power domination of hypergraphs
by Gerard Jennhwa Chang & Nicolas Roussel - 1107-1124 An accelerated continuous greedy algorithm for maximizing strong submodular functions
by Zengfu Wang & Bill Moran & Xuezhi Wang & Quan Pan - 1125-1137 Multiplicatively weighted Harary index of graphs
by Hanyuan Deng & B. Krishnakumari & Y. B. Venkatakrishnan & S. Balachandran - 1138-1172 Generating QAP instances with known optimum solution and additively decomposable cost function
by Mădălina M. Drugan - 1173-1179 A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
by Yingfan L. Du & Hongmin W. Du - 1180-1195 List 2-distance coloring of planar graphs
by Yuehua Bu & Xiaoyan Yan - 1196-1218 The minimum number of hubs in networks
by Easton Li Xu & Guangyue Han - 1219-1227 An incremental version of the k-center problem on boundary of a convex polygon
by Hai Du & Yinfeng Xu & Binhai Zhu
October 2015, Volume 30, Issue 3
- 403-412 Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
by Imed Kacem & Hans Kellerer & Yann Lanuel - 413-434 An efficient meta-heuristic algorithm for grid computing
by Zahra Pooranian & Mohammad Shojafar & Jemal H. Abawajy & Ajith Abraham - 435-446 Some results on the reciprocal sum-degree distance of graphs
by Guifu Su & Liming Xiong & Xiaofeng Su & Xianglian Chen - 447-455 An improved lower bound for approximating the Minimum Integral Solution Problem with Preprocessing over $$\ell _\infty $$ ℓ ∞ norm
by Wenbin Chen & Lingxi Peng & Jianxiong Wang & Fufang Li & Maobin Tang & Wei Xiong & Songtao Wang - 456-467 Signed Roman domination in digraphs
by S. M. Sheikholeslami & L. Volkmann - 468-488 Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
by Shuchao Li & Xian Meng - 489-519 An extended approach for lifting clique tree inequalities
by Anja Fischer & Frank Fischer - 520-544 Scheduling with task replication on desktop grids: theoretical and experimental analysis
by Eduardo C. Xavier & Robson R. S. Peixoto & Jefferson L. M. Silveira - 545-562 Online traveling salesman problem with deadlines and service flexibility
by Xingang Wen & Yinfeng Xu & Huili Zhang - 563-578 Approximating minimum power edge-multi-covers
by Nachshon Cohen & Zeev Nutov - 579-595 Progress on the Murty–Simon Conjecture on diameter-2 critical graphs: a survey
by Teresa W. Haynes & Michael A. Henning & Lucas C. Merwe & Anders Yeo - 596-611 The game Grundy indices of graphs
by Wenchao Zhang & Xuding Zhu - 612-626 A 0.5358-approximation for Bandpass-2
by Liqin Huang & Weitian Tong & Randy Goebel & Tian Liu & Guohui Lin - 627-646 $$(1,0,0)$$ ( 1 , 0 , 0 ) -Colorability of planar graphs without prescribed short cycles
by Yuehua Bu & Jinghan Xu & Yingqian Wang - 647-667 On improving convex quadratic programming relaxation for the quadratic assignment problem
by Yong Xia & Wajeb Gharibi - 668-674 The Cartesian product of cycles with small 2-rainbow domination number
by Zofia Stȩpień & Lucjan Szymaszkiewicz & Maciej Zwierzchowski - 675-688 Neighbor sum distinguishing total colorings of planar graphs
by Hualong Li & Laihao Ding & Bingqiang Liu & Guanghui Wang - 689-709 Rank bounds for a hierarchy of Lovász and Schrijver
by Pratik Worah - 710-728 A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm
by R. M. A. Silva & M. G. C. Resende & P. M. Pardalos - 729-746 Co-2-plex vertex partitions
by Benjamin McClosky & John D. Arellano & Illya V. Hicks - 747-767 A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
by Thang N. Dinh & Nam P. Nguyen & Md Abdul Alim & My T. Thai - 768-802 Heuristics for the data arrangement problem on regular trees
by Eranda Çela & Rostislav Staněk - 803-811 $$L(1,1)$$ L ( 1 , 1 ) -labelling of the direct product of a complete graph and a cycle
by Byeong Moon Kim & Yoomi Rho & Byung Chul Song - 812-825 On Lagrangians of r-uniform hypergraphs
by Yuejian Peng & Qingsong Tang & Cheng Zhao - 826-837 A unified linear-programming modeling of some topological indices
by Hanyuan Deng & Guihua Huang & Xiaojuan Jiang
August 2015, Volume 30, Issue 2
- 201-213 Single-server parallel-machine scheduling with loading and unloading times
by Yiwei Jiang & Qinghui Zhang & Jueliang Hu & Jianming Dong & Min Ji - 214-241 An improved exact algorithm for undirected feedback vertex set
by Mingyu Xiao & Hiroshi Nagamochi - 242-252 An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities
by Sheng Yu - 253-275 Using basis dependence distance vectors in the modified Floyd–Warshall algorithm
by Włodzimierz Bielecki & Krzysztof Kraska & Tomasz Klimek - 276-298 Online bin packing with (1,1) and (2, $$R$$ R ) bins
by Jing Chen & Xin Han & Kazuo Iwama & Hing-Fung Ting - 299-319 An extended strange planet protocol
by Jin Liu & Zhenhua Duan & Cong Tian & Nan Zhang - 320-334 Robust optimization for the hazardous materials transportation network design problem
by Chunlin Xin & Letu Qingge & Jiamin Wang & Binhai Zhu - 335-346 Prompt mechanism for online auctions with multi-unit demands
by Xiangzhong Xiang - 347-359 Online scheduling on two parallel machines with release dates and delivery times
by Peihai Liu & Xiwen Lu - 360-369 NF-based algorithms for online bin packing with buffer and bounded item size
by Feifeng Zheng & Li Luo & E. Zhang - 370-386 On the clustered Steiner tree problem
by Bang Ye Wu & Chen-Wan Lin - 387-401 Walking in streets with minimal sensing
by Azadeh Tabatabaei & Mohammad Ghodsi
July 2015, Volume 30, Issue 1
- 1-17 Group irregularity strength of connected graphs
by Marcin Anholcer & Sylwia Cichacz & Martin Milanic̆ - 18-26 PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
by Lidong Wu & Hongwei Du & Weili Wu & Yuqing Zhu & Ailan Wang & Wonjun Lee - 27-33 An algorithm for the dominator chromatic number of a tree
by Houcine Boumediene Merouane & Mustapha Chellali - 34-41 L( $$d$$ d ,1)-labelings of the edge-path-replacement by factorization of graphs
by Nathaniel Karst & Jessica Oehrlein & Denise Sakai Troxell & Junjie Zhu - 42-62 Snakes, coils, and single-track circuit codes with spread $$k$$ k
by Simon Hood & Daniel Recoskie & Joe Sawada & Dennis Wong - 63-86 Handling least privilege problem and role mining in RBAC
by Hejiao Huang & Feng Shang & Jinling Liu & Hongwei Du - 87-96 An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths
by Marco Bender & Stephan Westphal - 97-108 Better approximation algorithms for influence maximization in online social networks
by Yuqing Zhu & Weili Wu & Yuanjun Bi & Lidong Wu & Yiwei Jiang & Wen Xu - 109-119 Game domination subdivision number of a graph
by O. Favaron & H. Karami & S. M. Sheikholeslami - 120-138 Dual power assignment optimization and fault tolerance in WSNs
by Nhat X. Lam & Trac N. Nguyen & Min Kyung An & Dung T. Huynh - 139-149 Radio number for the product of a path and a complete graph
by Byeong Moon Kim & Woonjae Hwang & Byung Chul Song - 150-159 A new randomized algorithm for group testing with unknown number of defective items
by Yongxi Cheng & Jue Guo & Feifeng Zheng - 160-173 On total colorings of 1-planar graphs
by Xin Zhang & Jianfeng Hou & Guizhen Liu - 174-187 On the complexity of partitioning a graph into a few connected subgraphs
by Julien Bensmail - 188-200 On the constraint length of random $$k$$ k -CSP
by Guangyan Zhou & Zongsheng Gao & Jun Liu
May 2015, Volume 29, Issue 4
- 685-700 Loyalty improvement beyond the seeds in social networks
by Huan Ma & Yuqing Zhu & Deying Li & Songsong Li & Weili Wu - 701-712 Generalized Canadian traveller problems
by Chung-Shou Liao & Yamming Huang - 713-722 The $$r$$ r -acyclic chromatic number of planar graphs
by Guanghui Wang & Guiying Yan & Jiguo Yu & Xin Zhang - 723-738 Optimal-constrained multicast sub-graph over coded packet networks
by M. A. Raayatpanah & H. Salehi Fathabadi & H. Bahramgiri & P. M. Pardalos - 739-749 Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
by Paul C. Bell & Prudence W. H. Wong - 750-780 Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results
by Mirko Ruokokoski & Harri Ehtamo & Panos M. Pardalos - 781-795 Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
by An Zhang & Yiwei Jiang & Lidan Fan & Jueliang Hu - 796-802 The minimum chromatic spectrum of 3-uniform $$\mathcal{C}$$ C -hypergraphs
by Ruixue Zhang & Ping Zhao & Kefeng Diao & Fuliang Lu - 803-814 Complete forcing numbers of catacondensed hexagonal systems
by Shou-Jun Xu & Heping Zhang & Jinzhuan Cai - 815-835 Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks
by Zhipeng Cai & Yueming Duan & Anu G. Bourgeois - 836-846 The online $$k$$ k -server problem with max-distance objective
by Yinfeng Xu & Hongmei Li & Changzheng He & Li Luo - 847-858 Parameterizations of hitting set of bundles and inverse scope
by Peter Damaschke - 859-883 A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
by Theodoros Gevezes & Leonidas Pitsoulis
April 2015, Volume 29, Issue 3
- 511-530 Optimal shortest path set problem in undirected graphs
by Huili Zhang & Yinfeng Xu & Xingang Wen - 531-540 Large hypertree width for sparse random hypergraphs
by Tian Liu & Chaoyi Wang & Ke Xu - 541-564 Zero-visibility cops and robber and the pathwidth of a graph
by Dariusz Dereniowski & Danny Dyer & Ryan M. Tifenbach & Boting Yang - 565-588 An integer programming approach for the Chinese postman problem with time-dependent travel time
by Jinghao Sun & Yakun Meng & Guozhen Tan - 589-604 Expected computations on color spanning sets
by Chao Li & Chenglin Fan & Jun Luo & Farong Zhong & Binhai Zhu - 605-635 Faster exact computation of rSPR distance
by Zhi-Zhong Chen & Ying Fan & Lusheng Wang - 636-654 A set covering approach for multi-depot train driver scheduling
by Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar - 655-669 On $$(s,t)$$ ( s , t ) -relaxed $$L(2,1)$$ L ( 2 , 1 ) -labelings of the triangular lattice
by Wensong Lin & Benqiu Dai - 670-684 On the hardness of learning queries from tree structured data
by Xianmin Liu & Jianzhong Li
February 2015, Volume 29, Issue 2
- 331-366 The Laplacian of a uniform hypergraph
by Shenglong Hu & Liqun Qi - 367-372 General lower bound on the size of $$(H;k)$$ -stable graphs
by Andrzej Żak - 373-388 Two smaller upper bounds of list injective chromatic number
by Yuehua Bu & Kai Lu & Sheng Yang - 389-405 On the $$p$$ -reinforcement and the complexity
by You Lu & Fu-Tao Hu & Jun-Ming Xu - 406-417 Transformation from PLTL to automata via NFGs
by Cong Tian & Zhenhua Duan & Mengfei Yang - 418-432 Network construction with subgraph connectivity constraints
by Dana Angluin & James Aspnes & Lev Reyzin - 433-450 A tolerance-based heuristic approach for the weighted independent set problem
by B. I. Goldengorin & D. S. Malyshev & P. M. Pardalos & V. A. Zamaraev - 451-471 Embedding signed graphs in the line
by Eduardo G. Pardo & Mauricio Soto & Christopher Thraves - 472-487 On the complexity of connectivity in cognitive radio networks through spectrum assignment
by Hongyu Liang & Tiancheng Lou & Haisheng Tan & Yuexuan Wang & Dongxiao Yu - 488-501 Algorithms and complexity results for labeled correlation clustering problem
by Xianmin Liu & Jianzhong Li - 502-510 Nordhaus–Gaddum-type results for path covering and $$L(2,1)$$ -labeling numbers
by Damei Lü & Juan Du & Nianfeng Lin & Ke Zhang & Dan Yi
January 2015, Volume 29, Issue 1
- 1-15 Parametric power supply networks
by Shiho Morishita & Takao Nishizeki - 16-35 DVS scheduling in a line or a star network of processors
by Zongxu Mu & Minming Li - 36-52 A combination of flow shop scheduling and the shortest path problem
by Kameng Nip & Zhenbo Wang & Fabrice Talla Nobibon & Roel Leus - 53-66 An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
by Chenchen Wu & Donglei Du & Dachuan Xu - 67-87 Improved lower bounds for the online bin packing problem with cardinality constraints
by Hiroshi Fujiwara & Koji Kobayashi - 88-124 Computing the shortest reset words of synchronizing automata
by Andrzej Kisielewicz & Jakub Kowalski & Marek Szykuła - 125-140 Randomized parameterized algorithms for $$P_2$$ P 2 -Packing and Co-Path Packing problems
by Qilong Feng & Jianxin Wang & Shaohua Li & Jianer Chen - 141-152 Covering tree with stars
by Jan Baumbach & Jiong Guo & Rashid Ibragimov - 153-164 Improved approximation algorithms for computing $$k$$ k disjoint paths subject to two constraints
by Longkun Guo & Hong Shen & Kewen Liao - 165-181 On the sequential price of anarchy of isolation games
by Anna Angelucci & Vittorio Bilò & Michele Flammini & Luca Moscardelli - 182-196 New bounds for the balloon popping problem
by Davide Bilò & Vittorio Bilò - 197-215 Packing cubes into a cube is NP-complete in the strong sense
by Yiping Lu & Danny Z. Chen & Jianzhong Cha - 216-227 Complexity analysis and algorithms for the Program Download Problem
by Chao Peng & Jie Zhou & Binhai Zhu & Hong Zhu - 228-236 Online unbounded batch scheduling on parallel machines with delivery times
by Peihai Liu & Xiwen Lu - 237-246 Improved local search for universal facility location
by Eric Angel & Nguyen Kim Thang & Damien Regnault - 247-256 Tractable connected domination for restricted bipartite graphs
by Tian Liu & Zhao Lu & Ke Xu - 257-275 An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
by Yunlong Liu & Jianxin Wang & Chao Xu & Jiong Guo & Jianer Chen - 276-307 The $$k$$ k -separator problem: polyhedra, complexity and approximation results
by Walid Ben-Ameur & Mohamed-Ahmed Mohamed-Sidi & José Neto - 308-329 A structural transformation from p- $$\pi $$ π to MSVL
by Ling Luo & Zhenhua Duan & Cong Tian & Xiaobing Wang
November 2014, Volume 28, Issue 4
- 717-725 Lower bounds for independence numbers of some locally sparse graphs
by Yusheng Li & Qizhong Lin - 726-747 Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
by Asaf Levin & Uri Yovel - 748-755 2-Rainbow domination number of Cartesian products: $$C_{n}\square C_{3}$$ and $$C_{n}\square C_{5}$$
by Zofia Stępień & Maciej Zwierzchowski - 756-773 Strategyproof mechanism design for facility location games with weighted agents on a line
by Qiang Zhang & Minming Li - 774-786 Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$ -colorable
by Lingji Xu & Zhengke Miao & Yingqian Wang - 787-799 $$\lambda $$ -numbers of several classes of snarks
by Dengju Ma & Hengfeng Zhu & Jianbao He - 800-813 Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
by Hsing-Yen Ann & Chang-Biau Yang & Chiou-Ting Tseng - 814-826 On metric dimension of permutation graphs
by Michael Hallaway & Cong X. Kang & Eunjeong Yi - 827-836 2-Distance paired-dominating number of graphs
by Kan Yu & Mei Lu - 837-853 Algorithms for the minimum diameter terminal Steiner tree problem
by Wei Ding & Ke Qiu - 854-874 An upper bound of Heilbronn number for eight points in triangles
by Liangyu Chen & Zhenbing Zeng & Wei Zhou - 875-892 Online scheduling with rejection and reordering: exact algorithms for unit size jobs
by Leah Epstein & Hanan Zebedat-Haider - 893-909 Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
by Chengchao Yan & Danjun Huang & Dong Chen & Weifan Wang - 910-916 Approximation algorithms on 0–1 linear knapsack problem with a single continuous variable
by Chenxia Zhao & Xianyue Li
October 2014, Volume 28, Issue 3
- 511-512 Preface
by M. T. Thai & T. N. Dinh - 513-528 A nature-inspired influence propagation model for the community expansion problem
by Yuanjun Bi & Weili Wu & Yuqing Zhu & Lidan Fan & Ailian Wang - 529-539 An individual-based model of information diffusion combining friends’ influence
by Lidan Fan & Zaixin Lu & Weili Wu & Yuanjun Bi & Ailian Wang & Bhavani Thuraisingham - 540-560 On the radius of centrality in evolving communication networks
by Danica Vukadinović Greetham & Zhivko Stoyanov & Peter Grindrod - 561-576 Neighborhood-based uncertainty generation in social networks
by Meng Han & Mingyuan Yan & Jinbao Li & Shouling Ji & Yingshu Li - 577-587 Computing an effective decision making group of a society using social network analysis
by Donghyun Kim & Deying Li & Omid Asgari & Yingshu Li & Alade O. Tokuta & Heekuck Oh - 588-599 Improvement of path analysis algorithm in social networks based on HBase
by Yan Qiang & Bo Pei & Weili Wu & Juanjuan Zhao & Xiaolong Zhang & Yue Li & Lidong Wu - 600-612 Noise-tolerance community detection and evolution in dynamic social networks
by Li Wang & Jiang Wang & Yuanjun Bi & Weili Wu & Wen Xu & Biao Lian - 613-625 A short-term trend prediction model of topic over Sina Weibo dataset
by Juanjuan Zhao & Weili Wu & Xiaolong Zhang & Yan Qiang & Tao Liu & Lidong Wu - 626-638 Notes on $$L(1,1)$$ and $$L(2,1)$$ labelings for $$n$$ -cube
by Haiying Zhou & Wai Chee Shiu & Peter Che Bor Lam - 639-654 Approximability of the subset sum reconfiguration problem
by Takehiro Ito & Erik D. Demaine - 655-673 Best routes selection in multimodal networks using multi-objective genetic algorithm
by Guiwu Xiong & Yong Wang - 674-691 Efficient algorithms for the max $$k$$ -vertex cover problem
by Federico Della Croce & Vangelis Th. Paschos - 692-715 Acyclic edge coloring of planar graphs without a $$3$$ 3 -cycle adjacent to a $$6$$ 6 -cycle
by Yiqiao Wang & Qiaojun Shu & Jian-Liang Wu & Wenwen Zhang
August 2014, Volume 28, Issue 2
- 321-340 Heterochromatic tree partition number in complete multipartite graphs
by Zemin Jin & Peipei Zhu - 341-347 Linear algebraic approach to an edge-coloring result
by Martin Kochol - 348-357 On colour-blind distinguishing colour pallets in regular graphs
by Jakub Przybyło - 358-375 Mobile facility location: combinatorial filtering via weighted occupancy
by Amitai Armon & Iftah Gamzu & Danny Segev - 376-399 A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
by Alain Billionnet & Sourour Elloumi & Amélie Lambert - 400-413 $$F_{3}$$ -domination problem of graphs
by Chan-Wei Chang & David Kuo & Sheng-Chyang Liaw & Jing-Ho Yan - 414-446 A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority
by S. F. Ghannadpour & S. Noori & R. Tavakkoli-Moghaddam - 447-461 Realizations of the game domination number
by Gašper Košmrlj - 462-479 Coloring vertices of claw-free graphs in three colors
by Vadim Lozin & Christopher Purcell - 480-495 Online graph exploration algorithms for cycles and trees by multiple searchers
by Yuya Higashikawa & Naoki Katoh & Stefan Langerman & Shin-ichi Tanigawa