Printed from https://ideas.repec.org/s/spr/jcomop6.html
Content
January 2018, Volume 35, Issue 1
- 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 - 1237-1264 Online set multicover algorithms for dynamic D2D communications
by Alan Kuhnle & Xiang Li & J. David Smith & My T. Thai - 1265-1301 The computational complexity of QoS measures for orchestrations
by Joaquim Gabarro & Sergio Leon-Gaixas & Maria Serna - 1302-1322 2-Distance coloring of planar graphs with girth 5
by Wei Dong & Baogang Xu
October 2017, Volume 34, Issue 3
- 661-675 Total coloring of outer-1-planar graphs with near-independent crossings
by Xin Zhang - 676-688 Cost sharing on prices for games on graphs
by Daniel Li Li & Erfang Shan - 689-705 Near optimal algorithms for online weighted bipartite matching in adversary model
by Xiaoming Sun & Jia Zhang & Jialin Zhang - 706-724 On the L(2, 1)-labeling conjecture for brick product graphs
by Zehui Shao & Xiaosong Zhang & Huiqin Jiang & Bo Wang & Juanjuan He - 725-735 Maximum coverage problem with group budget constraints
by Boaz Farbstein & Asaf Levin - 736-741 Note on power propagation time and lower bounds for the power domination number
by Daniela Ferrero & Leslie Hogben & Franklin H. J. Kenter & Michael Young - 742-759 Neighbor-sum-distinguishing edge choosability of subcubic graphs
by Jingjing Huo & Yiqiao Wang & Weifan Wang - 760-770 Is there any polynomial upper bound for the universal labeling of graphs?
by Arash Ahadi & Ali Dehghan & Morteza Saghafian - 771-780 Disconnected $$g_c$$ g c -critical graphs
by Xia Zhang - 781-797 Optimization techniques for multivariate least trimmed absolute deviation estimation
by G. Zioutas & C. Chatzinakos & T. D. Nguyen & L. Pitsoulis - 798-809 Neighbor sum distinguishing index of 2-degenerate graphs
by Xiaolan Hu & Yaojun Chen & Rong Luo & Zhengke Miao - 810-828 A two-phase algorithm for bin stretching with stretching factor 1.5
by Martin Böhm & Jiří Sgall & Rob Stee & Pavel Veselý - 829-829 Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5
by Martin Böhm & Jiří Sgall & Rob Stee & Pavel Veselý - 830-873 A refined algorithm for maximum independent set in degree-4 graphs
by Mingyu Xiao & Hiorshi Nagamochi - 874-890 On list r-hued coloring of planar graphs
by Haiyang Zhu & Sheng Chen & Lianying Miao & Xinzhong Lv - 891-915 The traveling salesman problem on grids with forbidden neighborhoods
by Anja Fischer & Philipp Hungerländer - 916-930 Nordhaus–Gaddum type result for the matching number of a graph
by Huiqiu Lin & Jinlong Shu & Baoyindureng Wu - 931-955 Multiple facility location on a network with linear reliability order of edges
by Refael Hassin & R. Ravi & F. Sibel Salman - 956-963 A simple approximation algorithm for minimum weight partial connected set cover
by Yubai Zhang & Yingli Ran & Zhao Zhang - 964-986 On global integer extrema of real-valued box-constrained multivariate quadratic functions
by Sascha Wörz
August 2017, Volume 34, Issue 2
- 331-342 Single-machine scheduling with production and rejection costs to minimize the maximum earliness
by Lingfa Lu & Liqi Zhang - 343-361 The Weight Function Lemma for graph pebbling
by Glenn Hurlbert - 362-377 Two-agent scheduling of time-dependent jobs
by Cheng He & Joseph Y.-T. Leung - 378-382 A note on (s, t)-relaxed L(2, 1)-labeling of graphs
by Taiyin Zhao & Guangmin Hu - 383-397 The adjacent vertex distinguishing total chromatic numbers of planar graphs with $$\Delta =10$$ Δ = 10
by Xiaohan Cheng & Guanghui Wang & Jianliang Wu - 398-413 Fibonacci helps to evacuate from a convex region in a grid network
by Lan Qin & Yinfeng Xu - 414-425 On the vertex cover $$P_3$$ P 3 problem parameterized by treewidth
by Jianhua Tu & Lidong Wu & Jing Yuan & Lei Cui - 426-432 Equitable vertex arboricity of 5-degenerate graphs
by Guantao Chen & Yuping Gao & Songling Shan & Guanghui Wang & Jianliang Wu - 433-440 Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
by Jinjiang Yuan - 441-452 Improved upper bound for the degenerate and star chromatic numbers of graphs
by Jiansheng Cai & Xueliang Li & Guiying Yan - 453-461 On the online multi-agent O–D k-Canadian Traveler Problem
by Davood Shiri & F. Sibel Salman - 462-482 Two efficient values of cooperative games with graph structure based on $$\tau $$ τ -values
by Guang Zhang & Erfang Shan & Liying Kang & Yanxia Dong - 483-503 Online scheduling to minimize the total weighted completion time plus the rejection cost
by Ran Ma & Jinjiang Yuan - 504-521 On Motzkin–Straus type results for non-uniform hypergraphs
by Qingsong Tang & Yuejian Peng & Xiangde Zhang & Cheng Zhao - 522-533 Fractional matching preclusion of graphs
by Yan Liu & Weiwei Liu - 534-544 Total edge irregularity strength of accordion graphs
by Muhammad Kamran Siddiqui & Deeba Afzal & Muhammad Ramzan Faisal - 545-553 Distance domination in graphs with given minimum and maximum degree
by Michael A. Henning & Nicolas Lichiardopol - 554-573 Recoverable robust spanning tree problem under interval uncertainty representations
by Mikita Hradovich & Adam Kasperski & Paweł Zieliński - 574-587 On maximum Wiener index of trees and graphs with given radius
by Kinkar Ch. Das & M. J. Nadjafi-Arani - 588-604 Triple-solution approach for the strip packing problem with two-staged patterns
by Yi-Ping Cui & Yongwu Zhou & Yaodong Cui - 605-611 A note on orientation and chromatic number of graphs
by Manouchehr Zaker - 612-630 Independent sets in some classes of $$S_{i, j, k}$$ S i , j , k -free graphs
by T. Karthick - 631-655 Task assignment in tree-like hierarchical structures
by Cem Evrendilek & Ismail Hakki Toroslu & Seyedsasan Hashemikhabir - 656-659 Matching and domination numbers in r-uniform hypergraphs
by Liying Kang & Shan Li & Yanxia Dong & Erfang Shan
July 2017, Volume 34, Issue 1
- 1-30 The k-metric dimension
by Ron Adar & Leah Epstein - 31-46 Lawler’s minmax cost problem under uncertainty
by Nadia Brauner & Gerd Finke & Yakov Shafransky - 47-63 Parameterized algorithms for min–max 2-cluster editing
by Li-Hsuan Chen & Bang Ye Wu - 64-70 Neighbor sum distinguishing total coloring of 2-degenerate graphs
by Jingjing Yao & Xiaowei Yu & Guanghui Wang & Changqing Xu - 71-93 An exact semidefinite programming approach for the max-mean dispersion problem
by Michele Garraffa & Federico Della Croce & Fabio Salassa - 94-113 On zero-sum $$\mathbb {Z}_{2j}^k$$ Z 2 j k -magic graphs
by J. P. Georges & D. Mauro & K. Wash - 114-132 Modified linear programming and class 0 bounds for graph pebbling
by Daniel W. Cranston & Luke Postle & Chenxiao Xue & Carl Yerger - 133-140 Minimizing the number of tardy jobs in two-machine settings with common due date
by Federico Della Croce & Christos Koulamas & Vincent T’kindt - 141-164 On minimally 2-connected graphs with generalized connectivity $$\kappa _{3}=2$$ κ 3 = 2
by Shasha Li & Wei Li & Yongtang Shi & Haina Sun - 165-173 Upper bounds of proper connection number of graphs
by Fei Huang & Xueliang Li & Shujing Wang - 174-181 Note on incidence chromatic number of subquartic graphs
by Petr Gregor & Borut Lužar & Roman Soták - 182-193 Rainbow connection numbers of Cayley graphs
by Yingbin Ma & Zaiping Lu - 194-202 The thickness of the complete multipartite graphs and the join of graphs
by Yichao Chen & Yan Yang - 203-217 A faster strongly polynomial time algorithm to solve the minimum cost tension problem
by Mehdi Ghiyasvand - 218-232 The minimum value of geometric-arithmetic index of graphs with minimum degree 2
by Mahdi Sohrabi-Haghighat & Mohammadreza Rostami - 233-244 Characterizations of k-cutwidth critical trees
by Zhen-Kun Zhang & Hong-Jian Lai - 245-256 Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
by Yingmo Jie & Cheng Guo & Zhangjie Fu - 257-265 Total coloring of planar graphs without adjacent chordal 6-cycles
by Huijuan Wang & Bin Liu & Xiaoli Wang & Guangmo Tong & Weili Wu & Hongwei Gao - 266-278 Approximation algorithms for k-level stochastic facility location problems
by Lucas P. Melo & Flávio K. Miyazawa & Lehilton L. C. Pedrosa & Rafael C. S. Schouery - 279-301 Maximizing target-temporal coverage of mission-driven camera sensor networks
by Yi Hong & Deying Li & Donghyun Kim & Wenping Chen & Jiguo Yu & Alade O. Tokuta - 302-313 Local ratio method on partial set multi-cover
by Yingli Ran & Yishuo Shi & Zhao Zhang - 314-329 Centralized and decentralized rumor blocking problems
by Xin Chen & Qingqin Nong & Yan Feng & Yongchang Cao & Suning Gong & Qizhi Fang & Ker-I Ko
May 2017, Volume 33, Issue 4
- 1145-1167 A lower bound for the adaptive two-echelon capacitated vehicle routing problem
by Liang Song & Hao Gu & Hejiao Huang - 1168-1182 Optimal RSUs deployment with delay bound along highways in VANET
by Chunyan Liu & Hejiao Huang & Hongwei Du - 1183-1225 A tighter insertion-based approximation of the crossing number
by Markus Chimani & Petr Hliněný - 1226-1256 Maximum flows in generalized processing networks
by Michael Holzhauser & Sven O. Krumke & Clemens Thielen - 1257-1265 Lambda number for the direct product of some family of graphs
by Byeong Moon Kim & Yoomi Rho & Byung Chul Song - 1266-1275 Paired-domination number of claw-free odd-regular graphs
by Wei Yang & Xinhui An & Baoyindureng Wu - 1276-1299 Optimal RSUs placement with delay bounded message dissemination in vehicular networks
by Chunyan Liu & Hejiao Huang & Hongwei Du & Xiaohua Jia - 1300-1323 Approximation of knapsack problems with conflict and forcing graphs
by Ulrich Pferschy & Joachim Schauer - 1324-1342 On the coefficients of the independence polynomial of graphs
by Shuchao Li & Lin Liu & Yueyu Wu - 1343-1353 Even factors of graphs
by Jian Cheng & Cun-Quan Zhang & Bao-Xuan Zhu - 1354-1364 Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
by Ying Bai & Xiangwen Li & Gexin Yu - 1365-1377 A new graph parameter and a construction of larger graph without increasing radio k-chromatic number
by Ushnish Sarkar & Avishek Adhikari - 1378-1394 Bounds for the traveling salesman paths of two-dimensional modular lattices
by Florian Pausinger - 1395-1410 A new effective branch-and-bound algorithm to the high order MIMO detection problem
by Ye Tian & Ke Li & Wei Yang & Zhiyong Li - 1411-1420 A new upper bound for the online square packing problem in a strip
by Guosong Yu & Yanling Mao & Jiaoliao Xiao - 1421-1442 On irreducible no-hole L(2, 1)-coloring of subdivision of graphs
by Nibedita Mandal & Pratima Panigrahi - 1443-1453 The (vertex-)monochromatic index of a graph
by Xueliang Li & Di Wu - 1454-1468 A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
by Baruch Mor & Gur Mosheiov - 1469-1491 The solution of a generalized secretary problem via analytic expressions
by Adam Woryna
April 2017, Volume 33, Issue 3
- 809-813 Polynomial-time approximation algorithms for the coloring problem in some cases
by D. S. Malyshev - 814-846 The triangle k-club problem
by Filipa D. Carvalho & Maria Teresa Almeida - 847-865 A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable
by Miao Zhang & Min Chen & Yiqiao Wang - 866-881 Total completion time minimization in online hierarchical scheduling of unit-size jobs
by Jueliang Hu & Yiwei Jiang & Ping Zhou & An Zhang & Qinghui Zhang - 882-896 Possible winner problems on partial tournaments: a parameterized study
by Yongjie Yang & Jiong Guo - 897-923 On the odd girth and the circular chromatic number of generalized Petersen graphs
by Amir Daneshgar & Meysam Madani - 924-933 Packing spanning trees and spanning 2-connected k-edge-connected essentially $$(2k-1)$$ ( 2 k - 1 ) -edge-connected subgraphs
by Xiaofeng Gu - 934-944 Scheduling with release times and rejection on two parallel machines
by Xueling Zhong & Zhangming Pan & Dakui Jiang - 945-955 Two-agent scheduling problems on a single-machine to minimize the total weighted late work
by Zhang Xingong & Wang Yong - 956-967 Construction independent spanning trees on locally twisted cubes in parallel
by Yu-Huei Chang & Jinn-Shyong Yang & Sun-Yuan Hsieh & Jou-Ming Chang & Yue-Li Wang - 968-976 A note on the annihilation number and 2-domination number of a tree
by Jeremy Lyle & Sean Patterson - 977-1010 The no-wait job shop with regular objective: a method based on optimal job insertion
by Reinhard Bürgy & Heinz Gröflin - 1011-1020 A new sufficient condition for a tree T to have the (2, 1)-total number $$\Delta +1$$ Δ + 1
by Qiaojun Shu & Weifan Wang & Yiqiao Wang - 1021-1029 Convex median and anti-median at prescribed distance
by K. Pravas & A. Vijayakumar - 1030-1056 Augmenting weighted graphs to establish directed point-to-point connectivity
by Mehdy Roayaei & Mohammadreza Razzazi - 1057-1089 Efficient reassembling of graphs, part 1: the linear case
by Assaf Kfoury & Saber Mirzaei - 1090-1105 Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
by Tao Wang - 1106-1121 On the minimum routing cost clustered tree problem
by Chen-Wan Lin & Bang Ye Wu - 1122-1143 Power load forecasting by wavelet least squares support vector machine with improved fruit fly optimization algorithm
by Niu Dongxiao & Ma Tiannan & Liu Bingyi
February 2017, Volume 33, Issue 2
- 365-372 Complexity properties of complementary prisms
by Marcio Antônio Duarte & Lucia Penso & Dieter Rautenbach & Uéverton Santos Souza - 373-388 An improved parameterized algorithm for the p-cluster vertex deletion problem
by Bang Ye Wu & Li-Hsuan Chen - 389-402 Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
by J. M. G. Salmerón & G. Aparicio & L. G. Casado & I. García & E. M. T. Hendrix & B. G.-Tóth - 403-421 Matching colored points with rectangles
by L. E. Caraballo & C. Ochoa & P. Pérez-Lantero & J. Rojas-Ledesma - 422-444 Maximum cardinality neighbourly sets in quadrilateral free graphs
by K. S. Neethi & Sanjeev Saxena - 445-472 Handling precedence constraints in scheduling problems by the sequence pair representation
by Andrzej Kozik - 473-495 An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
by Manzhan Gu & Xiwen Lu & Jinwei Gu - 496-529 A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis
by Aleck Johnsen & Ming-Yang Kao & Shinnosuke Seki - 530-542 Online bin packing problem with buffer and bounded size revisited
by Minghui Zhang & Xin Han & Yan Lan & Hing-Fung Ting - 543-550 Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
by Clément Charpentier & Sylvain Gravier & Thomas Lecorre - 551-566 A heuristic for the time constrained asymmetric linear sum assignment problem
by Peter Brown & Yuedong Yang & Yaoqi Zhou & Wayne Pullan - 567-579 A coordination mechanism for a scheduling game with parallel-batching machines
by Q. Q. Nong & G. Q. Fan & Q. Z. Fang - 580-589 More bounds for the Grundy number of graphs
by Zixing Tang & Baoyindureng Wu & Lin Hu & Manoucheher Zaker - 590-608 Online MapReduce scheduling problem of minimizing the makespan
by Cong Chen & Yinfeng Xu & Yuqing Zhu & Chengyu Sun - 609-625 On (s, t)-relaxed strong edge-coloring of graphs
by Dan He & Wensong Lin - 626-644 Resource constrained scheduling with general truncated job-dependent learning effect
by Hongyu He & Mengqi Liu & Ji-Bo Wang - 645-659 On nonlinear multi-covering problems
by Reuven Cohen & Mira Gonen & Asaf Levin & Shmuel Onn - 660-680 Anti-forcing spectra of perfect matchings of graphs
by Kai Deng & Heping Zhang - 681-712 Approximation algorithms for pricing with negative network externalities
by Zhigang Cao & Xujin Chen & Xiaodong Hu & Changjun Wang - 713-725 Roman game domination number of a graph
by A. Bahremandpour & S. M. Sheikholeslami & L. Volkmann - 726-741 Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks
by Amiyne Zakouni & Jiawei Luo & Fouad Kharroubi - 742-778 Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
by Rafael F. Santos & Alessandro Andrioni & Andre C. Drummond & Eduardo C. Xavier - 779-790 The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
by Lin Sun & Xiaohan Cheng & Jianliang Wu - 791-802 Approximation algorithm for partial positive influence problem in social network
by Yingli Ran & Zhao Zhang & Hongwei Du & Yuqing Zhu - 803-808 Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescence
by Zaixin Lu & Zhao Zhang & Weili Wu
January 2017, Volume 33, Issue 1
- 1-12 Anti-Ramsey coloring for matchings in complete bipartite graphs
by Zemin Jin & Yuping Zang - 13-27 On consecutive edge magic total labelings of connected bipartite graphs
by Bumtle Kang & Suh-Ryung Kim & Ji Yeon Park - 28-34 Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
by Xiao Wang & Baoyindureng Wu - 35-59 On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
by Vicky Mak-Hau - 60-80 Benders decomposition for set covering problems
by S. Haddadi - 81-105 Lower bounds for positive semidefinite zero forcing and their applications
by Boting Yang - 106-122 A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks
by Limin Wang & Wenxue Du & Zhao Zhang & Xiaoyan Zhang - 123-131 Erdős–Gallai-type results for colorful monochromatic connectivity of a graph
by Qingqiong Cai & Xueliang Li & Di Wu - 132-146 A novel approach for detecting multiple rumor sources in networks with partial observations
by Zhao Zhang & Wen Xu & Weili Wu & Ding-Zhu Du - 147-155 A linear-time algorithm for clique-coloring problem in circular-arc graphs
by Zuosong Liang & Erfang Shan & Yuzhong Zhang - 156-164 Coupon coloring of some special graphs
by Yongtang Shi & Meiqin Wei & Jun Yue & Yan Zhao - 165-182 Total weight choosability of Mycielski graphs
by Yunfang Tang & Xuding Zhu - 183-201 A computational approach to the multi-period many-to-one matching with ties
by Xinsheng Xiong & Yong Zhao & Yang Chen - 202-214 On the b-coloring of tight graphs
by Mekkia Kouider & Mohamed Zamime - 215-236 Almost separable matrices
by Matthew Aldridge & Leonardo Baldassini & Karen Gunderson - 237-253 Neighbor product distinguishing total colorings
by Tong Li & Cunquan Qu & Guanghui Wang & Xiaowei Yu - 254-264 Code for polyomino and computer search of isospectral polyominoes
by Xiaodong Liang & Rui Wang & Ji xiang Meng - 265-274 Total coloring of planar graphs without adjacent short cycles
by Huijuan Wang & Bin Liu & Yan Gu & Xin Zhang & Weili Wu & Hongwei Gao - 275-282 A solution to a conjecture on the generalized connectivity of graphs
by Lily Chen & Xueliang Li & Mengmeng Liu & Yaping Mao - 283-291 On the difference of two generalized connectivities of a graph
by Yuefang Sun & Xueliang Li - 292-316 Broadcasting on cactus graphs
by Maja Čevnik & Janez Žerovnik - 317-325 On (p, 1)-total labelling of planar graphs
by Lin Sun & Jian-Liang Wu - 326-332 Maximal independent sets in a generalisation of caterpillar graph
by K. S. Neethi & Sanjeev Saxena - 333-338 Graphs with multiplicative vertex-coloring 2-edge-weightings
by Joanna Skowronek-Kaziów - 339-364 Minimized-cost cube query on heterogeneous information networks
by Dan Yin & Hong Gao & Zhaonian Zou & Jianzhong Li
November 2016, Volume 32, Issue 4
- 983-984 Preface: Special issue on computing and combinatorics conference and wireless algorithms, systems, and applications conference
by Zhipeng Cai & Chaokun Wang & Anu Bourgeois - 985-1001 $$(\alpha , \tau )$$ ( α , τ ) -Monitoring for event detection in wireless sensor networks
by Ran Bi & Jianzhong Li & Hong Gao & Yingshu Li - 1002-1016 Approximate event detection over multi-modal sensing data
by Jing Gao & Jianzhong Li & Yingshu Li - 1017-1035 An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
by Chenchen Wu & Dachuan Xu & Donglei Du & Wenqing Xu - 1036-1051 On the performance of mildly greedy players in cut games
by Vittorio Bilò & Mauro Paladini - 1052-1067 An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models
by Cui Wang & Jiguo Yu & Dongxiao Yu & Baogui Huang & Shanshan Yu - 1068-1088 Efficient accuracy evaluation for multi-modal sensed data
by Yan Zhang & Hongzhi Wang & Hong Gao & Jianzhong Li - 1089-1106 Directed Steiner trees with diffusion costs
by Dimitri Watel & Marc-Antoine Weisser & Cédric Bentz & Dominique Barth - 1107-1132 Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results
by Tim Wylie & Michael A. Schuh & Rafal A. Angryk - 1133-1164 Approximate sorting of data streams with limited storage
by Farzad Farnoud & Eitan Yaakobi & Jehoshua Bruck - 1165-1181 Exemplar or matching: modeling DCJ problems with unequal content genome data
by Zhaoming Yin & Jijun Tang & Stephen W. Schaeffer & David A. Bader