Printed from https://ideas.repec.org/s/spr/jcomop6.html
Content
August 2018, Volume 36, Issue 2
- 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 - 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