Discrete Applied Mathematics, Volume 145

Volume 145, Number 1, December 2004

• Michel Gendreau, Alain Hertz, Frédéric Semet, Marino Widmer:
  Preface. 1-2
  
• Vladimir E. Alekseev, Vadim V. Lozin:
  Augmenting graphs for independent sets. 3-10
  
• Gabriela Alexe, Sorin Alexe, Yves Crama, Stephan Foldes, Peter L. Hammer, Bruno Simeone:
  Consensus algorithms for the generation of all maximal bicliques. 11-21
  
• Shoshana Anily, Julien Bramel:
  An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem. 22-39
  
• Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Wojciech T. Markiewicz:
  Sequencing by hybridization with isothermic oligonucleotide libraries. 40-51
  
• Endre Boros, Isabella Lari, Bruno Simeone:
  Block linear majorants in quadratic 0-1 optimization. 52-71
  
• Teresa Cáceres, M. Cruz López-de-los-Mozos, Juan A. Mesa:
  The path-variance problem on tree networks. 72-79
  
• Jacques Carlier, Eric Pinson:
  Jackson's pseudo-preemptive schedule and cumulative scheduling problems. 80-94
  
• Krzysztof Giaro, Marek Kubale:
  Compact scheduling of zero-one time operations in multi-stage systems. 95-103
  
• Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn:
  Adapting polyhedral properties from facility to hub location problems. 104-116
  
• Pierre Hansen, Nenad Mladenovic, Dragan Urosevic:
  Variable neighborhood search for the maximum clique. 117-125
  
• Hipólito Hernández-Pérez, Juan José Salazar González:
  A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. 126-139
  

Volume 145, Number 2, January 2005

• Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra:
  Structural decompositions, width parameters, and graph labelings. 141-142
  
• Hans L. Bodlaender, Fedor V. Fomin:
  Tree decompositions with small cost. 143-154
  
• Andreas Brandstädt, Dieter Kratsch:
  On the structure of (P₅, gem)-free graphs. 155-166
  
• Reinhard Diestel, Daniela Kühn:
  Graph minor hierarchies. 167-182
  
• Michel Habib, Christophe Paul:
  A simple linear time algorithm for cograph recognition. 183-197
  
• Ross M. McConnell, Fabien de Montgolfier:
  Linear-time modular decomposition of directed graphs. 198-209
  
• Jan Arne Telle:
  Tree-decompositions of small pathwidth. 210-218
  
• Jochen Alber, Frederic Dorn, Rolf Niedermeier:
  Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. 219-231
  
• Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca:
  Chordal co-gem-free and (P₅, gem)-free graphs have bounded clique-width. 232-241
  
• Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde:
  Embeddings of k-connected graphs of pathwidth k. 242-265
  
• Ton Kloks, Jan Kratochvíl, Haiko Müller:
  Computing the branchwidth of interval graphs. 266-275
  
• Johann A. Makowsky:
  Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width. 276-290
  
• Zsolt Tuza:
  Strong branchwidth and local transversals. 291-296
  
• Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
  The restrictive H-coloring problem. 297-305
  
• Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
  Systems of distant representatives. 306-316
  
• Pranava K. Jha, Sandi Klavzar, Aleksander Vesel:
  L(2, 1)-labeling of direct product of paths and cycles. 317-325
  
• Daniel Král:
  An exact algorithm for the channel assignment problem. 326-331
  

Volume 145, Number 3, January 2005

• Nathalie Caspard, Bernard Monjardet:
  Erratum to: The lattice of closure systems, closure operators and implicational systems on a finite set: a survey: [Discrete Applied Mathematics 127(2) (2003) 241-269]. 333
  
• M. Selim Akturk, Hakan Gultekin, Oya Ekin Karasan:
  Robotic cell scheduling with operational flexibility. 334-348
  
• William Y. C. Chen, David C. Torney:
  Equivalence classes of matchings and lattice-square designs. 349-357
  
• Raymond Robb:
  On the mean radius of permutation polytopes. 358-367
  
• Sébastien Choplin, Aubin Jarry, Stéphane Pérennes:
  Virtual network embedding in the cycle. 368-375
  
• Geir T. Helleloid:
  Connected triangle-free m-step competition graphs. 376-383
  
• Michal Katz, Nir A. Katz, David Peleg:
  Distance labeling schemes for well-separated graph classes. 384-402
  
• Daniel Krob, Ekaterina A. Vassilieva:
  Performance evaluation of demodulation with diversity--a combinatorial approach II: bijective methods. 403-421
  
• Dengxin Li, Hong-Jian Lai, Mingquan Zhan:
  Eulerian subgraphs and Hamilton-connected line graphs. 422-428
  
• Jun-Jie Pan, Gerard J. Chang:
  Path partition for graphs with special blocks. 429-436
  
• Juan Rada:
  Energy ordering of catacondensed hexagonal systems. 437-443
  
• András Prékopa, Linchun Gao:
  Bounding the probability of the union of events by aggregation and disaggregation in linear programs. 444-454
  
• Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
  The algebraic Monge property and path problems. 455-464
  
• Fang-Wei Fu, San Ling, Chaoping Xing:
  On the variance of average distance of subsets in the Hamming space. 465-478
  
• Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya:
  Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. 479-482
  
• Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach:
  A note on the number of matchings and independent sets in trees. 483-489
  
• Xinmin Hou, Min Xu, Jun-Ming Xu:
  Forwarding indices of folded n-cubes. 490-492
  
• Yi Wang:
  Nested chain partitions of LYM posets. 403-497
  
• Mingyuan Xia, Tianbing Xia, Jennifer Seberry, Jing Wu:
  An infinite family of Goethals-Seidel arrays. 498-504
  

Last update Wed May 22 17:26:47 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page