Volume 145,
Number 1,
December 2004
Graph Optimization IV
- Michel Gendreau, Alain Hertz, Frédéric Semet, Marino Widmer:
Preface.
1-2
Electronic Edition (link) BibTeX
- Vladimir E. Alekseev, Vadim V. Lozin:
Augmenting graphs for independent sets.
3-10
Electronic Edition (link) BibTeX
- Gabriela Alexe, Sorin Alexe, Yves Crama, Stephan Foldes, Peter L. Hammer, Bruno Simeone:
Consensus algorithms for the generation of all maximal bicliques.
11-21
Electronic Edition (link) BibTeX
- Shoshana Anily, Julien Bramel:
An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem.
22-39
Electronic Edition (link) BibTeX
- Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Wojciech T. Markiewicz:
Sequencing by hybridization with isothermic oligonucleotide libraries.
40-51
Electronic Edition (link) BibTeX
- Endre Boros, Isabella Lari, Bruno Simeone:
Block linear majorants in quadratic 0-1 optimization.
52-71
Electronic Edition (link) BibTeX
- Teresa Cáceres, M. Cruz López-de-los-Mozos, Juan A. Mesa:
The path-variance problem on tree networks.
72-79
Electronic Edition (link) BibTeX
- Jacques Carlier, Eric Pinson:
Jackson's pseudo-preemptive schedule and cumulative scheduling problems.
80-94
Electronic Edition (link) BibTeX
- Krzysztof Giaro, Marek Kubale:
Compact scheduling of zero-one time operations in multi-stage systems.
95-103
Electronic Edition (link) BibTeX
- Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn:
Adapting polyhedral properties from facility to hub location problems.
104-116
Electronic Edition (link) BibTeX
- Pierre Hansen, Nenad Mladenovic, Dragan Urosevic:
Variable neighborhood search for the maximum clique.
117-125
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
Volume 145,
Number 2,
January 2005
Structural Decompositions,
Width Parameters,
and Graph Labelings
- Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra:
Structural decompositions, width parameters, and graph labelings.
141-142
Electronic Edition (link) BibTeX
- Hans L. Bodlaender, Fedor V. Fomin:
Tree decompositions with small cost.
143-154
Electronic Edition (link) BibTeX
- Andreas Brandstädt, Dieter Kratsch:
On the structure of (P5, gem)-free graphs.
155-166
Electronic Edition (link) BibTeX
- Reinhard Diestel, Daniela Kühn:
Graph minor hierarchies.
167-182
Electronic Edition (link) BibTeX
- Michel Habib, Christophe Paul:
A simple linear time algorithm for cograph recognition.
183-197
Electronic Edition (link) BibTeX
- Ross M. McConnell, Fabien de Montgolfier:
Linear-time modular decomposition of directed graphs.
198-209
Electronic Edition (link) BibTeX
- Jan Arne Telle:
Tree-decompositions of small pathwidth.
210-218
Electronic Edition (link) BibTeX
- Jochen Alber, Frederic Dorn, Rolf Niedermeier:
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs.
219-231
Electronic Edition (link) BibTeX
- Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca:
Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width.
232-241
Electronic Edition (link) BibTeX
- Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde:
Embeddings of k-connected graphs of pathwidth k.
242-265
Electronic Edition (link) BibTeX
- Ton Kloks, Jan Kratochvíl, Haiko Müller:
Computing the branchwidth of interval graphs.
266-275
Electronic Edition (link) BibTeX
- Johann A. Makowsky:
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width.
276-290
Electronic Edition (link) BibTeX
- Zsolt Tuza:
Strong branchwidth and local transversals.
291-296
Electronic Edition (link) BibTeX
- Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
The restrictive H-coloring problem.
297-305
Electronic Edition (link) BibTeX
- Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
Systems of distant representatives.
306-316
Electronic Edition (link) BibTeX
- Pranava K. Jha, Sandi Klavzar, Aleksander Vesel:
L(2, 1)-labeling of direct product of paths and cycles.
317-325
Electronic Edition (link) BibTeX
- Daniel Král:
An exact algorithm for the channel assignment problem.
326-331
Electronic Edition (link) BibTeX
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
Electronic Edition (link) BibTeX
- M. Selim Akturk, Hakan Gultekin, Oya Ekin Karasan:
Robotic cell scheduling with operational flexibility.
334-348
Electronic Edition (link) BibTeX
- William Y. C. Chen, David C. Torney:
Equivalence classes of matchings and lattice-square designs.
349-357
Electronic Edition (link) BibTeX
- Raymond Robb:
On the mean radius of permutation polytopes.
358-367
Electronic Edition (link) BibTeX
- Sébastien Choplin, Aubin Jarry, Stéphane Pérennes:
Virtual network embedding in the cycle.
368-375
Electronic Edition (link) BibTeX
- Geir T. Helleloid:
Connected triangle-free m-step competition graphs.
376-383
Electronic Edition (link) BibTeX
- Michal Katz, Nir A. Katz, David Peleg:
Distance labeling schemes for well-separated graph classes.
384-402
Electronic Edition (link) BibTeX
- Daniel Krob, Ekaterina A. Vassilieva:
Performance evaluation of demodulation with diversity--a combinatorial approach II: bijective methods.
403-421
Electronic Edition (link) BibTeX
- Dengxin Li, Hong-Jian Lai, Mingquan Zhan:
Eulerian subgraphs and Hamilton-connected line graphs.
422-428
Electronic Edition (link) BibTeX
- Jun-Jie Pan, Gerard J. Chang:
Path partition for graphs with special blocks.
429-436
Electronic Edition (link) BibTeX
- Juan Rada:
Energy ordering of catacondensed hexagonal systems.
437-443
Electronic Edition (link) BibTeX
- András Prékopa, Linchun Gao:
Bounding the probability of the union of events by aggregation and disaggregation in linear programs.
444-454
Electronic Edition (link) BibTeX
- Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
The algebraic Monge property and path problems.
455-464
Electronic Edition (link) BibTeX
- Fang-Wei Fu, San Ling, Chaoping Xing:
On the variance of average distance of subsets in the Hamming space.
465-478
Electronic Edition (link) BibTeX
- Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya:
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs.
479-482
Electronic Edition (link) BibTeX
- Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach:
A note on the number of matchings and independent sets in trees.
483-489
Electronic Edition (link) BibTeX
- Xin-Min Hou, Min Xu, Jun-Ming Xu:
Forwarding indices of folded n-cubes.
490-492
Electronic Edition (link) BibTeX
- Yi Wang:
Nested chain partitions of LYM posets.
403-497
Electronic Edition (link) BibTeX
- Mingyuan Xia, Tianbing Xia, Jennifer Seberry, Jing Wu:
An infinite family of Goethals-Seidel arrays.
498-504
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:55:17 2009
by Michael Ley (ley@uni-trier.de)
