Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 18
Volume 18, Number 1, July 2009
- Fatiha Bendali, Jean Mailfert:
Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron. 1-22 - Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Domination and total domination in complementary prisms. 23-37 - Qingqin Nong, Jinjiang Yuan, Yixun Lin:
The weighted link ring loading problem. 38-50 - Geng-sheng Zhang, Xiao-lei Sun, Bo-li Li:
Error-correcting pooling designs associated with the dual space of unitary space and ratio efficiency comparison. 51-63 - Xiaotie Deng
, Qizhi Fang, Xiaoxun Sun:
Finding nucleolus of flow game. 64-86 - Chunmei Liu, Yinglei Song:
Parameterized dominating set problem in chordal graphs: complexity and lower bound. 87-97
Volume 18, Number 2, August 2009
- Xiao-Feng Xie, Jiming Liu:
Graph coloring by multiagent fusion search. 99-123 - Christian Desrosiers, Philippe Galinier, Alain Hertz, Sandrine Paroz:
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. 124-150 - Djangir A. Babayev, George I. Bell, Urfat G. Nuriyev:
The bandpass problem: combinatorial optimization and library of problems. 151-172 - Ning Li, Xinmin Hou:
On the total {k}-domination number of Cartesian products of graphs. 173-178 - Yaochun Huang, Xiaofeng Gao, Zhao Zhang, Weili Wu:
A better constant-factor approximation for weighted dominating set in unit disk graph. 179-194 - Yinfeng Xu, Maolin Hu, Bing Su, Binhai Zhu, Zhijun Zhu:
The canadian traveller problem and its competitive analysis. 195-205
Volume 18, Number 3, October 2009
- Véronique Bruyère, Hadrien Mélot:
Fibonacci index and stability number of graphs: a polyhedral study. 207-228 - Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. 229-257 - Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong Chwa:
A 6.55 factor primal-dual approximation algorithm for the connected facility location problem. 258-271 - Maren Martens, Martin Skutella:
Flows with unit path capacities and related packing and covering problems. 272-293 - Peter Damaschke:
Multiple hypernode hitting sets and smallest two-cores with targets. 294-306 - Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu:
On recovering syntenic blocks from comparative maps. 307-318
Volume 18, Number 4, November 2009
- Henning Fernau, Daniel Raible:
A parameterized perspective on packing paths of length two. 319-341 - Feng Zou, Xianyue Li, Suogang Gao, Weili Wu:
Node-weighted Steiner tree approximation in unit disk graphs. 342-349 - Margaret-Ellen Messinger, Richard J. Nowakowski:
The robot cleans up. 350-361 - Patricia A. Evans, Todd Wareham, Rhonda Chaytor:
Fixed-parameter tractability of anonymizing data by suppressing entries. 362-375 - René Brandenberg, Lucia Roth:
New algorithms for k-center and extensions. 376-392 - Bin Fu, Zhiyu Zhao:
Separating sublinear time computations by approximate diameter. 393-416 - Caterina De Simone, Anna Galluccio:
Edge-colouring of joins of regular graphs, I. 417-428
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-18 21:19 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:
