Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 20
Volume 20, Number 1, July 2010
- Andrew C. Trapp, Oleg A. Prokopyev
, Stanislav Busygin:
Finding checkerboard patterns via fractional 0-1 programming. 1-26 - Rainer E. Burkard, Johannes Hatzl:
Median problems with positive and negative weights on cycles and cacti. 27-46 - Xiaoming Wang, Qiaoliang Li, Yingshu Li:
EiSIRS: a formal model to analyze the dynamics of worm propagation in wireless sensor networks. 47-62 - Ilias S. Kotsireas, Christos Koukouvinos, Panos M. Pardalos, Oleg V. Shylo:
Periodic complementary binary sequences and Combinatorial Optimization algorithms. 63-75 - Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
On the total domination subdivision number in some classes of graphs. 76-84 - Zhiyi Tan, An Zhang:
A note on hierarchical scheduling on two uniform machines. 85-95 - Jizhu Nan, Jun Guo:
New error-correcting pooling designs associated with finite vector spaces. 96-100
Volume 20, Number 2, August 2010
- Hakim Akeb, Mhand Hifi:
A hybrid beam search looking-ahead algorithm for the circular packing problem. 101-130 - Liying Kang, Yukun Cheng:
The p-maxian problem on block graphs. 131-141 - Geng-sheng Zhang, Yu-qin Yang:
The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design. 142-160 - György Dósa, Leah Epstein:
Online scheduling with a buffer on related machines. 161-179 - Chunmei Liu, Legand L. Burge III, Ajoni Blake:
Algorithms and time complexity of the request-service problem. 180-193 - Shannon L. Fitzpatrick, Bert L. Hartnell:
Well paired-dominated graphs. 194-204
Volume 20, Number 3, October 2010
- Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert:
An upper bound on the total restrained domination number of a tree. 205-223 - Nelson Castañeda, Ivan S. Gotchev:
Embedded paths and cycles in faulty hypercubes. 224-248 - Changcun Ma, Donghyun Kim, Yuexuan Wang, Wei Wang, Nassim Sohaee, Weili Wu:
Hardness of k-Vertex-Connected Subgraph Augmentation Problem. 249-258 - Xiang-Yang Li, Zheng Sun, Weizhao Wang, Wei Lou:
Cost sharing and strategyproof mechanisms for set cover games. 259-284 - Lele Zhang, Andrew Wirth:
On-line machine scheduling with batch setups. 285-306 - Wenqiang Dai, Xianju Zeng:
Incremental Facility Location Problem and Its Competitive Algorithms. 307-320 - Michael A. Henning:
A short proof of a result on a Vizing-like problem for integer total domination. 321-323
Volume 20, Number 4, November 2010
- Zengti Li, Suogang Gao, Hongjie Du, Feng Zou, Weili Wu:
Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2. 325-334 - Falk Hüffner, Nadja Betzler, Rolf Niedermeier:
Separator-based data reduction for signed graph balancing. 335-360 - Donglei Du, Xing Wang, Dachuan Xu:
An approximation algorithm for the k-level capacitated facility location problem. 361-368 - Qian Cao, Zhaohui Liu:
Semi-online scheduling with known maximum job size on two uniform machines. 369-384 - Glaydston Mattos Ribeiro, Miguel Fragoso Constantino, Luiz Antonio Nogueira Lorena:
Strong formulation for the spot 5 daily photograph scheduling problem. 385-398 - Chen Liao, Shiyan Hu:
Polynomial time approximation schemes for minimum disk cover problems. 399-412 - Jun Guo, Yuexuan Wang, Suogang Gao, Jiangchen Yu, Weili Wu:
Constructing error-correcting pooling designs with symplectic space. 413-421 - Biao Wu, Enyu Yao, Longcheng Liu:
A polynomially solvable case of optimal linear extension problem of a poset. 422-428 - Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
On the max-weight edge coloring problem. 429-442
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-31 18:44 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:
