Discrete Applied Mathematics, Volume 62

Volume 62, Number 1-3, 1995

• Mario Lucertini, Giovanni Rinaldi, Antonio Sassano, Bruno Simeone:
  Preface. 1-3
  Electronic Edition (link) BibTeX
• Giovanni Andreatta, Francesco Mason:
  Path Covering Problems and Testing of Printed Circuits. 5-13
  Electronic Edition (link) BibTeX
• Ronald I. Becker, Yehoshua Perl:
  The Shifting Algorithm Technique for the Partitioning of Trees. 15-34
  Electronic Edition (link) BibTeX
• Lucio Bianco, Paolo Dell'Olmo, Maria Grazia Speranza:
  Scheduling Independent Tasks with Multiple Modes. 35-50
  Electronic Edition (link) BibTeX
• Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
  Decomposability of Partially Defined Boolean Functions. 51-75
  Electronic Edition (link) BibTeX
• Peter Brucker:
  Efficient Algorithms for Some Path Partitioning Problems. 77-85
  Electronic Edition (link) BibTeX
• Sunil Chopra:
  Compositions for Matroids with the Fulkerson Property. 87-101
  Electronic Edition (link) BibTeX
• Michele Conforti, Gérard Cornuéjols, M. R. Rao:
  Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. 103-117
  Electronic Edition (link) BibTeX
• Dragos Cvetkovic, Peter Rowlinson, Slobodan K. Simic:
  on Some Algorithmic Investigations of Star Partitions of Graphs. 119-130
  Electronic Edition (link) BibTeX
• Madlaine Davis-Moradkhan, Catherine Roucairol:
  Graph Partitioning Applied to the Logic Testing of Combinational Circuits. 131-165
  Electronic Edition (link) BibTeX
• Cid C. de Souza, M. Laurent:
  Some New Classes of Facets for the Equicut Polytope. 167-191
  Electronic Edition (link) BibTeX
• Reinhardt Euler, Hervé Le Verge:
  Complete Linear Descriptions of Small Asymmetric Traveling Salesman Polytopes. 193-208
  Electronic Edition (link) BibTeX
• Ali Ridha Mahjoub:
  A Min-max Relation for K₃-covers in Graphs Noncontractible to K₅e. 209-219
  Electronic Edition (link) BibTeX
• Aristide Mingozzi, Salvatore Ricciardelli, Massimo Spadoni:
  Partitioning a Matrix to Minimize the Maximum Cost. 221-248
  Electronic Edition (link) BibTeX
• Svatopluk Poljak, Franz Rendl:
  Solving the Max-cut Problem Using Eigenvalues. 249-278
  Electronic Edition (link) BibTeX
• Gottfried Tinhofer:
  Bin-packing and Matchings in Threshold Graphs. 279-289
  Electronic Edition (link) BibTeX