Printed from https://ideas.repec.org/s/spr/jcomop8.html
Content
May 2016, Volume 31, Issue 4
- 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 - 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