Printed from https://ideas.repec.org/s/spr/jcomop6.html
Content
February 2019, Volume 37, Issue 2
- 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 - 1312-1329 On the algorithmic aspects of strong subcoloring
by M. A. Shalu & S. Vijayakumar & S. Devi Yamini & T. P. Sandhya
April 2018, Volume 35, Issue 3
- 667-683 A randomized competitive group testing procedure
by Guiqing Zhang & Yongxi Cheng & Yinfeng Xu - 684-702 Minimal path decomposition of complete bipartite graphs
by Costas K. Constantinou & Georgios Ellinas - 703-723 The Best-or-Worst and the Postdoc problems
by L. Bayón & P. Fortuny Ayuso & J. M. Grau & A. M. Oller-Marcén & M. M. Ruiz - 724-739 Sparse multipartite graphs as partition universal for graphs with bounded degree
by Qizhong Lin & Yusheng Li - 740-753 An $$O(|E(G)|^2)$$ O ( | E ( G ) | 2 ) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
by Xing Feng & Lianzhu Zhang & Mingzu Zhang - 754-777 Special cases of the quadratic shortest path problem
by Hao Hu & Renata Sotirov - 778-793 Neighbor sum distinguishing list total coloring of subcubic graphs
by You Lu & Chuandong Xu & Zhengke Miao - 794-813 Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
by Asaf Levin & Aleksander Vainer - 814-841 The Wiener index of Sierpiński-like graphs
by Chunmei Luo & Liancui Zuo & Philip B. Zhang - 842-852 Critical objective function values in linear sum assignment problems
by Ivan Belik & Kurt Jornsten - 853-859 The matching extension problem in general graphs is co-NP-complete
by Jan Hackfeld & Arie M. C. A. Koster - 860-894 Race to idle or not: balancing the memory sleep time with DVS for energy minimization
by Chenchen Fu & Vincent Chau & Minming Li & Chun Jason Xue - 895-905 Complexity and inapproximability results for the Power Edge Set problem
by Sonia Toubaline & Claudia D’Ambrosio & Leo Liberti & Pierre-Louis Poirion & Baruch Schieber & Hadas Shachnai - 906-920 Generalized acyclic edge colorings via entropy compression
by Laihao Ding & Guanghui Wang & Jianliang Wu - 921-940 Reliability evaluation of a multicast over coded packet networks
by M. A. Raayatpanah & P. M. Pardalos - 941-954 Online covering salesman problem
by Huili Zhang & Yinfeng Xu - 955-979 An approximation algorithm for maximum internal spanning tree
by Zhi-Zhong Chen & Youta Harada & Fei Guo & Lusheng Wang - 980-996 Planar graphs without chordal 5-cycles are 2-good
by Weifan Wang & Tingting Wu & Xiaoxue Hu & Yiqiao Wang
February 2018, Volume 35, Issue 2
- 331-340 The longest commonly positioned increasing subsequences problem
by Xiaozhou He & Yinfeng Xu - 341-349 Arcs in $$\mathbb Z^2_{2p}$$ Z 2 p 2
by Zofia Stȩpień & Lucjan Szymaszkiewicz - 350-364 Tight bounds for NF-based bounded-space online bin packing algorithms
by József Békési & Gábor Galambos - 365-372 Vertex arboricity of planar graphs without intersecting 5-cycles
by Hua Cai & Jianliang Wu & Lin Sun - 373-388 On vertex-parity edge-colorings
by Borut Lužar & Mirko Petruševski & Riste Škrekovski - 389-408 A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
by K. Subramani & Piotr Wojciechowski - 409-423 A local search approximation algorithm for the uniform capacitated k-facility location problem
by Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang - 424-435 Algorithm complexity of neighborhood total domination and $$(\rho ,\gamma _{nt})$$ ( ρ , γ n t ) -graphs
by Changhong Lu & Bing Wang & Kan Wang - 436-453 A characterization of linearizable instances of the quadratic minimum spanning tree problem
by Ante Ćustić & Abraham P. Punnen - 454-462 Upper bounds for adjacent vertex-distinguishing edge coloring
by Junlei Zhu & Yuehua Bu & Yun Dai - 463-472 Properly colored trails, paths, and bridges
by Wayne Goddard & Robert Melville - 473-492 A low complexity semidefinite relaxation for large-scale MIMO detection
by Rupaj Kumar Nayak & Mahendra Prasad Biswal - 493-511 An approximation algorithm for soft capacitated k-facility location problem
by Yanjun Jiang & Dachuan Xu & Donglei Du & Chenchen Wu & Dongmei Zhang - 512-529 From theory to practice: maximizing revenues for on-line dial-a-ride
by Ananya Christman & William Forcier & Aayam Poudel - 530-537 Online lazy bureaucrat scheduling with a machine deadline
by Ling Gai & Guochuan Zhang - 538-554 The connected disk covering problem
by Yi Xu & Jigen Peng & Wencheng Wang & Binhai Zhu - 555-562 List-edge-coloring of planar graphs without 6-cycles with three chords
by Haiying Wang & Jianliang Wu - 563-587 Two-step values for games with two-level communication structure
by Sylvain Béal & Anna Khmelnitskaya & Philippe Solal - 588-612 Two extremal problems related to orders
by Biao Wu & Yuejian Peng - 613-631 On computing a minimum secure dominating set in block graphs
by D. Pradhan & Anupriya Jha - 632-640 Bin packing game with a price of anarchy of $$\frac{3}{2}$$ 3 2
by Q. Q. Nong & T. Sun & T. C. E. Cheng & Q. Z. Fang - 641-665 Computational aspects of greedy partitioning of graphs
by Piotr Borowiecki
January 2018, Volume 35, Issue 1
- 1-13 The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
by Xiaohan Cheng & Jianliang Wu - 14-20 A note on domination and total domination in prisms
by Wayne Goddard & Michael A. Henning - 21-25 A tight lower bound for the hardness of clutters
by Vahan Mkrtchyan & Hovhannes Sargsyan - 26-47 Harsanyi power solution for games with restricted cooperation
by Zhengxing Zou & Qiang Zhang - 48-63 Partitioning dense uniform hypergraphs
by Shufei Wu & Jianfeng Hou - 64-74 Bounds on the domination number of a digraph
by Guoliang Hao & Jianguo Qian - 75-85 Weak {2}-domination number of Cartesian products of cycles
by Zepeng Li & Zehui Shao & Jin Xu - 86-107 Rainbow vertex connection of digraphs
by Hui Lei & Shasha Li & Henry Liu & Yongtang Shi - 108-125 Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
by Weiya Zhong & Yun Shi - 126-133 Nordhaus–Gaddum bounds for total Roman domination
by J. Amjadi & S. M. Sheikholeslami & M. Soroudi - 134-147 Total and forcing total edge-to-vertex monophonic number of a graph
by J. John & K. Uma Samundesvari - 148-161 Deterministic construction of compressed sensing matrices based on semilattices
by Jun Guo & Junli Liu - 162-169 Large even factors of graphs
by Jing Chen & Genghua Fan - 170-188 Competitive intensity and quality maximizing seedings in knock-out tournaments
by Dmitry Dagaev & Alex Suzdaltsev - 189-208 Algorithms for testing occurrences of length 4 patterns in permutations
by Yijie Han & Sanjeev Saxena - 209-215 On general threshold and general cascade models of social influence
by Weili Wu & Hongwei Du & Huijuan Wang & Lidong Wu & Zhenhua Duan & Cong Tian - 216-223 Online MapReduce processing on two identical parallel machines
by Jidan Huang & Feifeng Zheng & Yinfeng Xu & Ming Liu - 224-249 Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
by Raka Jovanovic & Abdelkader Bousselham & Stefan Voß - 250-265 The maximum cardinality cut problem in co-bipartite chain graphs
by Arman Boyacı & Tınaz Ekim & Mordechai Shalom - 266-292 Closed-loop supply chain inventory management with recovery information of reusable containers
by Tianji Yang & Chao Fu & Xinbao Liu & Jun Pei & Lin Liu & Panos M. Pardalos - 293-317 GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs
by Yan Zhao & Liping Chen & Gang Xie & Jianjun Zhao & Jianwan Ding - 318-330 Approximation algorithms for precedence-constrained identical machine scheduling with rejection
by Xianzhao Zhang & Dachuan Xu & Donglei Du & Chenchen Wu
November 2017, Volume 34, Issue 4
- 987-1011 A sufficient condition for planar graphs to be (3, 1)-choosable
by Min Chen & Yingying Fan & Yiqiao Wang & Weifan Wang - 1012-1028 Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
by Zemin Jin & Yuefang Sun & Sherry H. F. Yan & Yuping Zang - 1029-1051 Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ 2 π / 3 antennas
by Tien Tran & Min Kyung An & Dung T. Huynh - 1052-1059 Approximation for vertex cover in $$\beta $$ β -conflict graphs
by Dongjing Miao & Zhipeng Cai & Weitian Tong & Jianzhong Li - 1060-1083 The k-hop connected dominating set problem: approximation and hardness
by Rafael S. Coelho & Phablo F. S. Moura & Yoshiko Wakabayashi - 1084-1095 An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs
by Wei Ding & Ke Qiu - 1096-1113 Competitive analysis of bi-directional non-preemptive conversion
by Günter Schmidt - 1114-1132 On the Langberg–Médard multiple unicast conjecture
by Kai Cai & Guangyue Han - 1133-1146 A primal–dual online algorithm for the k-server problem on weighted HSTs
by Wenbin Chen & Fufang Li & Jianxiong Wang & Ke Qi & Maobin Tang & Xiuni Wang - 1147-1158 Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
by Hongjie Song & Changqing Xu - 1159-1186 Discrete parallel machine makespan ScheLoc problem
by Corinna Heßler & Kaouthar Deghdak - 1187-1197 An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
by Ruyan Fu & Ji Tian & Shisheng Li & Jinjiang Yuan - 1198-1209 Bin packing under linear constraints
by Zhenbo Wang & Kameng Nip - 1210-1217 Hamiltonian numbers in oriented graphs
by Li-Da Tong & Hao-Yu Yang - 1218-1236 Change-making problems revisited: a parameterized point of view
by Steffen Goebbels & Frank Gurski & Jochen Rethmann & Eda Yilmaz