Volume 59,
Number 1,
1995
- Francis T. Boesch, Xiaoming Li, José Rodriguez:
Graphs with Most Number of Three Point Induced Connected Subgraphs.
1-10
Electronic Edition (link) BibTeX
- Heidemarie Bräsel, David Kluge, Frank Werner:
A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints.
11-21
Electronic Edition (link) BibTeX
- Thomas Eiter, Pekka Kilpeläinen, Heikki Mannila:
Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete.
23-31
Electronic Edition (link) BibTeX
- Xin He, David B. Sher:
on Determining Non-isotopic Configurations of Points on a Circle.
33-50
Electronic Edition (link) BibTeX
- Johan Karlander:
Matrices Generated By Semilattices.
51-56
Electronic Edition (link) BibTeX
- Yves Pochet, Laurence A. Wolsey:
Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation.
57-74
Electronic Edition (link) BibTeX
- Vitaly A. Strusevich:
Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds.
75-86
Electronic Edition (link) BibTeX
- Jimmy J. M. Tan, Yuang-Cheh Hsueh:
A Generalization of the Stable Matching Problem.
87-102
Electronic Edition (link) BibTeX
Volume 59,
Number 2,
1995
Volume 59,
Number 3,
1995
Copyright © Sat May 16 23:55:11 2009
by Michael Ley (ley@uni-trier.de)
