Printed from https://ideas.repec.org/s/spr/jcomop10.html
Content
February 2012, Volume 23, Issue 2
- 224-251 Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs
by Neng Fan & Panos M. Pardalos - 252-260 The total {k}-domatic number of a graph
by S. M. Sheikholeslami & L. Volkmann - 261-273 An inverse approach to convex ordered median problems in trees
by Elisabeth Gassner - 274-291 Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
by Minming Li & Tiantian Liu & Chun Jason Xue & Yingchao Zhao - 292-300 The complexity of VLSI power-delay optimization by interconnect resizing
by Konstantin Moiseev & Avinoam Kolodny & Shmuel Wimer - 301-307 Constructing weakly connected dominating set for secure clustering in distributed sensor network
by Hongjie Du & Weili Wu & Shan Shan & Donghyun Kim & Wonjun Lee
January 2012, Volume 23, Issue 1
- 1-8 The competition number of a graph with exactly two holes
by Bo-Jr Li & Gerard J. Chang - 9-20 Independent dominating sets in triangle-free graphs
by Wayne Goddard & Jeremy Lyle - 21-28 Improving an exact approach for solving separable integer quadratic knapsack problems
by Federico Della Croce & Dominique Quadri - 29-49 Combinatorial algorithms for the maximum k-plex problem
by Benjamin McClosky & Illya V. Hicks - 50-60 Solving haplotype inference problem with non-genotyped founders via integer linear programming
by Yongxi Cheng & Guohui Lin - 61-78 A new approach to solve open-partition problems
by Huilan Chang & Frank K. Hwang & Uriel G. Rothblum - 79-93 On backbone coloring of graphs
by Weifan Wang & Yuehua Bu & Mickaël Montassier & André Raspaud - 94-117 The max quasi-independent set problem
by N. Bourgeois & A. Giannakos & G. Lucarelli & I. Milis & V. T. Paschos & O. Pottié - 118-139 On the construction of k-connected m-dominating sets in wireless networks
by Yingshu Li & Yiwei Wu & Chunyu Ai & Raheem Beyah - 140-157 Acyclic chromatic indices of planar graphs with girth at least five
by Qiaojun Shu & Weifan Wang
November 2011, Volume 22, Issue 4
- 495-498 A generalization of Macula’s disjunct matrices
by Ping Zhao & Kefeng Diao & Kaishun Wang - 499-508 Resource-sharing systems and hypergraph colorings
by Wu-Hsiung Lin & Gerard J. Chang - 509-516 Optimal on-line algorithms for one batch machine with grouped processing times
by Yang Fang & Peihai Liu & Xiwen Lu - 517-530 The Maximum Box Problem for moving points in the plane
by S. Bereg & J. M. Díaz-Báñez & P. Pérez-Lantero & I. Ventura - 531-548 Selfish bin coloring
by Leah Epstein & Sven O. Krumke & Asaf Levin & Heike Sperber - 549-562 Super cyclically edge connected transitive graphs
by Zhao Zhang & Bing Wang - 563-571 On the vertex characterization of single-shape partition polytopes
by Yu-Chi Liu & Jun-Jie Pan - 572-593 Revised GRASP with path-relinking for the linear ordering problem
by W. Art Chaovalitwongse & Carlos A. S. Oliveira & Bruno Chiarini & Panos M. Pardalos & Mauricio G. C. Resende - 594-608 Optimality conditions for a bilevel matroid problem
by Diana Fanghänel - 609-629 A closest vector problem arising in radiation therapy planning
by Céline Engelbeen & Samuel Fiorini & Antje Kiesel - 630-639 Optimal tree structure with loyal users and batch updates
by Yu-Ki Chan & Minming Li & Weiwei Wu - 640-650 Co-2-plex polynomials
by Benjamin McClosky & Anthony Simms & Illya V. Hicks - 651-662 On domination number of Cartesian product of directed paths
by Juan Liu & Xindong Zhang & Jixiang Meng - 663-673 PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs
by Lidan Fan & Zhao Zhang & Wei Wang - 674-683 Optimal semi-online algorithm for scheduling with rejection on two uniform machines
by Xiao Min & Jing Liu & Yuqing Wang - 684-698 Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
by Chunmei Liu & Yinglei Song - 699-725 Geometric rounding: a dependent randomized rounding scheme
by Dongdong Ge & Simai He & Yinyu Ye & Jiawei Zhang - 726-746 Improved floor-planning of graphs via adjacency-preserving transformations
by Huaming Zhang & Sadish Sadasivam - 747-762 A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
by Neng Fan & Panos M. Pardalos - 763-777 Fast searching games on graphs
by Donald Stanley & Boting Yang - 778-796 The multiple sequence sets: problem and heuristic algorithms
by Kang Ning & Hon Wai Leong - 797-818 Minimizing makespan in an ordered flow shop with machine-dependent processing times
by Byung-Cheon Choi & Joseph Y.-T. Leung & Michael L. Pinedo - 819-844 SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling
by Karine Deschinkel & Sid-Ahmed-Ali Touati & Sébastien Briais - 845-856 Polynomially solvable special cases of the quadratic bottleneck assignment problem
by Rainer E. Burkard & Roswitha Rissner - 857-872 Minimum d-blockers and d-transversals in graphs
by Marie-Christine Costa & Dominique Werra & Christophe Picouleau - 873-881 A modified power spectral density test applied to weighing matrices with small weight
by Ilias S. Kotsireas & Christos Koukouvinos & Panos M. Pardalos - 882-894 Improving an upper bound on the size of k-regular induced subgraphs
by Carlos J. Luz
October 2011, Volume 22, Issue 3
- 293-304 On the readability of monotone Boolean formulae
by Khaled Elbassioni & Kazuhisa Makino & Imran Rauf - 305-324 Honeynet games: a game theoretic approach to defending network monitors
by Jin-Yi Cai & Vinod Yegneswaran & Chris Alfeld & Paul Barford - 325-338 An improved time-space lower bound for tautologies
by Scott Diehl & Dieter Melkebeek & Ryan Williams - 339-358 Popular matchings: structure and algorithms
by Eric McDermid & Robert W. Irving - 359-377 Online tree node assignment with resource augmentation
by Joseph Wun-Tat Chan & Francis Y. L. Chin & Hing-Fung Ting & Yong Zhang - 378-391 On the performances of Nash equilibria in isolation games
by Vittorio Bilò & Michele Flammini & Gianpiero Monaco & Luca Moscardelli - 392-408 A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise
by Masaki Yamamoto & Shuji Kijima & Yasuko Matsui - 409-425 Convex partitions with 2-edge connected dual graphs
by Marwan Al-Jubeh & Michael Hoffmann & Mashhood Ishaque & Diane L. Souvaine & Csaba D. Tóth - 426-437 Why locally-fair maximal flows in client-server networks perform well
by Kenneth A. Berman & Chad Yoshikawa - 438-456 Strongly chordal and chordal bipartite graphs are sandwich monotone
by Pinar Heggernes & Federico Mancini & Charis Papadopoulos & R. Sritharan - 457-468 On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
by Ivona Bezáková & Nayantara Bhatnagar & Dana Randall - 469-481 Sublinear-time algorithms for tournament graphs
by Stefan Dantchev & Tom Friedetzky & Lars Nagel - 482-493 Separating NE from some nonuniform nondeterministic complexity classes
by Bin Fu & Angsheng Li & Liyu Zhang
August 2011, Volume 22, Issue 2
- 121-144 The flexible blocking job shop with transfer and set-up times
by Heinz Gröflin & Dinh Nguyen Pham & Reinhard Bürgy - 145-152 Pooling designs for clone library screening in the inhibitor complex model
by Fei-huang Chang & Huilan Chang & Frank K. Hwang - 153-165 An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
by Hongying Li & Chunjie Su - 166-179 Restrained domination in cubic graphs
by Johannes H. Hattingh & Ernst J. Joubert - 180-201 A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem
by José Fernando Gonçalves & Mauricio G. C. Resende - 202-216 Optimal wafer cutting in shuttle layout problems
by Lasse Nisted & David Pisinger & Avri Altman - 217-234 A characterization of graphs with disjoint dominating and paired-dominating sets
by Justin Southey & Michael A. Henning - 235-251 Upper paired-domination in claw-free graphs
by Paul Dorbec & Michael A. Henning - 252-269 Sharp bounds for Zagreb indices of maximal outerplanar graphs
by Ailin Hou & Shuchao Li & Lanzhen Song & Bing Wei - 270-281 Reconstruction of hidden graphs and threshold group testing
by Huilan Chang & Hong-Bin Chen & Hung-Lin Fu & Chie-Huai Shi - 282-291 On the power domination number of the generalized Petersen graphs
by Guangjun Xu & Liying Kang
July 2011, Volume 22, Issue 1
- 1-18 Which trees have a differentiating-paired dominating set?
by Michael A. Henning & John McCoy - 19-34 A special combinatorial problem: pitch arrangement for pneumatic tires
by Wei-Chu Weng - 35-51 Robust multi-sensor scheduling for multi-site surveillance
by Nikita Boyko & Timofey Turko & Vladimir Boginski & David E. Jeffcoat & Stanislav Uryasev & Grigoriy Zrazhevsky & Panos M. Pardalos - 52-70 Line facility location in weighted regions
by Yam Ki Cheung & Ovidiu Daescu - 71-77 On the Bandpass problem
by Guohui Lin - 78-96 Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
by Yuichi Asahiro & Jesper Jansson & Eiji Miyano & Hirotaka Ono & Kouhei Zenmyo - 97-119 Anonymizing binary and small tables is hard to approximate
by Paola Bonizzoni & Gianluca Della Vedova & Riccardo Dondi
May 2011, Volume 21, Issue 4
- 393-408 Semi-online scheduling on two uniform machines with the known largest size
by Sheng-Yi Cai & Qi-Fan Yang - 409-422 Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction
by Bin Ma & Louxin Zhang - 423-433 On the number of separable partitions
by Frank K. Hwang & Uriel G. Rothblum - 434-457 A Branch and Cut solver for the maximum stable set problem
by Steffen Rebennack & Marcus Oswald & Dirk Oliver Theis & Hanna Seitz & Gerhard Reinelt & Panos M. Pardalos - 458-480 Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
by György Dósa & M. Grazia Speranza & Zsolt Tuza - 481-496 On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2)
by Haoli Wang & Xirong Xu & Yuansheng Yang & Kai Lü - 497-510 Approximation scheme for restricted discrete gate sizing targeting delay minimization
by Chen Liao & Shiyan Hu
April 2011, Volume 21, Issue 3
- 269-292 Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems
by Luis A. Dupont & Rafael H. Villarreal - 293-305 Approximation algorithms for multicast routing in ad hoc wireless networks
by Deying Li & Qinghua Zhu - 306-329 The k-coloring fitness landscape
by Hend Bouziri & Khaled Mellouli & El-Ghazali Talbi - 330-347 Hardness and algorithms for rainbow connection
by Sourav Chakraborty & Eldar Fischer & Arie Matsliah & Raphael Yuster - 348-363 Data aggregation for p-median problems
by Bader F. AlBdaiwi & Diptesh Ghosh & Boris Goldengorin - 364-382 Approximating k-generalized connectivity via collapsing HSTs
by Danny Segev - 383-392 On the generalized constrained longest common subsequence problems
by Yi-Ching Chen & Kun-Mao Chao
February 2011, Volume 21, Issue 2
- 151-158 On the parameterized complexity of the Multi-MCT and Multi-MCST problems
by Wenbin Chen & Matthew C. Schmidt & Nagiza F. Samatova - 159-191 Efficient algorithms for supergraph query processing on graph databases
by Shuo Zhang & Xiaofeng Gao & Weili Wu & Jianzhong Li & Hong Gao - 192-208 Approximation and hardness results for label cut and related problems
by Peng Zhang & Jin-Yi Cai & Lin-Qing Tang & Wen-Bo Zhao - 209-218 Bounding the total domination subdivision number of a graph in terms of its order
by Odile Favaron & Hossein Karami & Seyyed Mahmoud Sheikholeslami - 219-246 Approximating the chromatic index of multigraphs
by Guantao Chen & Xingxing Yu & Wenan Zang - 247-253 Minimizing the sum cost in linear extensions of a poset
by Longcheng Liu & Biao Wu & Enyu Yao - 254-267 Approximating capacitated tree-routings in networks
by Ehab Morsy & Hiroshi Nagamochi
January 2011, Volume 21, Issue 1
- 1-1 Preface
by Xiaodong Hu & Jie Wang - 2-18 Covering directed graphs by in-trees
by Naoyuki Kamiyama & Naoki Katoh - 19-46 Compact labelings for efficient first-order model-checking
by Bruno Courcelle & Cyril Gavoille & Mamadou Moustapha Kanté - 47-66 Visual cryptography on graphs
by Steve Lu & Daniel Manchala & Rafail Ostrovsky - 67-82 New algorithms for online rectangle filling with k-lookahead
by Haitao Wang & Amitabh Chaudhary & Danny Z. Chen - 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