Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 19
Volume 19, Number 1, January 2010
- Francis Sourd:
Lexicographically minimizing axial motions for the Euclidean TSP. 1-15 - Sun-Yuan Hsieh, Chang-Yu Wu:
Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults. 16-30 - Shiyan Hu:
An almost four-approximation algorithm for maximum weight triangulation. 31-42 - Çigdem Güler, Horst W. Hamacher:
Capacity inverse minimum cost flow problem. 43-59 - Hongxing Jiang, Liying Kang:
Total restrained domination in claw-free graphs. 60-68 - Sourour Elloumi:
A tighter formulation of the p-median problem. 69-83 - Shisheng Li, Jinjiang Yuan:
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan. 84-93 - William S. Kennedy, Hui Kong, Guohui Lin, Guiying Yan:
Linear time construction of 5-phylogenetic roots for tree chordal graphs. 94-106 - Zhenbo Wang, Wenxun Xing:
Worst-case analysis for on-line service policies. 107-122
Volume 19, Number 2, February 2010
- Yiqiao Wang, Weifan Wang:
Adjacent vertex distinguishing total colorings of outerplanar graphs. 123-133 - Zhixiang Chen, Bin Fu, John Abraham:
A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor. 134-157 - James J. Cochran, Martin S. Levy, Jeffrey D. Camm:
Bayesian coverage optimization models. 158-173 - Chen Wang, James Willson, Myung Ah Park, Andras Farago, Weili Wu:
On dual power assignment optimization for biconnectivity. 174-183 - Andrzej Dudek, Joanna Polcyn
, Andrzej Rucinski:
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence. 184-199 - Steffen Rebennack, Ashwin Arulselvan, Lily Elefteriadou, Panos M. Pardalos:
Complexity analysis for maximum flow problems with arc reversals. 200-216 - Lan Liu, Tao Jiang:
A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops. 217-240
Volume 19, Number 3, April 2010
- Igor S. Litvinchev, Socorro Rangel, Jania Saucedo:
A Lagrangian bound for many-to-many assignment problems. 241-257 - Bo Chen, Xujin Chen, Xiaodong Hu:
The price of atomic selfish ring routing. 258-278 - Eric McDermid, David F. Manlove:
Keeping partners together: algorithmic results for the hospitals/residents problem with couples. 279-303 - Tami Tamir, Benny Vaksendiser:
Algorithms for storage allocation based on client preferences. 304-324 - Roberto Rossi, S. Armagan Tarim, Brahim Hnich, Steven D. Prestwich, Semra Karacaer:
Scheduling internal audit activities: a stochastic combinatorial optimization problem. 325-346 - Yaron Leyvand, Dvir Shabtay, George Steiner, Liron Yedidsion:
Just-in-time scheduling with controllable processing times on parallel machines. 347-368 - Diana Fanghänel, Frauke Liers:
A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions. 369-393 - Teresa Gomes, José M. F. Craveirinha, Luísa Jorge:
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs. 394-414 - Nicolas Sonnerat, Adrian Vetta:
Galaxy cutsets in graphs. 415-427
Volume 19, Number 4, May 2010
- Ashkan Aazami:
Domination in graphs with bounded propagation: algorithms, formulations and hardness results. 429-456 - Lei Chen, Changhong Lu, Zhenbing Zeng:
Labelling algorithms for paired-domination problems in block and interval graphs. 457-470 - Weifan Wang, Yiqiao Wang:
Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. 471-485 - Tayuan Huang, Kaishun Wang, Chih-Wen Weng:
A class of error-correcting pooling designs over complexes. 486-491 - Jun Guo:
Pooling designs associated with unitary space and ratio efficiency comparison. 492-500 - Zhenhua Duan, Chen Yang:
Unconditional secure communication: a Russian Cards protocol. 501-530
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-03 20:49 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:
