Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 23
Volume 23, Number 1, January 2012
- Bo-Jr Li, Gerard J. Chang
:
The competition number of a graph with exactly two holes. 1-8 - Wayne Goddard, Jeremy Lyle:
Independent dominating sets in triangle-free graphs. 9-20 - Federico Della Croce, Dominique Quadri:
Improving an exact approach for solving separable integer quadratic knapsack problems. 21-28 - Benjamin McClosky, Illya V. Hicks:
Combinatorial algorithms for the maximum k-plex problem. 29-49 - Yongxi Cheng, Guohui Lin:
Solving haplotype inference problem with non-genotyped founders via integer linear programming. 50-60 - Huilan Chang, Frank K. Hwang, Uriel G. Rothblum:
A new approach to solve open-partition problems. 61-78 - Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud:
On backbone coloring of graphs. 79-93 - Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié:
The max quasi-independent set problem. 94-117 - Yingshu Li, Yiwei Wu, Chunyu Ai, Raheem A. Beyah:
On the construction of k-connected m-dominating sets in wireless networks. 118-139 - Qiaojun Shu, Weifan Wang:
Acyclic chromatic indices of planar graphs with girth at least five. 140-157
Volume 23, Number 2, February 2012
- Wenming Zhang, Yinfeng Xu, Feifeng Zheng, Yucheng Dong:
Optimal algorithms for online time series search and one-way trading with interrelated prices. 159-166 - Qin Chen, Xujin Chen:
Packing cycles exactly in polynomial time. 167-188 - Ming Liu, Chengbin Chu, Yinfeng Xu, Jiazhen Huo:
An optimal online algorithm for single machine scheduling to minimize total general completion time. 189-195 - Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub:
Models for the single-vehicle preemptive pickup and delivery problem. 196-223 - Neng Fan, Panos M. Pardalos:
Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs. 224-251 - Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The total {k}-domatic number of a graph. 252-260 - Elisabeth Gassner:
An inverse approach to convex ordered median problems in trees. 261-273 - Minming Li, Tiantian Liu, Chun Jason Xue, Yingchao Zhao:
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture. 274-291 - Konstantin Moiseev, Avinoam Kolodny, Shmuel Wimer:
The complexity of VLSI power-delay optimization by interconnect resizing. 292-300 - Hongjie Du, Weili Wu, Shan Shan, Donghyun Kim, Wonjun Lee:
Constructing weakly connected dominating set for secure clustering in distributed sensor network. 301-307
Volume 23, Number 3, April 2012
- Danny Z. Chen, Ewa Misiolek:
Flattening topologically spherical surface. 309-321 - Yijie Han:
Tight bound for matching. 322-330 - Guoqiang Bai, Henning Fernau:
Constraint bipartite vertex cover: simpler exact algorithms and implementations. 331-355 - Tian-Ming Bu, Xiaotie Deng, Qi Qi:
Multi-bidding strategy in sponsored search auctions. 356-372 - Sumit Ganguly, Mohit Bansal, Shruti Dube:
Estimating hybrid frequency moments of data streams. 373-394
Volume 23, Number 4, May 2012
- Dvir Shabtay, Nufar Gaspar, Liron Yedidsion:
A bicriteria approach to scheduling a single machine with job rejection and positional penalties. 395-424 - Xiang-Sun Zhang, Zhen-Ping Li, Rui-Sheng Wang, Yong Wang:
A combinatorial model and algorithm for globally searching community structure in complex networks. 425-442 - Xu Zhu, Wei Wang, Shan Shan, Zhong Wang, Weili Wu:
A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs. 443-450 - Wei Zhang, Zhao Zhang, Wei Wang, Feng Zou, Wonjun Lee:
Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks. 451-461 - Gerard J. Chang, Ting-Pang Chang, Li-Da Tong:
Hamiltonian numbers of Möbius double loop networks. 462-470 - Tongliang Shi, Mei Lu:
Fault-tolerant diameter for three family interconnection networks. 471-482 - Ming Liu, Feifeng Zheng, Chengbin Chu, Jiantong Zhang:
An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration. 483-492 - Haitao Jiang, Zhong Li, Guohui Lin, Lusheng Wang, Binhai Zhu:
Exact and approximation algorithms for the complementary maximal strip recovery problem. 493-506 - Shenwei Huang, Erfang Shan, Liying Kang:
Perfect matchings in paired domination vertex critical graphs. 507-518 - Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu:
Minimum common string partition revisited. 519-527 - Wenkai Ma, Deying Li, Zhao Zhang:
Algorithms for the minimum weight k-fold (connected) dominating set problem. 528-540
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-04-26 18:31 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:
