Journal of Combinatorial Optimization, Volume 22

Volume 22, Number 1, July 2011

• Michael A. Henning, John McCoy:
  Which trees have a differentiating-paired dominating set? 1-18
  
• Wei-Chu Weng:
  A special combinatorial problem: pitch arrangement for pneumatic tires. 19-34
  
• Nikita Boyko, Timofey Turko, Vladimir Boginski, David E. Jeffcoat, Stanislav Uryasev, Grigoriy Zrazhevsky, Panos M. Pardalos:
  Robust multi-sensor scheduling for multi-site surveillance. 35-51
  
• Yam Ki Cheung, Ovidiu Daescu:
  Line facility location in weighted regions. 52-70
  
• Guohui Lin:
  On the Bandpass problem. 71-77
  
• Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
  Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. 78-96
  
• Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
  Anonymizing binary and small tables is hard to approximate. 97-119
  

Volume 22, Number 2, August 2011

• Heinz Gröflin, Dinh-Nguyen Pham, Reinhard Bürgy:
  The flexible blocking job shop with transfer and set-up times. 121-144
  
• Fei-huang Chang, Huilan Chang, Frank K. Hwang:
  Pooling designs for clone library screening in the inhibitor complex model. 145-152
  
• Hongying Li, Chunjie Su:
  An optimal semi-online algorithm for 2-machine scheduling with an availability constraint. 153-165
  
• Johannes H. Hattingh, Ernst J. Joubert:
  Restrained domination in cubic graphs. 166-179
  
• José Fernando Gonçalves, Mauricio G. C. Resende:
  A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. 180-201
  
• Lasse Nisted, David Pisinger, Avri Altman:
  Optimal wafer cutting in shuttle layout problems. 202-216
  
• Justin Southey, Michael A. Henning:
  A characterization of graphs with disjoint dominating and paired-dominating sets. 217-234
  
• Paul Dorbec, Michael A. Henning:
  Upper paired-domination in claw-free graphs. 235-251
  
• Ailin Hou, Shuchao Li, Lanzhen Song, Bing Wei:
  Sharp bounds for Zagreb indices of maximal outerplanar graphs. 252-269
  
• Huilan Chang, Hong-Bin Chen, Hung-Lin Fu, Chie-Huai Shi:
  Reconstruction of hidden graphs and threshold group testing. 270-281
  
• Guangjun Xu, Liying Kang:
  On the power domination number of the generalized Petersen graphs. 282-291
  

Volume 22, Number 3, October 2011

• Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf:
  On the readability of monotone Boolean formulae. 293-304
  
• Jin-yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul Barford:
  Honeynet games: a game theoretic approach to defending network monitors. 305-324
  
• Scott Diehl, Dieter van Melkebeek, Ryan Williams:
  An improved time-space lower bound for tautologies. 325-338
  
• Eric McDermid, Robert W. Irving:
  Popular matchings: structure and algorithms. 339-358
  
• Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
  Online tree node assignment with resource augmentation. 359-377
  
• Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
  On the performances of Nash equilibria in isolation games. 378-391
  
• Masaki Yamamoto, Shuji Kijima, Yasuko Matsui:
  A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. 392-408
  
• Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
  Convex partitions with 2-edge connected dual graphs. 409-425
  
• Kenneth A. Berman, Chad Yoshikawa:
  Why locally-fair maximal flows in client-server networks perform well. 426-437
  
• Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan:
  Strongly chordal and chordal bipartite graphs are sandwich monotone. 438-456
  
• Ivona Bezáková, Nayantara Bhatnagar, Dana Randall:
  On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries. 457-468
  
• Stefan S. Dantchev, Tom Friedetzky, Lars Nagel:
  Sublinear-time algorithms for tournament graphs. 469-481
  
• Bin Fu, Angsheng Li, Liyu Zhang:
  Separating NE from some nonuniform nondeterministic complexity classes. 482-493
  

Volume 22, Number 4, November 2011

• Ping Zhao, Kefeng Diao, Kaishun Wang:
  A generalization of Macula's disjunct matrices. 495-498
  
• Wu-Hsiung Lin, Gerard J. Chang:
  Resource-sharing systems and hypergraph colorings. 499-508
  
• Yang Fang, Peihai Liu, Xiwen Lu:
  Optimal on-line algorithms for one batch machine with grouped processing times. 509-516
  
• Sergey Bereg, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Inmaculada Ventura:
  The Maximum Box Problem for moving points in the plane. 517-530
  
• Leah Epstein, Sven Oliver Krumke, Asaf Levin, Heike Sperber:
  Selfish bin coloring. 531-548
  
• Zhao Zhang, Bing Wang:
  Super cyclically edge connected transitive graphs. 549-562
  
• Yu-Chi Liu, Jun-Jie Pan:
  On the vertex characterization of single-shape partition polytopes. 563-571
  
• Wanpracha Art Chaovalitwongse, Carlos A. S. Oliveira, Bruno Chiarini, Panos M. Pardalos, Mauricio G. C. Resende:
  Revised GRASP with path-relinking for the linear ordering problem. 572-593
  
• Diana Fanghänel:
  Optimality conditions for a bilevel matroid problem. 594-608
  
• Céline Engelbeen, Samuel Fiorini, Antje Kiesel:
  A closest vector problem arising in radiation therapy planning. 609-629
  
• Yu-Ki Chan, Minming Li, Weiwei Wu:
  Optimal tree structure with loyal users and batch updates. 630-639
  
• Benjamin McClosky, Anthony Simms, Illya V. Hicks:
  Co-2-plex polynomials. 640-650
  
• Juan Liu, Xindong Zhang, Jixiang Meng:
  On domination number of Cartesian product of directed paths. 651-662
  
• Lidan Fan, Zhao Zhang, Wei Wang:
  PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs. 663-673
  
• Xiao Min, Jing Liu, Yuqing Wang:
  Optimal semi-online algorithm for scheduling with rejection on two uniform machines. 674-683
  
• Chunmei Liu, Yinglei Song:
  Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs. 684-698
  
• Dongdong Ge, Simai He, Yinyu Ye, Jiawei Zhang:
  Geometric rounding: a dependent randomized rounding scheme. 699-725
  
• Huaming Zhang, Sadish Sadasivam:
  Improved floor-planning of graphs via adjacency-preserving transformations. 726-746
  
• Neng Fan, Panos M. Pardalos:
  A rearrangement of adjacency matrix based approach for solving the crossing minimization problem. 747-762
  
• Donald Stanley, Boting Yang:
  Fast searching games on graphs. 763-777
  
• Kang Ning, Hon Wai Leong:
  The multiple sequence sets: problem and heuristic algorithms. 778-796
  
• Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo:
  Minimizing makespan in an ordered flow shop with machine-dependent processing times. 797-818
  
• Karine Deschinkel, Sid Ahmed Ali Touati, Sébastien Briais:
  SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling. 819-844
  
• Rainer E. Burkard, Roswitha Rissner:
  Polynomially solvable special cases of the quadratic bottleneck assignment problem. 845-856
  
• Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
  Minimum d-blockers and d-transversals in graphs. 857-872
  
• Ilias S. Kotsireas, Christos Koukouvinos, Panos M. Pardalos:
  A modified power spectral density test applied to weighing matrices with small weight. 873-881
  
• Carlos J. Luz:
  Improving an upper bound on the size of k-regular induced subgraphs. 882-894
  

Last update Thu May 23 19:06:17 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page