Content
August 2019, Volume 38, Issue 2
- 421-442 On the extremal cacti of given parameters with respect to the difference of zagreb indices
by Shuchao Li & Licheng Zhang & Minjie Zhang - 443-455 Minimum Szeged index among unicyclic graphs with perfect matchings
by Hechao Liu & Hanyuan Deng & Zikai Tang - 456-480 The edge coloring game on trees with the number of colors greater than the game chromatic index
by Wai Lam Fong & Wai Hong Chan - 481-501 Clustering without replication in combinatorial circuits
by Zola Donovan & Gregory Gutin & Vahan Mkrtchyan & K. Subramani - 502-544 Gene tree reconciliation including transfers with replacement is NP-hard and FPT
by Damir Hasić & Eric Tannier - 545-555 Optimal r-dynamic coloring of sparse graphs
by Dan Yi & Junlei Zhu & Lixia Feng & Jiaxin Wang & Mengyini Yang - 556-569 The eigenvectors to the p-spectral radius of general hypergraphs
by Liying Kang & Lele Liu & Erfang Shan - 570-588 The rank of a complex unit gain graph in terms of the rank of its underlying graph
by Yong Lu & Ligong Wang & Qiannan Zhou - 589-607 A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
by Jun Liang & Dingjun Lou & Zongrong Qin & Qinglin Yu - 608-617 A tight linear time $$\frac{13}{12}$$ 13 12 -approximation algorithm for the $$P2 || C_{\max }$$ P 2 | | C max problem
by Federico Della Croce & Rosario Scatamacchia & Vincent T’kindt - 618-634 Approximation algorithm for squared metric two-stage stochastic facility location problem
by Jin Zhang & Min Li & Yishui Wang & Chenchen Wu & Dachuan Xu - 635-645 The connected vertex cover problem in k-regular graphs
by Yuchao Li & Wei Wang & Zishen Yang - 646-665 Jointly stable matchings
by Shuichi Miyazaki & Kazuya Okamoto
July 2019, Volume 38, Issue 1
- 1-20 Maximizing profit of multiple adoptions in social networks with a martingale approach
by Bin Liu & Yuxia Yan & Qizhi Fang & Junyu Dong & Weili Wu & Huijuan Wang - 21-49 Robust multiobjective portfolio optimization: a set order relations approach
by Chen Chen & Yu Wei - 50-71 Minmax scheduling problems with common due-date and completion time penalty
by Baruch Mor - 72-85 Hitting a path: a generalization of weighted connectivity via game theory
by Dávid Szeszlér - 86-110 The Best-or-Worst and the Postdoc problems with random number of candidates
by L. Bayón & P. Fortuny & J. Grau & A. M. Oller-Marcén & M. M. Ruiz - 111-129 Two-stage stochastic days-off scheduling of multi-skilled analysts with training options
by Douglas S. Altner & Erica K. Mason & Les D. Servi - 130-149 Efficient closed domination in digraph products
by Iztok Peterin & Ismael G. Yero - 150-164 An improved approximation algorithm for the minimum 3-path partition problem
by Yong Chen & Randy Goebel & Guohui Lin & Bing Su & Yao Xu & An Zhang - 165-184 Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
by Mattia D’Emidio & Luca Forlizzi & Daniele Frigioni & Stefano Leucci & Guido Proietti - 185-196 Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
by Yulin Chang & Qiancheng Ouyang & Guanghui Wang - 197-207 Optimal channel assignment with list-edge coloring
by Huijuan Wang & Panos M. Pardalos & Bin Liu - 208-223 Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update
by Jianming Zhu & Shuyue Liu & Smita Ghosh - 224-253 Online interval scheduling on two related machines: the power of lookahead
by Nicolas Pinson & Frits C. R. Spieksma - 254-267 On the randomized online strategies for the k-Canadian traveler problem
by Davood Shiri & F. Sibel Salman - 268-277 Skew-rank of an oriented graph and independence number of its underlying graph
by Xueliang Li & Wen Xia - 278-291 Non-adaptive group testing on graphs with connectivity
by Song Luo & Yuji Matsuura & Ying Miao & Maiko Shigeno - 292-315 Connected power domination in graphs
by Boris Brimkov & Derek Mikesell & Logan Smith - 316-332 Determining the interset distance
by Maksim Barketau
May 2019, Volume 37, Issue 4
- 1091-1110 Improved PTAS for the constrained k-means problem
by Qilong Feng & Jiaxin Hu & Neng Huang & Jianxin Wang - 1111-1125 Approximation algorithms for distance constraint sweep coverage with base stations
by Jian Liang & Xiaohui Huang & Zhao Zhang - 1126-1149 Improved bounds for the greedy strategy in optimization problems with curvature
by Yajing Liu & Edwin K. P. Chong & Ali Pezeshki - 1150-1169 On the complexity of restoring corrupted colorings
by Marzio Biasi & Juho Lauri - 1170-1190 An approximation algorithm for genome sorting by reversals to recover all adjacencies
by Shanshan Zhai & Peng Zhang & Daming Zhu & Weitian Tong & Yao Xu & Guohui Lin - 1191-1215 Verifying a scheduling protocol of safety-critical systems
by Meng Wang & Cong Tian & Nan Zhang & Zhenhua Duan & Hongwei Du - 1216-1236 A new look at the returning secretary problem
by J. M. Grau Ribas - 1237-1248 Speech corpora subset selection based on time-continuous utterances features
by Luobing Dong & Qiumin Guo & Weili Wu - 1249-1265 Balanced tree partition problems with virtual nodes
by Baoling Ning & Jianzhong Li & Shouxu Jiang - 1266-1282 Speed scaling on parallel processors with migration
by Eric Angel & Evripidis Bampis & Fadi Kacem & Dimitrios Letsios - 1283-1311 Positive-instance driven dynamic programming for treewidth
by Hisao Tamaki - 1312-1326 LP-based pivoting algorithm for higher-order correlation clustering
by Takuro Fukunaga - 1327-1341 On the 2-rainbow domination stable graphs
by Zepeng Li & Zehui Shao & Pu Wu & Taiyin Zhao - 1342-1350 Independence and matching number of some graphs
by Ming Chen & Yusheng Li & Yiting Yang - 1351-1366 On operations preserving semi-transitive orientability of graphs
by Ilkyoo Choi & Jinha Kim & Minki Kim - 1367-1407 Estimating the number of basins of attraction of multi-objective combinatorial problems
by Madalina M. Drugan - 1408-1423 Efficient algorithms for computing one or two discrete centers hitting a set of line segments
by Xiaozhou He & Zhihui Liu & Bing Su & Yinfeng Xu & Feifeng Zheng & Binhai Zhu
April 2019, Volume 37, Issue 3
- 757-805 Operating room planning and surgical case scheduling: a review of literature
by Shuwan Zhu & Wenjuan Fan & Shanlin Yang & Jun Pei & Panos M. Pardalos - 806-826 Accelerating benders decomposition: multiple cuts via multiple solutions
by N. Beheshti Asl & S. A. MirHassani - 827-847 Pareto optimal equilibria for selfish bin packing with uniform cost sharing
by György Dósa & Leah Epstein - 848-865 Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem
by Davood Shiri & F. Sibel Salman - 866-888 Agreeable sets with matroidal constraints
by Laurent Gourvès - 889-900 Client assignment problems for latency minimization
by Gruia Călinescu & Xiaolang Wang - 901-920 Verifying schedulability of tasks in ROS-based systems
by Jin Cui & Cong Tian & Nan Zhang & Zhenhua Duan & Hongwei Du - 921-934 A possible optimal design of one-way Hamming network H(n, 3) based on the minimum transmission latency
by Yanyan Wen & Guorong Chai & Qiuli Li & Zhe George Zhang - 935-956 Restricted power domination and zero forcing problems
by Chassidy Bozeman & Boris Brimkov & Craig Erickson & Daniela Ferrero & Mary Flagg & Leslie Hogben - 957-969 An $$O(n(m+n\log n)\log n)$$O(n(m+nlogn)logn) time algorithm to solve the minimum cost tension problem
by Mehdi Ghiyasvand - 970-988 Minimum rank and zero forcing number for butterfly networks
by Daniela Ferrero & Cyriac Grigorious & Thomas Kalinowski & Joe Ryan & Sudeep Stephen - 989-999 A note on a two-agent scheduling problem related to the total weighted late work
by Yuan Zhang & Jinjiang Yuan - 1000-1010 A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k
by Jun Liang & Dingjun Lou - 1011-1044 Drawer algorithms for 1-space bounded multidimensional hyperbox packing
by Paulina Grzegorek & Janusz Januszewski - 1045-1070 Approximation algorithms for the graph balancing problem with two speeds and two job lengths
by Daniel R. Page & Roberto Solis-Oba - 1071-1089 Planar graphs with $$\Delta =9$$Δ=9 are neighbor-distinguishing totally 12-colorable
by Weifan Wang & Jingjing Huo & Danjun Huang & Yiqiao Wang
February 2019, Volume 37, Issue 2
- 423-423 Preface to the special issue on computing and combinatorics
by Yixin Cao & Jianer Chen - 424-438 An improved lower bound on the growth constant of polyiamonds
by Gill Barequet & Mira Shalah & Yufei Zheng - 439-453 Local search approximation algorithms for the k-means problem with penalties
by Dongmei Zhang & Chunlin Hao & Chenchen Wu & Dachuan Xu & Zhenning Zhang - 454-464 Reconfiguration of maximum-weight b-matchings in a graph
by Takehiro Ito & Naonori Kakimura & Naoyuki Kamiyama & Yusuke Kobayashi & Yoshio Okamoto - 465-481 Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
by Sankardeep Chakraborty & Srinivasa Rao Satti - 482-500 Unfolding some classes of orthogonal polyhedra of arbitrary genus
by Kuan-Yi Ho & Yi-Jun Chang & Hsu-Chun Yen - 501-522 Efficient enumeration of non-equivalent squares in partial words with few holes
by Panagiotis Charalampopoulos & Maxime Crochemore & Costas S. Iliopoulos & Tomasz Kociumaka & Solon P. Pissis & Jakub Radoszewski & Wojciech Rytter & Tomasz Waleń - 523-545 Dynamic rank-maximal and popular matchings
by Prajakta Nimbhorkar & V. Arvind Rameshwar - 546-562 Deadlock resolution in wait-for graphs by vertex/arc deletion
by Alan Diêgo Aurélio Carneiro & Fábio Protti & Uéverton S. Souza - 563-578 Better approximability results for min–max tree/cycle/path cover problems
by Wei Yu & Zhaohui Liu - 579-600 Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
by Elena Arseneva & Evanthia Papadopoulou - 601-619 Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications
by Wenkai Dai & Yongjie Yang - 620-638 Pure Nash equilibria in restricted budget games
by Maximilian Drees & Matthias Feldotto & Sören Riechers & Alexander Skopalik - 639-667 Agent incentives of a proportional sharing mechanism in resource sharing
by Zhou Chen & Yukun Cheng & Qi Qi & Xiang Yan - 668-684 A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
by Jianming Dong & Ruyan Jin & Jueliang Hu & Guohui Lin - 685-701 On the weighted safe set problem on paths and cycles
by Shinya Fujita & Tommy Jensen & Boram Park & Tadashi Sakuma - 702-712 Independent bondage number of a graph
by Bruce Priddy & Haiying Wang & Bing Wei - 713-736 An improved algorithm for two stage time minimization assignment problem
by Ekta Jain & Kalpana Dahiya & Anuj Sharma & Vanita Verma - 737-755 Strategy-proof mechanisms for obnoxious facility game with bounded service range
by Yukun Cheng & Qiaoming Han & Wei Yu & Guochuan Zhang
January 2019, Volume 37, Issue 1
- 1-19 Case Mix Index weighted multi-objective optimization of inpatient bed allocation in general hospital
by Jian Chang & Lingjuan Zhang - 20-39 Study on specialist outpatient matching appointment and the balance matching model
by Ying Yang & Shoucheng Luo & Jing Fan & Xinye Zhou & Chunyu Fu & Guochun Tang - 40-61 A scheduling algorithm for medical emergency rescue aircraft trajectory based on hybrid estimation and intent inference
by Bin Hu & Fang Pan & Lei Wang - 62-82 MRI appointment scheduling with uncertain examination time
by Huaxin Qiu & Dujuan Wang & Yanzhang Wang & Yunqiang Yin - 83-94 The medical laboratory scheduling for weighted flow-time
by Wenhua Li & Xing Chai - 95-113 An integrated method to solve the healthcare facility layout problem under area constraints
by Ling Gai & Jiandong Ji - 114-122 Online in-time service problem with minimal server assignment
by Shanxiu Jiang & Li Luo - 123-149 Online scheduling for outpatient services with heterogeneous patients and physicians
by Huiqiao Su & Guohua Wan & Shan Wang - 150-182 A comparison of fixed and variable capacity-addition policies for outpatient capacity allocation
by Bowen Jiang & Jiafu Tang & Chongjun Yan - 183-195 Prognostics and health management of life-supporting medical instruments
by Cheng He & Yang Wu & Tong Chen - 196-220 Real-time scheduling optimization considering the unexpected events in home health care
by Gang Du & Luyao Zheng & Xiaoling Ouyang - 221-247 Matching patients and healthcare service providers: a novel two-stage method based on knowledge rules and OWA-NSGA-II algorithm
by Xi Chen & Liu Zhao & Haiming Liang & Kin Keung Lai - 248-270 Influencing factors analysis and modeling of hospital-acquired infection in elderly patients
by Xiaohui Liu & Ni Zou & Dan Zhu & Dan Wang - 271-285 Optimal arrangement of the pulmonary interventional surgeries considering timely distribution of medical consumables
by Huidan Lin & Qun Li & Xueguo Xu & Ping Li - 286-292 Three-sided stable matching problem with two of them as cooperative partners
by Liwei Zhong & Yanqin Bai - 293-318 Optimizing model parameter for entity summarization across knowledge graphs
by Jihong Yan & Chen Xu & Na Li & Ming Gao & Aoying Zhou - 319-329 Two-stage medical supply chain scheduling with an assignable common due window and shelf life
by Long Zhang & Yuzhong Zhang & Qingguo Bai - 330-336 Three-dimensional stable matching with hybrid preferences
by Feng Zhang & Jing Li & Junxiang Fan & Huili Shen & Jian Shen & Hua Yu - 337-362 Patient scheduling in hemodialysis service
by Zhenyuan Liu & Jiongbing Lu & Zaisheng Liu & Guangrui Liao & Hao Howard Zhang & Junwu Dong - 363-374 Two-machine flowshop scheduling in a physical examination center
by Yadong Wang & Baoqiang Fan & Jingang Zhai & Wei Xiong - 375-384 Analysis of cough detection index based on decision tree and support vector machine
by Wei Gao & Wuping Bao & Xin Zhou - 385-404 Large-scale medical examination scheduling technology based on intelligent optimization
by Jiawei Zhang & Ling Wang & Lining Xing - 405-417 A combinatorial auction mechanism for surgical scheduling considering surgeon’s private availability information
by Lu Liu & Chun Wang & Jianjun Wang - 418-422 Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016
by Satoru Fujishige & A. Ridha Mahjoub & Franz Rendl
November 2018, Volume 36, Issue 4
- 1103-1117 The capture time of a planar graph
by Photchchara Pisantechakool & Xuehou Tan - 1118-1127 The w-centroids and least w-central subtrees in weighted trees
by Erfang Shan & Liying Kang - 1128-1144 The mixed center location problem
by Yi Xu & Jigen Peng & Yinfeng Xu - 1145-1167 Congestion games with mixed objectives
by Matthias Feldotto & Lennart Leder & Alexander Skopalik - 1168-1194 Cost-efficient scheduling on machines from the cloud
by Alexander Mäcker & Manuel Malatyali & Friedhelm Meyer auf der Heide & Sören Riechers - 1195-1220 On residual approximation in solution extension problems
by Mathias Weller & Annie Chateau & Rodolphe Giroudeau & Jean-Claude König & Valentin Pollet - 1221-1242 Safe sets in graphs: Graph classes and structural parameters
by Raquel Águeda & Nathann Cohen & Shinya Fujita & Sylvain Legay & Yannis Manoussakis & Yasuko Matsui & Leandro Montero & Reza Naserasr & Hirotaka Ono & Yota Otachi & Tadashi Sakuma & Zsolt Tuza & Renyu Xu - 1243-1261 Constant factor approximation for the weighted partial degree bounded edge packing problem
by Pawan Aurora & Monalisa Jena & Rajiv Raman - 1262-1298 A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
by Wei Ding & Ke Qiu - 1299-1314 The mixed evacuation problem
by Yosuke Hanawa & Yuya Higashikawa & Naoyuki Kamiyama & Naoki Katoh & Atsushi Takizawa - 1315-1332 Finding disjoint paths on edge-colored graphs: more tractability results
by Riccardo Dondi & Florian Sikora - 1333-1355 Broadcasting multiple messages in the 1-in port model in optimal time
by Petr Gregor & Riste Škrekovski & Vida Vukašinović - 1356-1379 Scheduling with interjob communication on parallel processors
by Jürgen König & Alexander Mäcker & Friedhelm Meyer auf der Heide & Sören Riechers - 1380-1387 Equivalence of two-sided stable matching
by Liwei Zhong & Yanqin Bai - 1388-1410 Embeddings into almost self-centered graphs of given radius
by Kexiang Xu & Haiqiong Liu & Kinkar Ch. Das & Sandi Klavžar - 1411-1424 List 2-distance $$\varDelta +3$$ Δ + 3 -coloring of planar graphs without 4,5-cycles
by Haiyang Zhu & Yu Gu & Jingjun Sheng & Xinzhong Lü - 1425-1438 New bounds for locally irregular chromatic index of bipartite and subcubic graphs
by Borut Lužar & Jakub Przybyło & Roman Soták
October 2018, Volume 36, Issue 3
- 671-677 Base polyhedra and the linking property
by Tamás Király - 678-708 On a general framework for network representability in discrete optimization
by Yuni Iwamasa - 709-741 A compact representation for minimizers of k-submodular functions
by Hiroshi Hirai & Taihei Oki - 742-762 An algorithm for finding a representation of a subtree distance
by Kazutoshi Ando & Koki Sato - 763-788 Lot sizing with storage losses under demand uncertainty
by Stefano Coniglio & Arie M. C. A. Koster & Nils Spiekermann - 789-811 ILP formulation of the degree-constrained minimum spanning hierarchy problem
by Massinissa Merabet & Miklos Molnar & Sylvain Durand - 812-830 Uniqueness of equilibria in atomic splittable polymatroid congestion games
by Tobias Harks & Veerle Timmermans - 831-844 Sum-of-squares rank upper bounds for matching problems
by Adam Kurpisz & Samuli Leppänen & Monaldo Mastrolilli - 845-860 Robust trading mechanisms over 0/1 polytopes
by Mustafa Ç. Pınar - 861-870 Optimization problems with color-induced budget constraints
by Corinna Gottschalk & Hendrik Lüthen & Britta Peis & Andreas Wierz - 871-895 Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
by Sven Mallach - 896-915 Planning personnel retraining: column generation heuristics
by Oliver G. Czibula & Hanyu Gu & Yakov Zinder - 916-936 An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
by Diego Recalde & Daniel Severín & Ramiro Torres & Polo Vaca - 937-964 Subset sum problems with digraph constraints
by Laurent Gourvès & Jérôme Monnot & Lydia Tlilane - 965-1006 The QAP-polytope and the graph isomorphism problem
by Pawan Aurora & Shashank K. Mehta - 1007-1023 The weakly connected independent set polytope in corona and join of graphs
by F. Bendali & J. Mailfert - 1024-1058 The min-up/min-down unit commitment polytope
by Pascale Bendotti & Pierre Fouilhoux & Cécile Rottner - 1059-1073 Approximability and exact resolution of the multidimensional binary vector assignment problem
by Marin Bougeret & Guillerme Duvillié & Rodolphe Giroudeau - 1074-1101 On the m-clique free interval subgraphs polytope: polyhedral analysis and applications
by Mohammed-Albarra Hassan & Imed Kacem & Sébastien Martin & Izzeldin M. Osman
August 2018, Volume 36, Issue 2
- 329-345 On approximating optimal weight “no”-certificates in weighted difference constraint systems
by Bugra Caskurlu & Matthew Williamson & K. Subramani & Vahan Mkrtchyan - 346-364 Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable
by Heather Hoskins & Runrun Liu & Jennifer Vandenbussche & Gexin Yu - 365-391 Computing the k-resilience of a synchronized multi-robot system
by Sergey Bereg & Luis-Evaristo Caraballo & José-Miguel Díaz-Báñez & Mario A. Lopez - 392-399 Blocking Rumor by Cut
by Ling Gai & Hongwei Du & Lidong Wu & Junlei Zhu & Yuehua Bu - 400-415 A tractable discrete fractional programming: application to constrained assortment optimization
by Tian Xie & Dongdong Ge - 416-433 Perfect graphs involving semitotal and semipaired domination
by Teresa W. Haynes & Michael A. Henning - 434-457 Minimizing the total cost of barrier coverage in a linear domain
by Xiao Zhang & Haosheng Fan & Victor C. S. Lee & Minming Li & Yingchao Zhao & Chuang Liu - 458-471 The $$(k,\ell )$$ ( k , ℓ ) -proper index of graphs
by Hong Chang & Xueliang Li & Colton Magnant & Zhongmei Qin - 472-492 Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan
by Xing Chai & Wenhua Li - 493-507 Online leasing problem with price fluctuations under the consumer price index
by Xin Feng & Yinfeng Xu & Guanqun Ni & Yongwu Dai - 508-531 Min-Sum Bin Packing
by Leah Epstein & David S. Johnson & Asaf Levin - 532-548 On the complete width and edge clique cover problems
by Van Bang Le & Sheng-Lung Peng - 549-571 Approximation strategy-proof mechanisms for obnoxious facility location on a line
by Lili Mei & Deshi Ye & Yong Zhang - 572-590 Algorithmic aspects of b-disjunctive domination in graphs
by B. S. Panda & Arti Pandey & S. Paul - 591-616 On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions
by Marc Hellmuth & Nicolas Wieseke - 617-636 Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
by Jiayin Pan & Yinfeng Xu & Guiqing Zhang - 637-669 On the most imbalanced orientation of a graph
by Walid Ben-Ameur & Antoine Glorieux & José Neto
July 2018, Volume 36, Issue 1
- 1-12 The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices
by Wai Lam Fong & Wai Hong Chan & Ge Nong - 13-22 Minimum choosability of planar graphs
by Huijuan Wang & Bin Liu & Ling Gai & Hongwei Du & Jianliang Wu - 23-34 Neighbor sum distinguishing total coloring of graphs with bounded treewidth
by Miaomiao Han & You Lu & Rong Luo & Zhengke Miao - 35-43 A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network
by Lina Chen & Xiaohui Huang & Zhao Zhang - 44-54 An improved online evacuation strategy from a convex region on grid networks
by Guiqing Zhang & Yongxi Cheng & Lan Qin - 55-64 Minimum 2-distance coloring of planar graphs and channel assignment
by Junlei Zhu & Yuehua Bu - 65-80 Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
by Jing Huang & Shuchao Li & Hua Wang - 81-89 An upper bound on the double Roman domination number
by J. Amjadi & S. Nazari-Moghaddam & S. M. Sheikholeslami & L. Volkmann - 90-107 Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
by Maurice Queyranne & Laurence A. Wolsey - 108-120 2-Distance vertex-distinguishing index of subcubic graphs
by Victor Loumngam Kamga & Weifan Wang & Ying Wang & Min Chen - 121-129 Majorization and the spectral radius of starlike trees
by Mohammad Reza Oboudi - 130-130 Correction to: Majorization and the spectral radius of starlike trees
by Mohammad Reza Oboudi - 131-141 Approximation algorithms for the bus evacuation problem
by Lehilton L. C. Pedrosa & Rafael C. S. Schouery - 142-161 Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan
by Jinwei Gu & Manzhan Gu & Xiwen Lu & Ying Zhang - 162-193 A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems
by Maurizio Bruglieri & Ferdinando Pezzella & Ornella Pisacane - 194-210 New lower bounds for the second variable Zagreb index
by Álvaro Martínez-Pérez & José M. Rodríguez - 211-229 Path cooperative games
by Qizhi Fang & Bo Li & Xiaohan Shan & Xiaoming Sun - 230-251 Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks
by Yueshi Wu & Mihaela Cardei - 252-263 Algorithms for connected p-centdian problem on block graphs
by Liying Kang & Jianjie Zhou & Erfang Shan - 264-279 An approximation algorithm for k-facility location problem with linear penalties using local search scheme
by Yishui Wang & Dachuan Xu & Donglei Du & Chenchen Wu - 280-306 Improved algorithms for the evacuation route planning problem
by Gopinath Mishra & Subhra Mazumdar & Arindam Pal - 307-328 Creating an acceptable consensus ranking for group decision making
by Kelin Luo & Yinfeng Xu & Bowen Zhang & Huili Zhang
May 2018, Volume 35, Issue 4
- 997-1008 Edge-disjoint spanning trees and the number of maximum state circles of a graph
by Xiaoli Ma & Baoyindureng Wu & Xian’an Jin - 1009-1041 Integer programming approach to static monopolies in graphs
by Babak Moazzez & Hossein Soltani - 1042-1060 Smart elements in combinatorial group testing problems
by Dániel Gerbner & Máté Vizer - 1061-1085 A feasibility approach for constructing combinatorial designs of circulant type
by Francisco J. Aragón Artacho & Rubén Campoy & Ilias Kotsireas & Matthew K. Tam - 1086-1103 An optimal Tate pairing computation using Jacobi quartic elliptic curves
by Srinath Doss & Roselyn Kaondera-Shava - 1104-1127 The number of edges, spectral radius and Hamilton-connectedness of graphs
by Ming-Zhu Chen & Xiao-Dong Zhang - 1128-1146 FPT-algorithms for some problems related to integer programming
by D. V. Gribanov & D. S. Malyshev & P. M. Pardalos & S. I. Veselov - 1147-1167 Channel assignment problem and n-fold t-separated $$L(j_1,j_2,\ldots ,j_m)$$ L ( j 1 , j 2 , … , j m ) -labeling of graphs
by Wensong Lin & Chenli Shen - 1168-1184 A local search approximation algorithm for a squared metric k-facility location problem
by Dongmei Zhang & Dachuan Xu & Yishui Wang & Peng Zhang & Zhenning Zhang - 1185-1201 Dynamic work hour optimization for casual workers
by Weimin Ma & Wei Shao & Xiaodong Ji - 1202-1240 Maximizing misinformation restriction within time and budget constraints
by Canh V. Pham & My T. Thai & Hieu V. Duong & Bao Q. Bui & Huan X. Hoang - 1241-1249 Greedy Nim $$_\mathrm{{k}}$$ k Game
by Xinzhong Lv & Rongxing Xu & Xuding Zhu - 1250-1260 A continuous characterization of the maximum vertex-weighted clique in hypergraphs
by Qingsong Tang & Xiangde Zhang & Guoren Wang & Cheng Zhao - 1261-1285 Quantile and mean value measures of search process complexity
by Jaromír Kukal & Matej Mojzeš - 1286-1299 On the lower bounds of random Max 3 and 4-SAT
by Guangyan Zhou & Zongsheng Gao - 1300-1311 Some extremal results on the colorful monochromatic vertex-connectivity of a graph
by Qingqiong Cai & Xueliang Li & Di Wu