Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 16
Volume 16, Number 1, July 2008
- Yiwei Jiang, An Zhang, Zhiyi Tan
:
Online coupon consumption problem. 1-15 - Mingen Lin, Zhiyong Lin, Jinhui Xu:
Almost optimal solutions for bin coloring problems. 16-27 - Yiwei Jiang:
Online scheduling on parallel machines with two GoS levels. 28-38 - Chunmei Liu, Yinglei Song, Legand L. Burge III:
Parameterized lower bound and inapproximability of polylogarithmic string barcoding. 39-49 - Elisabeth Gassner:
The inverse 1-maxian problem with edge length modification. 50-67 - Paul Dorbec, Michael A. Henning, Douglas F. Rall:
On the upper total domination number of Cartesian products of graphs. 68-80 - Manki Min, Panos M. Pardalos:
OMEGa: an optimistic most energy gain method for minimum energy multicasting in wireless ad hoc networks. 81-95
Volume 16, Number 2, August 2008
- Andreas W. M. Dress, Yinfeng Xu, Binhai Zhu:
Preface. 97-98 - Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu:
On minimum m -connected k -dominating set problem in unit disc graphs. 99-106 - Markus Behle:
On threshold BDDs and the optimal variable ordering problem. 107-118 - Yuzhong Zhang, Zhigang Cao:
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan. 119-126 - Ernst Althaus, Stefan Canzar:
A Lagrangian relaxation approach for the multiple sequence alignment problem. 127-154 - Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong Chwa:
Approximation algorithms for connected facility location problems. 155-172 - Bing Su, Qingchuan Xu, Peng Xiao:
Finding the anti-block vital edge of a shortest path between two nodes. 173-181 - Hanno Lefmann:
Point sets in the unit square and large areas of convex hulls of subsets of points. 182-195
Volume 16, Number 3, October 2008
- Guohui Lin, Zhipeng Cai:
Editorial, COCOON 2007 special issue. 197 - Yuli Ye, Allan Borodin:
Priority algorithms for the subset-sum problem. 198-228 - Yufeng Wu, Dan Gusfield:
A new recombination lower bound and the minimum perfect phylogenetic forest problem. 229-247 - Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng:
Online interval scheduling: randomized and multiprocessor cases. 248-262 - Christian Ledergerber, Christophe Dessimoz:
Alignments with non-overlapping moves, inversions and tandem duplications in O ( n 4) time. 263-278 - Robert W. Irving, David F. Manlove:
Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems. 279-292 - Bin Ma, Lei Xin, Kaizhong Zhang:
A new quartet approach for reconstructing phylogenetic trees: quartet joining method. 293-306 - Hovhannes A. Harutyunyan, Edward Maraachlian:
On broadcasting in unicyclic graphs. 307-322
Volume 16, Number 4, November 2008
- David Bremner, Antoine Deza, Michael Soltys:
Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. 323 - Tamon Stephen, Hugh Thomas:
A quadratic lower bound for colourful simplicial depth. 324-327 - David Avis, Bohdan Kaluzny:
Computing monotone disjoint paths on polytopes. 328-343 - Robert W. Irving:
Stable matching problems with exchange restrictions. 344-360 - Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum entropy coloring. 361-377 - Chaomin Luo, Miguel F. Anjos, Anthony Vannelli:
A nonlinear optimization methodology for VLSI fixed-outline floorplanning. 378-401 - Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang:
Packing trees in communication networks. 402-423
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-05 01:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
