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