Printed from https://ideas.repec.org/s/spr/jcomop11.html
Content
January 2011, Volume 21, Issue 1
- 83-107 Average-case competitive analyses for one-way trading
by Hiroshi Fujiwara & Kazuo Iwama & Yoshiyuki Sekiguchi - 108-123 A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints
by Hung Q. Ngo & Anh Le & Yang Wang - 124-137 The orbit problem is in the GapL hierarchy
by V. Arvind & T. C. Vijayaraghavan - 138-149 Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
by Ming Liu & Chengbin Chu & Yinfeng Xu & Feifeng Zheng
November 2010, Volume 20, Issue 4
- 325-334 Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2
by Zengti Li & Suogang Gao & Hongjie Du & Feng Zou & Weili Wu - 335-360 Separator-based data reduction for signed graph balancing
by Falk Hüffner & Nadja Betzler & Rolf Niedermeier - 361-368 An approximation algorithm for the k-level capacitated facility location problem
by Donglei Du & Xing Wang & Dachuan Xu - 369-384 Semi-online scheduling with known maximum job size on two uniform machines
by Qian Cao & Zhaohui Liu - 385-398 Strong formulation for the spot 5 daily photograph scheduling problem
by Glaydston Mattos Ribeiro & Miguel Fragoso Constantino & Luiz Antonio Nogueira Lorena - 399-412 Polynomial time approximation schemes for minimum disk cover problems
by Chen Liao & Shiyan Hu - 413-421 Constructing error-correcting pooling designs with symplectic space
by Jun Guo & Yuexuan Wang & Suogang Gao & Jiangchen Yu & Weili Wu - 422-428 A polynomially solvable case of optimal linear extension problem of a poset
by Biao Wu & Enyu Yao & Longcheng Liu - 429-442 On the max-weight edge coloring problem
by Giorgio Lucarelli & Ioannis Milis & Vangelis T. Paschos
October 2010, Volume 20, Issue 3
- 205-223 An upper bound on the total restrained domination number of a tree
by Johannes H. Hattingh & Elizabeth Jonck & Ernst J. Joubert - 224-248 Embedded paths and cycles in faulty hypercubes
by Nelson Castañeda & Ivan S. Gotchev - 249-258 Hardness of k-Vertex-Connected Subgraph Augmentation Problem
by Changcun Ma & Donghyun Kim & Yuexuan Wang & Wei Wang & Nassim Sohaee & Weili Wu - 259-284 Cost sharing and strategyproof mechanisms for set cover games
by Xiang-Yang Li & Zheng Sun & Weizhao Wang & Wei Lou - 285-306 On-line machine scheduling with batch setups
by Lele Zhang & Andrew Wirth - 307-320 Incremental Facility Location Problem and Its Competitive Algorithms
by Wenqiang Dai & Xianju Zeng - 321-323 A short proof of a result on a Vizing-like problem for integer total domination
by Michael A. Henning
August 2010, Volume 20, Issue 2
- 101-130 A hybrid beam search looking-ahead algorithm for the circular packing problem
by Hakim Akeb & Mhand Hifi - 131-141 The p-maxian problem on block graphs
by Liying Kang & Yukun Cheng - 142-160 The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
by Geng-Sheng Zhang & Yu-Qin Yang - 161-179 Online scheduling with a buffer on related machines
by György Dósa & Leah Epstein - 180-193 Algorithms and time complexity of the request-service problem
by Chunmei Liu & Legand Burge & Ajoni Blake - 194-204 Well paired-dominated graphs
by S. L. Fitzpatrick & B. L. Hartnell
July 2010, Volume 20, Issue 1
- 1-26 Finding checkerboard patterns via fractional 0–1 programming
by Andrew Trapp & Oleg A. Prokopyev & Stanislav Busygin - 27-46 Median problems with positive and negative weights on cycles and cacti
by Rainer E. Burkard & Johannes Hatzl - 47-62 EiSIRS: a formal model to analyze the dynamics of worm propagation in wireless sensor networks
by Xiaoming Wang & Qiaoliang Li & Yingshu Li - 63-75 Periodic complementary binary sequences and Combinatorial Optimization algorithms
by I. S. Kotsireas & C. Koukouvinos & P. M. Pardalos & O. V. Shylo - 76-84 On the total domination subdivision number in some classes of graphs
by O. Favaron & H. Karami & R. Khoeilar & S. M. Sheikholeslami - 85-95 A note on hierarchical scheduling on two uniform machines
by Zhiyi Tan & An Zhang - 96-100 New error-correcting pooling designs associated with finite vector spaces
by Jizhu Nan & Jun Guo
May 2010, Volume 19, Issue 4
- 429-456 Domination in graphs with bounded propagation: algorithms, formulations and hardness results
by Ashkan Aazami - 457-470 Labelling algorithms for paired-domination problems in block and interval graphs
by Lei Chen & Changhong Lu & Zhenbing Zeng - 471-485 Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
by Weifan Wang & Yiqiao Wang - 486-491 A class of error-correcting pooling designs over complexes
by Tayuan Huang & Kaishun Wang & Chih-Wen Weng - 492-500 Pooling designs associated with unitary space and ratio efficiency comparison
by Jun Guo - 501-530 Unconditional secure communication: a Russian Cards protocol
by Zhenhua Duan & Chen Yang
April 2010, Volume 19, Issue 3
- 241-257 A Lagrangian bound for many-to-many assignment problems
by Igor Litvinchev & Socorro Rangel & Jania Saucedo - 258-278 The price of atomic selfish ring routing
by Bo Chen & Xujin Chen & Xiaodong Hu - 279-303 Keeping partners together: algorithmic results for the hospitals/residents problem with couples
by Eric J. McDermid & David F. Manlove - 304-324 Algorithms for storage allocation based on client preferences
by Tami Tamir & Benny Vaksendiser - 325-346 Scheduling internal audit activities: a stochastic combinatorial optimization problem
by Roberto Rossi & S. Armagan Tarim & Brahim Hnich & Steven Prestwich & Semra Karacaer - 347-368 Just-in-time scheduling with controllable processing times on parallel machines
by Yaron Leyvand & Dvir Shabtay & George Steiner & Liron Yedidsion - 369-393 A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
by Diana Fanghänel & Frauke Liers - 394-414 An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
by T. Gomes & J. Craveirinha & L. Jorge - 415-427 Galaxy cutsets in graphs
by Nicolas Sonnerat & Adrian Vetta
February 2010, Volume 19, Issue 2
- 123-133 Adjacent vertex distinguishing total colorings of outerplanar graphs
by Yiqiao Wang & Weifan Wang - 134-157 A quadratic lower bound for Rocchio’s similarity-based relevance feedback algorithm with a fixed query updating factor
by Zhixiang Chen & Bin Fu & John Abraham - 158-173 Bayesian coverage optimization models
by James J. Cochran & Martin S. Levy & Jeffrey D. Camm - 174-183 On dual power assignment optimization for biconnectivity
by Chen Wang & James Willson & Myung-Ah Park & Andras Farago & Weili Wu - 184-199 Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence
by Andrzej Dudek & Joanna Polcyn & Andrzej Ruciński - 200-216 Complexity analysis for maximum flow problems with arc reversals
by Steffen Rebennack & Ashwin Arulselvan & Lily Elefteriadou & Panos M. Pardalos - 217-240 A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops
by Lan Liu & Tao Jiang
January 2010, Volume 19, Issue 1
- 1-15 Lexicographically minimizing axial motions for the Euclidean TSP
by Francis Sourd - 16-30 Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
by Sun-Yuan Hsieh & Chang-Yu Wu - 31-42 An almost four-approximation algorithm for maximum weight triangulation
by Shiyan Hu - 43-59 Capacity inverse minimum cost flow problem
by Çiğdem Güler & Horst W. Hamacher - 60-68 Total restrained domination in claw-free graphs
by Hongxing Jiang & Liying Kang - 69-83 A tighter formulation of the p-median problem
by Sourour Elloumi - 84-93 Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
by Shisheng Li & Jinjiang Yuan - 94-106 Linear time construction of 5-phylogenetic roots for tree chordal graphs
by William S. Kennedy & Hui Kong & Guohui Lin & Guiying Yan - 107-122 Worst-case analysis for on-line service policies
by Zhenbo Wang & Wenxun Xing
November 2009, Volume 18, Issue 4
- 319-341 A parameterized perspective on packing paths of length two
by Henning Fernau & Daniel Raible - 342-349 Node-weighted Steiner tree approximation in unit disk graphs
by Feng Zou & Xianyue Li & Suogang Gao & Weili Wu - 350-361 The robot cleans up
by M. E. Messinger & R. J. Nowakowski - 362-375 Fixed-parameter tractability of anonymizing data by suppressing entries
by Patricia A. Evans & H. Todd Wareham & Rhonda Chaytor - 376-392 New algorithms for k-center and extensions
by René Brandenberg & Lucia Roth - 393-416 Separating sublinear time computations by approximate diameter
by Bin Fu & Zhiyu Zhao - 417-428 Edge-colouring of joins of regular graphs, I
by Caterina De Simone & Anna Galluccio
October 2009, Volume 18, Issue 3
- 207-228 Fibonacci index and stability number of graphs: a polyhedral study
by Véronique Bruyère & Hadrien Mélot - 229-257 Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
by Serafino Cicerone & Gianlorenzo D’Angelo & Gabriele Stefano & Daniele Frigioni & Alfredo Navarra - 258-271 A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
by Hyunwoo Jung & Mohammad Khairul Hasan & Kyung-Yong Chwa - 272-293 Flows with unit path capacities and related packing and covering problems
by Maren Martens & Martin Skutella - 294-306 Multiple hypernode hitting sets and smallest two-cores with targets
by Peter Damaschke - 307-318 On recovering syntenic blocks from comparative maps
by Zhixiang Chen & Bin Fu & Minghui Jiang & Binhai Zhu
August 2009, Volume 18, Issue 2
- 99-123 Graph coloring by multiagent fusion search
by Xiao-Feng Xie & Jiming Liu - 124-150 Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
by Christian Desrosiers & Philippe Galinier & Alain Hertz & Sandrine Paroz - 151-172 The bandpass problem: combinatorial optimization and library of problems
by Djangir A. Babayev & George I. Bell & Urfat G. Nuriyev - 173-178 On the total {k}-domination number of Cartesian products of graphs
by Ning Li & Xinmin Hou - 179-194 A better constant-factor approximation for weighted dominating set in unit disk graph
by Yaochun Huang & Xiaofeng Gao & Zhao Zhang & Weili Wu - 195-205 The canadian traveller problem and its competitive analysis
by Yinfeng Xu & Maolin Hu & Bing Su & Binhai Zhu & Zhijun Zhu
July 2009, Volume 18, Issue 1
- 1-22 Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron
by F. Bendali & J. Mailfert - 23-37 Domination and total domination in complementary prisms
by Teresa W. Haynes & Michael A. Henning & Lucas C. Merwe - 38-50 The weighted link ring loading problem
by Qingqin Nong & Jinjiang Yuan & Yixun Lin - 51-63 Error-correcting pooling designs associated with the dual space of unitary space and ratio efficiency comparison
by Geng-sheng Zhang & Xiao-lei Sun & Bo-li Li - 64-86 Finding nucleolus of flow game
by Xiaotie Deng & Qizhi Fang & Xiaoxun Sun - 87-97 Parameterized dominating set problem in chordal graphs: complexity and lower bound
by Chunmei Liu & Yinglei Song
May 2009, Volume 17, Issue 4
- 347-366 A successive approximation algorithm for the multiple knapsack problem
by Zhenbo Wang & Wenxun Xing - 367-377 Optimal st-orientations for plane triangulations
by Huaming Zhang & Xin He - 378-399 Standard directed search strategies and their applications
by Boting Yang & Yi Cao - 400-416 Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability
by Subhash C. Sarin & Balaji Nagarajan & Sanjay Jain & Lingrui Liao - 417-423 A note on online strip packing
by Deshi Ye & Xin Han & Guochuan Zhang - 424-436 An improved approximation algorithm for uncapacitated facility location problem with penalties
by Guang Xu & Jinhui Xu
April 2009, Volume 17, Issue 3
- 235-246 Finding an anti-risk path between two nodes in undirected graphs
by Peng Xiao & Yinfeng Xu & Bing Su - 247-273 Traffic regulation with single- and dual-homed ISPs under a percentile-based pricing policy
by Jianping Wang & Jing Chen & Mei Yang & S. Q. Zheng - 274-311 Probabilistic graph-coloring in bipartite and split graphs
by N. Bourgeois & F. Della Croce & B. Escoffier & C. Murat & V. Th. Paschos - 312-322 A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
by Tz-Liang Kueng & Cheng-Kuan Lin & Tyne Liang & Jimmy J. M. Tan & Lih-Hsing Hsu - 323-338 Single machine batch scheduling with release times
by Beat Gfeller & Leon Peeters & Birgitta Weber & Peter Widmayer - 339-345 Two new error-correcting pooling designs from d-bounded distance-regular graphs
by Xinlu Zhang & Jun Guo & Suogang Gao
February 2009, Volume 17, Issue 2
- 117-133 Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
by Imed Kacem - 134-156 Multiple phase neighborhood Search—GRASP based on Lagrangean relaxation, random backtracking Lin–Kernighan and path relinking for the TSP
by Yannis Marinakis & Athanasios Migdalas & Panos M. Pardalos - 157-167 Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
by D. Quadri & E. Soutif & P. Tolla - 168-191 Lower bounds and a tabu search algorithm for the minimum deficiency problem
by Mathieu Bouchard & Alain Hertz & Guy Desaulniers - 192-205 Path packing and a related optimization problem
by Natalia Vanetik - 206-213 A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
by Jinjiang Yuan & Shisheng Li & Ji Tian & Ruyan Fu - 214-234 An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
by Saman Eskandarzadeh & Reza Tavakkoli-Moghaddam & Amir Azaron
January 2009, Volume 17, Issue 1
- 1-2 Guest Editorial
by Onur Şeref & Petros Xanthopoulos - 3-20 Selective support vector machines
by Onur Seref & O. Erhun Kundakcioglu & Oleg A. Prokopyev & Panos M. Pardalos - 21-44 Generalized median graphs and applications
by Lopamudra Mukherjee & Vikas Singh & Jiming Peng & Jinhui Xu & Michael J. Zeitz & Ronald Berezney - 45-53 On the complexity and approximation of non-unique probe selection using d-disjunct matrix
by My T. Thai & Taieb Znati - 54-73 Modeling and in vitro and in vivo characterization of a tissue engineered pancreatic substitute
by C. L. Stabler & C. Fraker & E. Pedraza & I. Constantinidis & A. Sambanis - 74-97 Measuring resetting of brain dynamics at epileptic seizures: application of global optimization and spatial synchronization techniques
by Shivkumar Sabesan & Niranjan Chakravarthy & Kostas Tsakalis & Panos Pardalos & Leon Iasemidis - 98-116 Controlling epileptic seizures in a neural mass model
by Niranjan Chakravarthy & Shivkumar Sabesan & Kostas Tsakalis & Leon Iasemidis
November 2008, Volume 16, Issue 4
- 323-323 Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms
by David Bremner & Antoine Deza & Michael Soltys - 324-327 A quadratic lower bound for colourful simplicial depth
by Tamon Stephen & Hugh Thomas - 328-343 Computing monotone disjoint paths on polytopes
by David Avis & Bohdan Kaluzny - 344-360 Stable matching problems with exchange restrictions
by Robert W. Irving - 361-377 Minimum entropy coloring
by Jean Cardinal & Samuel Fiorini & Gwenaël Joret - 378-401 A nonlinear optimization methodology for VLSI fixed-outline floorplanning
by Chaomin Luo & Miguel F. Anjos & Anthony Vannelli - 402-423 Packing trees in communication networks
by Mohamed Saad & Tamás Terlaky & Anthony Vannelli & Hu Zhang
October 2008, Volume 16, Issue 3
- 197-197 Editorial, COCOON 2007 special issue
by Guohui Lin & Zhipeng Cai - 198-228 Priority algorithms for the subset-sum problem
by Yuli Ye & Allan Borodin - 229-247 A new recombination lower bound and the minimum perfect phylogenetic forest problem
by Yufeng Wu & Dan Gusfield - 248-262 Online interval scheduling: randomized and multiprocessor cases
by Stanley P. Y. Fung & Chung Keung Poon & Feifeng Zheng - 263-278 Alignments with non-overlapping moves, inversions and tandem duplications in O(n 4) time
by Christian Ledergerber & Christophe Dessimoz - 279-292 Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
by Robert W. Irving & David F. Manlove - 293-306 A new quartet approach for reconstructing phylogenetic trees: quartet joining method
by Bin Ma & Lei Xin & Kaizhong Zhang - 307-322 On broadcasting in unicyclic graphs
by Hovhannes A. Harutyunyan & Edward Maraachlian
August 2008, Volume 16, Issue 2
- 97-98 Preface
by Andreas Dress & Yinfeng Xu & Binhai Zhu - 99-106 On minimum m-connected k-dominating set problem in unit disc graphs
by Weiping Shang & Frances Yao & Pengjun Wan & Xiaodong Hu - 107-118 On threshold BDDs and the optimal variable ordering problem
by Markus Behle - 119-126 An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
by Yuzhong Zhang & Zhigang Cao - 127-154 A Lagrangian relaxation approach for the multiple sequence alignment problem
by Ernst Althaus & Stefan Canzar - 155-172 Approximation algorithms for connected facility location problems
by Mohammad Khairul Hasan & Hyunwoo Jung & Kyung-Yong Chwa - 173-181 Finding the anti-block vital edge of a shortest path between two nodes
by Bing Su & Qingchuan Xu & Peng Xiao - 182-195 Point sets in the unit square and large areas of convex hulls of subsets of points
by Hanno Lefmann
July 2008, Volume 16, Issue 1
- 1-15 Online coupon consumption problem
by Yiwei Jiang & An Zhang & Zhiyi Tan - 16-27 Almost optimal solutions for bin coloring problems
by Mingen Lin & Zhiyong Lin & Jinhui Xu - 28-38 Online scheduling on parallel machines with two GoS levels
by Yiwei Jiang - 39-49 Parameterized lower bound and inapproximability of polylogarithmic string barcoding
by Chunmei Liu & Yinglei Song & Legand L. Burge - 50-67 The inverse 1-maxian problem with edge length modification
by Elisabeth Gassner - 68-80 On the upper total domination number of Cartesian products of graphs
by Paul Dorbec & Michael A. Henning & Douglas F. Rall - 81-95 OMEGa: an optimistic most energy gain method for minimum energy multicasting in wireless ad hoc networks
by Manki Min & Panos M. Pardalos
May 2008, Volume 15, Issue 4
- 305-314 The hierarchical model for load balancing on two machines
by Orion Chassid & Leah Epstein - 315-341 An efficient generalized network-simplex-based algorithm for manufacturing network flows
by Prahalad Venkateshan & Kamlesh Mathur & Ronald H. Ballou - 342-356 Partitioning a weighted partial order
by Linda S. Moonen & Frits C. R. Spieksma - 357-367 Simplest optimal guillotine cutting patterns for strips of identical circles
by Yaodong Cui & Tianlong Gu & Wei Hu - 368-386 A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
by Niaz A. Wassan & A. Hameed Wassan & Gábor Nagy - 387-407 Sublinear time width-bounded separators and their application to the protein side-chain packing problem
by Bin Fu & Zhixiang Chen
April 2008, Volume 15, Issue 3
- 223-224 Special Issue on Combinatorial Optimization in Data Mining
by Wanpracha Art Chaovalitwongse & Onur Seref - 225-241 Novel quadratic programming approach for time series clustering with biomedical application
by Wanpracha Art Chaovalitwongse - 242-256 Tracing ‘driver’ versus ‘modulator’ information flow throughout large-scale, task-related neural circuitry
by Linda Hermer-Vazquez - 257-275 Shape analysis for automated sulcal classification and parcellation of MRI data
by Monica K. Hurdal & Juan B. Gutierrez & Christian Laing & Deborah A. Smith - 276-286 Quantitative complexity analysis in multi-channel intracranial EEG recordings form epilepsy brains
by Chang-Chia Liu & Panos M. Pardalos & W. Art Chaovalitwongse & Deng-Shan Shiau & Georges Ghacibeh & Wichai Suharitdamrong & J. Chris Sackellares - 287-304 A simulation tool for modeling the influence of anatomy on information flow using discrete integrate and fire neurons
by Maya Maimon & Larry Manevitz
February 2008, Volume 15, Issue 2
- 127-146 Designing k-coverage schedules in wireless sensor networks
by Yingshu Li & Shan Gao - 147-164 Column generation approach for the point-feature cartographic label placement problem
by Glaydston Mattos Ribeiro & Luiz Antonio Nogueira Lorena - 165-178 Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
by Yannick Vimont & Sylvain Boussier & Michel Vasquez - 179-190 An exponential (matching based) neighborhood for the vehicle routing problem
by Eric Angel & Evripidis Bampis & Fanny Pascual - 191-199 On lazy bureaucrat scheduling with common deadlines
by Ling Gai & Guochuan Zhang - 201-221 On the inapproximability of the exemplar conserved interval distance problem of genomes
by Zhixiang Chen & Richard H. Fowler & Bin Fu & Binhai Zhu
January 2008, Volume 15, Issue 1
- 1-6 Steiner systems for two-stage disjunctive testing
by Vladimir D. Tonchev - 7-16 Hypothesis group testing for disjoint pairs
by Morgan A. Bishop & Anthony J. Macula & Thomas E. Renz & Vladimir V. Ufimtsev - 17-48 Locating and detecting arrays for interaction faults
by Charles J. Colbourn & Daniel W. McClary - 49-59 A survey on nonadaptive group testing algorithms through the angle of decoding
by Hong-Bin Chen & Frank K. Hwang - 61-76 On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design
by Hung Q. Ngo - 77-94 New combinatorial structures with applications to efficient group testing with inhibitors
by Annalisa Bonis - 95-121 Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
by Michael T. Goodrich & Daniel S. Hirschberg - 123-126 Improved construction for pooling design
by Ping Deng & F. K. Hwang & Weili Wu & David MacCallum & Feng Wang & Taieb Znati
November 2007, Volume 14, Issue 4
- 385-410 Maximally even sets and configurations: common threads in mathematics, physics, and music
by Jack Douthett & Richard Krantz - 411-425 Monotonicity of strong searching on digraphs
by Boting Yang & Yi Cao - 427-435 Online bin packing of fragile objects with application in cellular networks
by Wun-Tat Chan & Francis Y.-L. Chin & Deshi Ye & Guochuan Zhang & Yong Zhang - 437-453 Approximation algorithms and hardness results for labeled connectivity problems
by Refael Hassin & Jérôme Monnot & Danny Segev - 455-463 Maximum k-regular induced subgraphs
by Domingos M. Cardoso & Marcin Kamiński & Vadim Lozin - 465-474 The densest k-subgraph problem on clique graphs
by Maria Liazi & Ioannis Milis & Fanny Pascual & Vassilis Zissimopoulos - 475-480 A note on special optimal batching structures to minimize total weighted completion time
by Wenhua Li & Jinjiang Yuan & Yixun Lin - 481-498 The wireless network jamming problem
by Clayton W. Commander & Panos M. Pardalos & Valeriy Ryabchenko & Stan Uryasev & Grigoriy Zrazhevsky - 499-499 Journal of combinatorial optimization, special issue on communication networks and internet applications
by Maggie X. Cheng - 500-500 A robust genetic algorithm for rectangle packing problem
by De-Sheng Chen & Chang-Tzu Lin & Yi-Wen Wang
October 2007, Volume 14, Issue 2
- 111-112 Editorial note
by Gerard J. Chang & Hung-Lin Fu & Xuding Zhu - 113-119 Group testing in graphs
by Justie Su-tzu Juan & Gerard J. Chang - 121-129 An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
by H. B. Chen & D. Z. Du & F. K. Hwang - 131-142 Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks
by Victor W. Liu & Chiuyuan Chen & Richard B. Chen - 143-152 Wide diameters of de Bruijn graphs
by Jyhmin Kuo & Hung-Lin Fu - 153-164 The use of edge-directions and linear programming to enumerate vertices
by Shmuel Onn & Uriel G. Rothblum - 165-175 An algorithm for optimal difference systems of sets
by Vladimir D. Tonchev & Hao Wang - 177-190 Profile minimization on compositions of graphs
by Yu-Ping Tsao & Gerard J. Chang - 191-195 Near automorphisms of trees with small total relative displacements
by Chia-Fen Chang & Hung-Lin Fu - 197-204 Hamiltonicity of hypercubes with a constraint of required and faulty edges
by Lih-Hsing Hsu & Shu-Chung Liu & Yeong-Nan Yeh - 205-218 Decomposition of K m,n into 4-cycles and 2t-cycles
by Chao-Chih Chou & Chin-Mei Fu - 219-227 L(j,k)- and circular L(j,k)-labellings for the products of complete graphs
by Peter Che Bor Lam & Wensong Lin & Jianzhuan Wu - 229-248 Transport schemes for topology-transparent scheduling
by Violet R. Syrotiuk & Zhiqiang Zhang & Charles J. Colbourn - 249-257 Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
by Jerrold R. Griggs & Xiaohua Teresa Jin - 259-265 Decompositions of λ K v
by C. A. Rodger & S. K. Westbrook - 267-274 Distance graphs on R n with 1-norm
by Jer-Jeong Chen & Gerard J. Chang - 275-294 On cubic 2-independent Hamiltonian connected graphs
by Tung-Yang Ho & Chun-Nan Hung & Lih-Hsing Hsu