Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 11
Volume 11, Number 1, February 2006
- Maggie Xiaoyan Cheng:
Editorial. 5-6 - Wei Liu, Yanchao Zhang, Yuguang Fang
, Kejie Lu:
Energy conservation through resource-aware movement in heterogeneous mobile ad hoc networks. 7-20 - Jing Ai, Alhussein A. Abouzeid:
Coverage by directional sensors in randomly deployed wireless sensor networks. 21-41 - Leigh E. Hodge, Roger M. Whitaker, Steve Hurley:
Multiple objective optimization of bluetooth scatternets. 43-57 - Manki Min, Oleg A. Prokopyev, Panos M. Pardalos:
Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks. 59-69 - Jian Tang, Guoliang Xue, Weiyi Zhang:
Reliable Ad Hoc Routing Based on Mobility Prediction. 71-85 - Zhengnan Shi, Pradip K. Srimani:
An online distributed gossiping protocol for mobile networks. 87-97 - Yu Wang, Xiang-Yang Li:
Minimum power assignment in wireless ad hoc networks with spanner property. 99-112 - Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl, Sylvia Tai:
Data relaying with constraints in hierarchical sensor networks. 113-123 - Tínaz Ekim, Dominique de Werra:
Erratum. 125
Volume 11, Number 2, March 2006
- Lusheng Wang:
Introduction to the special issue. 131 - Chunfang Zheng, David Sankoff:
Genome rearrangements with partially ordered chromosomes. 133-144 - Chung Keung Poon, Wai Keung Yiu:
Opportunistic data structures for range queries. 145-154 - David Liben-Nowell, Erik Vee, An Zhu:
Finding longest increasing and common subsequences in streaming data. 155-175 - Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong:
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time. 177-187 - Jin-yi Cai, Venkatesan T. Chakaravarthy:
On zero error algorithms having oracle access to one query. 189-202 - Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu:
A PTAS for a disc covering problem using width-bounded separators. 203-217 - Xujin Chen, Xiaodong Hu, Tianping Shuai:
Inapproximability and approximability of maximal tree routing and coloring. 219-229 - Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
On the computational hardness based on linear FPT-reductions. 231-247 - Hai Liu, Peng-Jun Wan, Xiaohua Jia:
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks. 249-260
Volume 11, Number 3, May 2006
- Demetrios Kazakos, Sam Makki:
When are two multivariate random processes indistinguishable. 263-278 - Miroslav Chlebík, Janka Chlebíková:
Approximation hardness of edge dominating set problems. 279-290 - Jie Wang, Ning Zhong:
Efficient point coverage in wireless sensor networks. 291-304 - Minming Li, Becky Jie Liu, Frances F. Yao:
Min-energy voltage allocation for tree-structured tasks. 305-319 - F. H. Chang, H. B. Chen, J. Y. Guo, Frank K. Hwang, Uriel G. Rothblum:
One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions. 321-339 - Virginie Gabrel:
Strengthened 0-1 linear formulation for the daily satellite mission planning. 341-346
Volume 11, Number 4, June 2006
- Haiyan Lu, Enyu Yao, Liqun Qi:
Some further results on minimum distribution cost flow problems. 351-371 - Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli:
A "maximum node clustering" problem. 373-385 - Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani:
Inapproximability results for the lateral gene transfer problem. 387-405 - Huilan Chang, Junyi Guo:
Strongly 2-shape-sortability of vector partitions. 407-410 - Binhai Zhu, Minghui Jiang:
A combinatorial theorem on labeling squares with points and its application. 411-420 - Vicky Mak, Tommy Thomadsen:
Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem. 421-434 - Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang:
Construction of the nearest neighbor embracing graph of a point set. 435-443 - Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei:
Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. 445-454
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-06-10 21:32 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:
