default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 21
Volume 21, Number 1, January 2011
- Xiaodong Hu, Jie Wang:
Preface. 1 - Naoyuki Kamiyama, Naoki Katoh:
Covering directed graphs by in-trees. 2-18 - Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté:
Compact labelings for efficient first-order model-checking. 19-46 - Steve Lu, Daniel Manchala, Rafail Ostrovsky
:
Visual cryptography on graphs. 47-66 - Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
New algorithms for online rectangle filling with k-lookahead. 67-82 - Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi:
Average-case competitive analyses for one-way trading. 83-107 - Hung Q. Ngo, Anh Le, Yang Wang:
A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints. 108-123 - Vikraman Arvind, T. C. Vijayaraghavan:
The orbit problem is in the GapL hierarchy. 124-137 - Ming Liu, Chengbin Chu, Yinfeng Xu, Feifeng Zheng:
Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times. 138-149
Volume 21, Number 2, February 2011
- Wenbin Chen, Matthew C. Schmidt, Nagiza F. Samatova:
On the parameterized complexity of the Multi-MCT and Multi-MCST problems. 151-158 - Shuo Zhang, Xiaofeng Gao, Weili Wu, Jianzhong Li, Hong Gao:
Efficient algorithms for supergraph query processing on graph databases. 159-191 - Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao:
Approximation and hardness results for label cut and related problems. 192-208 - Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Bounding the total domination subdivision number of a graph in terms of its order. 209-218 - Guantao Chen, Xingxing Yu, Wenan Zang:
Approximating the chromatic index of multigraphs. 219-246 - Longcheng Liu, Biao Wu, Enyu Yao:
Minimizing the sum cost in linear extensions of a poset. 247-253 - Ehab Morsy, Hiroshi Nagamochi:
Approximating capacitated tree-routings in networks. 254-267
Volume 21, Number 3, April 2011
- Luis A. Dupont, Rafael H. Villarreal:
Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems. 269-292 - Deying Li, Qinghua Zhu:
Approximation algorithms for multicast routing in ad hoc wireless networks. 293-305 - Hend Bouziri, Khaled Mellouli, El-Ghazali Talbi:
The k-coloring fitness landscape. 306-329 - Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and algorithms for rainbow connection. 330-347 - Bader F. AlBdaiwi, Diptesh Ghosh, Boris Goldengorin:
Data aggregation for p-median problems. 348-363 - Danny Segev:
Approximating k-generalized connectivity via collapsing HSTs. 364-382 - Yi-Ching Chen, Kun-Mao Chao:
On the generalized constrained longest common subsequence problems. 383-392
Volume 21, Number 4, May 2011
- Sheng-Yi Cai, Qi-Fan Yang:
Semi-online scheduling on two uniform machines with the known largest size. 393-408 - Bin Ma, Louxin Zhang:
Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction. 409-422 - Frank K. Hwang, Uriel G. Rothblum:
On the number of separable partitions. 423-433 - Steffen Rebennack, Marcus Oswald, Dirk Oliver Theis, Hanna Seitz, Gerhard Reinelt, Panos M. Pardalos:
A Branch and Cut solver for the maximum stable set problem. 434-457 - György Dósa, Maria Grazia Speranza, Zsolt Tuza:
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling. 458-480 - Haoli Wang, Xirong Xu, Yuansheng Yang, Kai Lü:
On the distance paired domination of generalized Petersen graphs P(n, 1) and P(n, 2). 481-496 - Chen Liao, Shiyan Hu:
Approximation scheme for restricted discrete gate sizing targeting delay minimization. 497-510
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 2025-11-17 22:43 CET 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:
