Volume 60,
Number 1-3,
1995
- Endre Boros:
Preface.
1
Electronic Edition (link) BibTeX
- Marion Alfter, Winfried Hochstättler:
On Pseudomodular Matroids and Adjoints.
3-11
Electronic Edition (link) BibTeX
- Fred S. Annexstein, John V. Franco:
Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram.
13-23
Electronic Edition (link) BibTeX
- Ansuman Bagchi, Brigitte Servatius, Weigeng Shi:
2-satisfiability and Diagnosing Faulty Processors in Massively Parallel Computing Systems.
25-37
Electronic Edition (link) BibTeX
- Jean-Pierre Barthélemy, Olivier Hudry, Garth Isaak, Fred S. Roberts, Barry A. Tesman:
The Reversing Number of a Digraph.
39-76
Electronic Edition (link) BibTeX
- Kenneth A. Berman, John V. Franco, John S. Schlipf:
Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time.
77-91
Electronic Edition (link) BibTeX
- Kenneth P. Bogart, Joseph E. Bonin, Jutta Mitas:
Interval orders Based on Weak orders.
93-98
Electronic Edition (link) BibTeX
- Kenneth P. Bogart, Peter C. Fishburn, Garth Isaak, Larry J. Langley:
Proper and Unit Tolerance Graphs.
99-117
Electronic Edition (link) BibTeX
- Charles J. Colbourn, J. Scott Provan, Dirk Vertigan:
A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs.
119-129
Electronic Edition (link) BibTeX
- Ding-Zhu Du:
on Component-size Bounded Steiner Trees.
131-140
Electronic Edition (link) BibTeX
- Paul Erdös, Peter C. Fishburn:
Multiplicities of Interpoint Distances in Finite Planar Sets.
141-147
Electronic Edition (link) BibTeX
- Paul Erdös, Peter C. Fishburn:
Intervertex Distances in Convex Polygons.
149-158
Electronic Edition (link) BibTeX
- Giorgio Gallo, Daniele Pretolani:
A New Algorithm for the Propositional Satisfiability Problem.
159-179
Electronic Edition (link) BibTeX
- Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão:
Boole's Conditions of Possible Experience and Reasoning under Uncertainty.
181-193
Electronic Edition (link) BibTeX
- Alain Hertz:
Polynomially Solvable Cases for the Maximum Stable Set Problem.
195-210
Electronic Edition (link) BibTeX
- Kathy Williamson Hoke:
Extending Shelling orders and a Hierarchy of Functions of Unimodal Simple Polytopes.
211-217
Electronic Edition (link) BibTeX
- Frank K. Hwang:
The Time Complexity of Deterministic Broadcast Radio Networks.
219-222
Electronic Edition (link) BibTeX
- Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
Permuting Matrices to Avoid Forbidden Submatrices.
223-248
Electronic Edition (link) BibTeX
- Alexander Kogan:
on the Essential Test Sets of Discrete Matrices.
249-255
Electronic Edition (link) BibTeX
- Larry J. Langley:
A Recognition Algorithm for orders of Interval Dimension Two.
257-266
Electronic Edition (link) BibTeX
- Larry J. Langley:
Irreflexive and Reflexive Dimension.
267-273
Electronic Edition (link) BibTeX
- Felix Lazebnik, Vasiliy A. Ustimenko:
Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size.
275-284
Electronic Edition (link) BibTeX
- Xiaoyun Lu:
A Note on Biased and Non-biased Games.
285-291
Electronic Edition (link) BibTeX
- Zeev Nutov, Michal Penn:
on the Integral Dicycle Packings and Covers and the Linear ordering Polytope.
293-309
Electronic Edition (link) BibTeX
- Uri N. Peled, Feng Sun:
Enumeration of Difference Graphs.
311-318
Electronic Edition (link) BibTeX
- Stephen G. Penrice:
on-line Algorithms for ordered Sets and Comparability Graphs.
319-329
Electronic Edition (link) BibTeX
- Cedric Picouleau:
New Complexity Results on Scheduling with Small Communication Delays.
331-342
Electronic Edition (link) BibTeX
- Sanjay Rajpal:
on Paving Matroids and a Generalization of MDS Codes.
343-347
Electronic Edition (link) BibTeX
- Maciej M. Syslo:
on Some New Types of Greedy Chains and Greedy Linear Extensions of Partially ordered Sets.
349-358
Electronic Edition (link) BibTeX
- Ann N. Trenk:
Generalized Perfect Graphs: Characterizations and Inversion.
359-387
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:55:11 2009
by Michael Ley (ley@uni-trier.de)