Journal: Discrete Applied Mathematics

Volume 145, Issue 3

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

Volume 145, Issue 2

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

Volume 145, Issue 1

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