Printed from https://ideas.repec.org/s/spr/jcomop9.html
Content
February 2015, Volume 29, Issue 2
- 433-450 A tolerance-based heuristic approach for the weighted independent set problem
by B. I. Goldengorin & D. S. Malyshev & P. M. Pardalos & V. A. Zamaraev - 451-471 Embedding signed graphs in the line
by Eduardo G. Pardo & Mauricio Soto & Christopher Thraves - 472-487 On the complexity of connectivity in cognitive radio networks through spectrum assignment
by Hongyu Liang & Tiancheng Lou & Haisheng Tan & Yuexuan Wang & Dongxiao Yu - 488-501 Algorithms and complexity results for labeled correlation clustering problem
by Xianmin Liu & Jianzhong Li - 502-510 Nordhaus–Gaddum-type results for path covering and $$L(2,1)$$ -labeling numbers
by Damei Lü & Juan Du & Nianfeng Lin & Ke Zhang & Dan Yi
January 2015, Volume 29, Issue 1
- 1-15 Parametric power supply networks
by Shiho Morishita & Takao Nishizeki - 16-35 DVS scheduling in a line or a star network of processors
by Zongxu Mu & Minming Li - 36-52 A combination of flow shop scheduling and the shortest path problem
by Kameng Nip & Zhenbo Wang & Fabrice Talla Nobibon & Roel Leus - 53-66 An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
by Chenchen Wu & Donglei Du & Dachuan Xu - 67-87 Improved lower bounds for the online bin packing problem with cardinality constraints
by Hiroshi Fujiwara & Koji Kobayashi - 88-124 Computing the shortest reset words of synchronizing automata
by Andrzej Kisielewicz & Jakub Kowalski & Marek Szykuła - 125-140 Randomized parameterized algorithms for $$P_2$$ P 2 -Packing and Co-Path Packing problems
by Qilong Feng & Jianxin Wang & Shaohua Li & Jianer Chen - 141-152 Covering tree with stars
by Jan Baumbach & Jiong Guo & Rashid Ibragimov - 153-164 Improved approximation algorithms for computing $$k$$ k disjoint paths subject to two constraints
by Longkun Guo & Hong Shen & Kewen Liao - 165-181 On the sequential price of anarchy of isolation games
by Anna Angelucci & Vittorio Bilò & Michele Flammini & Luca Moscardelli - 182-196 New bounds for the balloon popping problem
by Davide Bilò & Vittorio Bilò - 197-215 Packing cubes into a cube is NP-complete in the strong sense
by Yiping Lu & Danny Z. Chen & Jianzhong Cha - 216-227 Complexity analysis and algorithms for the Program Download Problem
by Chao Peng & Jie Zhou & Binhai Zhu & Hong Zhu - 228-236 Online unbounded batch scheduling on parallel machines with delivery times
by Peihai Liu & Xiwen Lu - 237-246 Improved local search for universal facility location
by Eric Angel & Nguyen Kim Thang & Damien Regnault - 247-256 Tractable connected domination for restricted bipartite graphs
by Tian Liu & Zhao Lu & Ke Xu - 257-275 An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
by Yunlong Liu & Jianxin Wang & Chao Xu & Jiong Guo & Jianer Chen - 276-307 The $$k$$ k -separator problem: polyhedra, complexity and approximation results
by Walid Ben-Ameur & Mohamed-Ahmed Mohamed-Sidi & José Neto - 308-329 A structural transformation from p- $$\pi $$ π to MSVL
by Ling Luo & Zhenhua Duan & Cong Tian & Xiaobing Wang
November 2014, Volume 28, Issue 4
- 717-725 Lower bounds for independence numbers of some locally sparse graphs
by Yusheng Li & Qizhong Lin - 726-747 Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
by Asaf Levin & Uri Yovel - 748-755 2-Rainbow domination number of Cartesian products: $$C_{n}\square C_{3}$$ and $$C_{n}\square C_{5}$$
by Zofia Stępień & Maciej Zwierzchowski - 756-773 Strategyproof mechanism design for facility location games with weighted agents on a line
by Qiang Zhang & Minming Li - 774-786 Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$ -colorable
by Lingji Xu & Zhengke Miao & Yingqian Wang - 787-799 $$\lambda $$ -numbers of several classes of snarks
by Dengju Ma & Hengfeng Zhu & Jianbao He - 800-813 Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
by Hsing-Yen Ann & Chang-Biau Yang & Chiou-Ting Tseng - 814-826 On metric dimension of permutation graphs
by Michael Hallaway & Cong X. Kang & Eunjeong Yi - 827-836 2-Distance paired-dominating number of graphs
by Kan Yu & Mei Lu - 837-853 Algorithms for the minimum diameter terminal Steiner tree problem
by Wei Ding & Ke Qiu - 854-874 An upper bound of Heilbronn number for eight points in triangles
by Liangyu Chen & Zhenbing Zeng & Wei Zhou - 875-892 Online scheduling with rejection and reordering: exact algorithms for unit size jobs
by Leah Epstein & Hanan Zebedat-Haider - 893-909 Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
by Chengchao Yan & Danjun Huang & Dong Chen & Weifan Wang - 910-916 Approximation algorithms on 0–1 linear knapsack problem with a single continuous variable
by Chenxia Zhao & Xianyue Li
October 2014, Volume 28, Issue 3
- 511-512 Preface
by M. T. Thai & T. N. Dinh - 513-528 A nature-inspired influence propagation model for the community expansion problem
by Yuanjun Bi & Weili Wu & Yuqing Zhu & Lidan Fan & Ailian Wang - 529-539 An individual-based model of information diffusion combining friends’ influence
by Lidan Fan & Zaixin Lu & Weili Wu & Yuanjun Bi & Ailian Wang & Bhavani Thuraisingham - 540-560 On the radius of centrality in evolving communication networks
by Danica Vukadinović Greetham & Zhivko Stoyanov & Peter Grindrod - 561-576 Neighborhood-based uncertainty generation in social networks
by Meng Han & Mingyuan Yan & Jinbao Li & Shouling Ji & Yingshu Li - 577-587 Computing an effective decision making group of a society using social network analysis
by Donghyun Kim & Deying Li & Omid Asgari & Yingshu Li & Alade O. Tokuta & Heekuck Oh - 588-599 Improvement of path analysis algorithm in social networks based on HBase
by Yan Qiang & Bo Pei & Weili Wu & Juanjuan Zhao & Xiaolong Zhang & Yue Li & Lidong Wu - 600-612 Noise-tolerance community detection and evolution in dynamic social networks
by Li Wang & Jiang Wang & Yuanjun Bi & Weili Wu & Wen Xu & Biao Lian - 613-625 A short-term trend prediction model of topic over Sina Weibo dataset
by Juanjuan Zhao & Weili Wu & Xiaolong Zhang & Yan Qiang & Tao Liu & Lidong Wu - 626-638 Notes on $$L(1,1)$$ and $$L(2,1)$$ labelings for $$n$$ -cube
by Haiying Zhou & Wai Chee Shiu & Peter Che Bor Lam - 639-654 Approximability of the subset sum reconfiguration problem
by Takehiro Ito & Erik D. Demaine - 655-673 Best routes selection in multimodal networks using multi-objective genetic algorithm
by Guiwu Xiong & Yong Wang - 674-691 Efficient algorithms for the max $$k$$ -vertex cover problem
by Federico Della Croce & Vangelis Th. Paschos - 692-715 Acyclic edge coloring of planar graphs without a $$3$$ 3 -cycle adjacent to a $$6$$ 6 -cycle
by Yiqiao Wang & Qiaojun Shu & Jian-Liang Wu & Wenwen Zhang
August 2014, Volume 28, Issue 2
- 321-340 Heterochromatic tree partition number in complete multipartite graphs
by Zemin Jin & Peipei Zhu - 341-347 Linear algebraic approach to an edge-coloring result
by Martin Kochol - 348-357 On colour-blind distinguishing colour pallets in regular graphs
by Jakub Przybyło - 358-375 Mobile facility location: combinatorial filtering via weighted occupancy
by Amitai Armon & Iftah Gamzu & Danny Segev - 376-399 A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
by Alain Billionnet & Sourour Elloumi & Amélie Lambert - 400-413 $$F_{3}$$ -domination problem of graphs
by Chan-Wei Chang & David Kuo & Sheng-Chyang Liaw & Jing-Ho Yan - 414-446 A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority
by S. F. Ghannadpour & S. Noori & R. Tavakkoli-Moghaddam - 447-461 Realizations of the game domination number
by Gašper Košmrlj - 462-479 Coloring vertices of claw-free graphs in three colors
by Vadim Lozin & Christopher Purcell - 480-495 Online graph exploration algorithms for cycles and trees by multiple searchers
by Yuya Higashikawa & Naoki Katoh & Stefan Langerman & Shin-ichi Tanigawa - 496-504 Approximating soft-capacitated facility location problem with uncertainty
by Shuxin Cai & Wenguo Yang & Yaohua Tang - 505-510 Graphs with small balanced decomposition numbers
by Hsiang-Chun Hsu & Gerard Jennhwa Chang
July 2014, Volume 28, Issue 1
- 1-2 Preface
by Sergiy Butenko & Ding-Zhu Du & Mauricio G. C. Resende - 3-24 Bound and exact methods for assessing link vulnerability in complex networks
by T. N. Dinh & M. T. Thai & H. T. Nguyen - 25-37 Recognition of overlap graphs
by Theodoros P. Gevezes & Leonidas S. Pitsoulis - 38-57 Multi-depot vessel routing problem in a direction dependent wavefield
by Michael J. Hirsch & Daniel E. Schroeder & Alvaro Maggiar & Irina S. Dolinskaya - 58-81 The unconstrained binary quadratic programming problem: a survey
by Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang - 82-104 Mathematical programming: Turing completeness and applications to software analysis
by Leo Liberti & Fabrizio Marinelli - 105-120 An exact algorithm for the maximum probabilistic clique problem
by Zhuqi Miao & Balabhaskar Balasundaram & Eduardo L. Pasiliao - 121-139 Characteristics of the maximal independent set ZDD
by David R. Morrison & Edward C. Sewell & Sheldon H. Jacobson - 140-166 A hybrid biased random key genetic algorithm approach for the unit commitment problem
by L. A. C. Roque & D. B. M. M. Fontes & F. A. C. C. Fontes - 167-185 On risk-averse maximum weighted subgraph problems
by Maciej Rysz & Mohammad Mirghorbani & Pavlo Krokhmal & Eduardo L. Pasiliao - 186-217 Staying safe and visible via message sharing in online social networks
by Yilin Shen & Thang N. Dinh & My T. Thai & Hien T. Nguyen - 218-232 Value-at-risk support vector machine: stability to outliers
by Peter Tsyurmasto & Michael Zabarankin & Stan Uryasev - 233-273 An integer programming framework for critical elements detection in graphs
by Alexander Veremyev & Oleg A. Prokopyev & Eduardo L. Pasiliao - 274-287 Minimum number of disjoint linear forests covering a planar graph
by Huijuan Wang & Lidong Wu & Weili Wu & Jianliang Wu - 288-309 Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
by Tao Zhang & W. Art Chaovalitwongse & Yuejie Zhang - 310-319 A greedy algorithm for the fault-tolerant connected dominating set in a general graph
by Jiao Zhou & Zhao Zhang & Weili Wu & Kai Xing
May 2014, Volume 27, Issue 4
- 621-642 A lower bound of the surviving rate of a planar graph with girth at least seven
by Weifan Wang & Stephen Finbow & Ping Wang - 643-662 Hardness results and approximation algorithm for total liar’s domination in graphs
by B. S. Panda & S. Paul - 663-678 A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design
by Peng Zhang - 679-687 Bandwidth sums of block graphs and cacti
by Gerard Jennhwa Chang & Ma-Lian Chia & David Kuo & Ji-Yin Lin & Jing-Ho Yan - 688-694 Paired versus double domination in K 1,r -free graphs
by Paul Dorbec & Bert Hartnell & Michael A. Henning - 695-710 Multiple L(j,1)-labeling of the triangular lattice
by Pu Zhang & Wensong Lin - 711-723 Algorithms with limited number of preemptions for scheduling on parallel machines
by Yiwei Jiang & Zewei Weng & Jueliang Hu - 724-766 Linear time-dependent constraints programming with MSVL
by Qian Ma & Zhenhua Duan - 767-777 The cost of selfishness for maximizing the minimum load on uniformly related machines
by Leah Epstein & Elena Kleiman & Rob Stee - 778-797 An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
by Shihyen Chen & Kaizhong Zhang - 798-807 Faster algorithm to find anti-risk path between two nodes of an undirected graph
by Jay Mahadeokar & Sanjeev Saxena - 808-823 Solving the Multidimensional Assignment Problem by a Cross-Entropy method
by Duc Manh Nguyen & Hoai An Le Thi & Tao Pham Dinh
April 2014, Volume 27, Issue 3
- 417-439 On the performance of Scatter Search for post-enrolment course timetabling problems
by Ghaith Jaradat & Masri Ayob & Zulkifli Ahmad - 440-450 Star list chromatic number of planar subcubic graphs
by Min Chen & André Raspaud & Weifan Wang - 451-461 On the total outer-connected domination in graphs
by O. Favaron & H. Karami & S. M. Sheikholeslami - 462-486 Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
by Grigory Pastukhov & Alexander Veremyev & Vladimir Boginski & Eduardo L. Pasiliao - 487-503 On the approximability of positive influence dominating set in social networks
by Thang N. Dinh & Yilin Shen & Dung T. Nguyen & My T. Thai - 504-518 An approximation algorithm for k-center problem on a convex polygon
by Hai Du & Yinfeng Xu - 519-529 Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles
by Yingqian Wang & Ping Sheng - 530-540 The Pfaffian property of Cartesian products of graphs
by Fuliang Lu & Lianzhu Zhang - 541-544 A simple Byzantine Generals protocol
by Junxing Wang - 545-556 A two-stage approach for surgery scheduling
by Liwei Zhong & Shoucheng Luo & Lidong Wu & Lin Xu & Jinghui Yang & Guochun Tang - 557-566 On minimum balanced bipartitions of triangle-free graphs
by Haiyan Li & Yanting Liang & Muhuo Liu & Baogang Xu - 567-573 Are there more almost separable partitions than separable partitions?
by Fei-Huang Chang & Hong-Bin Chen & Frank K. Hwang - 574-596 Popularity at minimum cost
by Telikepalli Kavitha & Meghana Nasre & Prajakta Nimbhorkar - 597-608 Order consolidation for hierarchical product lines
by Woo-Lahm Kwak & Soo Y. Chang - 609-620 A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties
by Yu Li & Donglei Du & Naihua Xiu & Dachuan Xu
February 2014, Volume 27, Issue 2
- 209-220 Efficient identifications of structural similarities for graphs
by Zheng Fang & Jie Wang - 221-240 An improved distributed data aggregation scheduling in wireless sensor networks
by Deying Li & Qinghua Zhu & Hongwei Du & Jianzhong Li - 241-255 Signed Roman domination in graphs
by H. Abdollahzadeh Ahangar & Michael A. Henning & Christian Löwenstein & Yancai Zhao & Vladimir Samodivkin - 256-270 A study of search algorithms’ optimization speed
by Andrea Valsecchi & Leonardo Vanneschi & Giancarlo Mauri - 271-291 Sharp bounds of the Zagreb indices of k-trees
by John Estes & Bing Wei - 292-301 Generalized perfect domination in graphs
by B. Chaluvaraju & K. A. Vidya - 302-314 An efficient FPRAS type group testing procedure to approximate the number of defectives
by Yongxi Cheng & Yinfeng Xu - 315-327 Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
by Zi Xu & Donglei Du & Dachuan Xu - 328-344 On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
by Tzu-Liang Kung & Cheng-Kuan Lin & Lih-Hsing Hsu - 345-354 Boundary graph classes for some maximum induced subgraph problems
by Dmitriy S. Malyshev - 355-368 Circular L(j,k)-labeling number of direct product of path and cycle
by Qiong Wu & Wai Chee Shiu & Pak Kiu Sun - 369-378 Total and paired domination numbers of toroidal meshes
by Fu-Tao Hu & Jun-Ming Xu - 379-396 The adjacent vertex distinguishing total coloring of planar graphs
by Weifan Wang & Danjun Huang - 397-416 Improvements to MCS algorithm for the maximum clique problem
by Mikhail Batsyn & Boris Goldengorin & Evgeny Maslov & Panos M. Pardalos
January 2014, Volume 27, Issue 1
- 1-2 Preface
by Guohui Lin - 3-13 Radiation hybrid map construction problem parameterized
by Chihao Zhang & Haitao Jiang & Binhai Zhu - 14-31 Algorithms for local similarity between forests
by Zhewei Liang & Kaizhong Zhang - 32-48 Minimum diameter cost-constrained Steiner trees
by Wei Ding & Guoliang Xue - 49-64 The edge-centered surface area of the arrangement graph
by Eddie Cheng & Ke Qiu & Zhizhang Shen - 65-77 On the generalized multiway cut in trees problem
by Hong Liu & Peng Zhang - 78-87 On certain geometric properties of the Yao–Yao graphs
by Iyad A. Kanj & Ge Xia - 88-99 Distance- $$d$$ independent set problems for bipartite and chordal graphs
by Hiroshi Eto & Fengrui Guo & Eiji Miyano - 100-114 Online bottleneck matching
by Barbara M. Anthony & Christine Chung - 115-131 On-line bin packing with restricted repacking
by János Balogh & József Békési & Gábor Galambos & Gerhard Reinelt - 132-143 Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
by Marthe Bonamy & Matthew Johnson & Ioannis Lignos & Viresh Patel & Daniël Paulusma - 144-151 The domination number of Cartesian product of two directed paths
by Michel Mollard - 152-163 The subdivision-constrained routing requests problem
by Jianping Li & Weidong Li & Junran Lichen - 164-181 Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
by Elisabeth Günther & Felix G. König & Nicole Megow - 182-198 Competitive analysis for make-to-order scheduling with reliable lead time quotation
by Feifeng Zheng & E. Zhang & Yinfeng Xu & Wei-Chiang Hong - 199-208 Spanning 3-connected index of graphs
by Wei Xiong & Zhao Zhang & Hong-Jian Lai
November 2013, Volume 26, Issue 4
- 621-635 The topology aware file distribution problem
by Shawn T. O’Neil & Amitabh Chaudhary & Danny Z. Chen & Haitao Wang - 636-654 Property testing for cyclic groups and beyond
by François Le Gall & Yuichi Yoshida - 655-669 Optimal strategies for the one-round discrete Voronoi game on a line
by Aritra Banik & Bhaswar B. Bhattacharya & Sandip Das - 670-686 Unavoidable regularities in long words with bounded number of symbol occurrences
by Juha Kortelainen & Tuomas Kortelainen & Ari Vesanen - 687-708 (1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation
by Yuichi Asahiro & Kenta Kanmera & Eiji Miyano - 709-722 Finding paths with minimum shared edges
by Masoud T. Omran & Jörg-Rüdiger Sack & Hamid Zarrabi-Zadeh - 723-754 The density maximization problem in graphs
by Mong-Jen Kao & Bastian Katz & Marcus Krug & D. T. Lee & Ignaz Rutter & Dorothea Wagner - 755-769 Flipping triangles and rectangles
by Minghui Jiang - 770-785 Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
by B. S. Panda & D. Pradhan - 786-798 On the cores of games arising from integer edge covering functions of graphs
by Boram Park & Suh-Ryung Kim & Hye Kyung Kim - 799-810 A new three-machine shop scheduling: complexity and approximation algorithm
by Jianming Dong & Yong Chen & An Zhang & Qifan Yang - 811-818 A note on anti-coordination and social interactions
by Zhigang Cao & Xiaoguang Yang - 819-831 L(d,1)-labelings of the edge-path-replacement of a graph
by Damei Lü & Nianfeng Lin - 832-859 Largest area convex hull of imprecise data based on axis-aligned squares
by Wenqi Ju & Jun Luo & Binhai Zhu & Ovidiu Daescu
October 2013, Volume 26, Issue 3
- 415-415 Preface
by Guangting Chen & Guohui Lin & Zhiyi Tan - 416-436 Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations
by Gyorgy Dosa & Zsolt Tuza & Deshi Ye - 437-447 Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration
by Min Ji & Chou-Jung Hsu & Dar-Li Yang - 448-464 Semi-online scheduling for jobs with release times
by Rongheng Li & Liying Yang & Xiaoqiong He & Qiang Chen & Xiayan Cheng - 465-471 On the mod sum number of H m,n
by Wenqing Dou - 472-479 Semi-online scheduling on two identical machines with rejection
by Xiao Min & Yuqing Wang & Jing Liu & Min Jiang - 480-488 Online LPT algorithms for parallel machines scheduling with a single server
by Chunjie Su - 489-498 Single machine scheduling problems with subcontracting options
by Weiya Zhong & Zhiming Huo - 499-508 Relay node placement in two-tiered wireless sensor networks with base stations
by Guangting Chen & Suhui Cui - 509-519 Minimizing the maximum bump cost in linear extensions of a poset
by Biao Wu & Longcheng Liu & Enyu Yao - 520-554 Algorithms for the maximum k-club problem in graphs
by Shahram Shahinpour & Sergiy Butenko - 555-567 Applications of extension grey prediction model for power system forecasting
by Wei Niu & Juan Cheng & Guoqing Wang - 568-584 A bilevel programming problem with maximization of a supermodular function in the lower level
by Diana Fanghänel - 585-591 Minimum degree, edge-connectivity and radius
by Baoyindureng Wu & Xinhui An & Guojie Liu & Guiying Yan & Xiaoping Liu - 592-607 Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
by Bang Ye Wu - 608-619 Roman domination on strongly chordal graphs
by Chun-Hung Liu & Gerard J. Chang
August 2013, Volume 26, Issue 2
- 223-236 Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
by Yong Zhang & Francis Y. L. Chin & Hing-Fung Ting & Xin Han - 237-250 Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
by Martin Birks & Daniel Cole & Stanley P. Y. Fung & Huichao Xue - 251-265 The k-Canadian Travelers Problem with communication
by Huili Zhang & Yinfeng Xu & Lan Qin - 266-283 On some geometric problems of color-spanning sets
by Wenqi Ju & Chenglin Fan & Jun Luo & Binhai Zhu & Ovidiu Daescu - 284-291 Approximation algorithm for uniform bounded facility location problem
by Weng Kerui - 292-309 Tight approximation bounds for combinatorial frugal coverage algorithms
by Ioannis Caragiannis & Christos Kaklamanis & Maria Kyropoulou - 310-332 The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
by Franz J. Brandenburg & Andreas Gleißner & Andreas Hofmeier - 333-344 A tight analysis of Brown-Baker-Katseff sequences for online strip packing
by W. Kern & J. J. Paulus - 345-371 Optimal job insertion in the no-wait job shop
by Reinhard Bürgy & Heinz Gröflin - 372-384 Objective functions with redundant domains
by Fatima Affif Chaouche & Carrie Rutherford & Robin Whitty - 385-392 L(2,1)-labelings of the edge-path-replacement of a graph
by Lü Damei - 393-411 Super-cyclically edge-connected regular graphs
by Jin-Xin Zhou & Yan-Quan Feng - 412-414 Erratum to: Tight bound for matching
by Yijie Han
July 2013, Volume 26, Issue 1
- 1-9 The three-dimensional matching problem in Kalmanson matrices
by Sergey Polyakovskiy & Frits C. R. Spieksma & Gerhard J. Woeginger - 10-18 On the outer-connected domination in graphs
by M. H. Akhbari & R. Hasni & O. Favaron & H. Karami & S. M. Sheikholeslami - 19-43 Parameterized complexity of k-anonymity: hardness and tractability
by Paola Bonizzoni & Gianluca Della Vedova & Riccardo Dondi & Yuri Pirola - 44-70 Optimal key tree structure for two-user replacement and deletion problems
by Weiwei Wu & Minming Li & Enhong Chen - 71-81 Maximum latency scheduling problem on two-person cooperative games
by Yanhong Gu & Jing Fan & Guochun Tang & Jiaofei Zhong - 82-85 On the union of intermediate nodes of shortest paths
by Xiang Li & Xiaodong Hu & Wonjun Lee - 86-108 An adaptive multistart tabu search approach to solve the maximum clique problem
by Qinghua Wu & Jin-Kao Hao - 109-119 The maximum flow problem with disjunctive constraints
by Ulrich Pferschy & Joachim Schauer - 120-126 Independent dominating sets in regular graphs
by Julie Haviland - 127-134 Approximate min-max relations on plane graphs
by Jie Ma & Xingxing Yu & Wenan Zang - 135-151 Embeddings of circulant networks
by Indra Rajasingh & Paul Manuel & M. Arockiaraj & Bharati Rajan - 152-160 Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
by Hervé Hocquard & Mickaël Montassier - 161-177 Practical unicast and convergecast scheduling schemes for cognitive radio networks
by Shouling Ji & Arif Selcuk Uluagac & Raheem Beyah & Zhipeng Cai - 178-189 Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
by Cristina Bazgan & Sonia Toubaline & Daniel Vanderpooten - 190-197 Metric dimension of some distance-regular graphs
by Jun Guo & Kaishun Wang & Fenggao Li - 198-222 On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
by Shlomo Karhi & Dvir Shabtay
May 2013, Volume 25, Issue 4
- 499-500 Preface: optimization in graphs
by D. J. Guan & Ko-Wei Lih & Xuding Zhu - 501-504 Equivalence of two conjectures on equitable coloring of graphs
by Bor-Liang Chen & Ko-Wei Lih & Chih-Hung Yen