default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 60
Volume 60, Number 1-3, 1995
- Endre Boros
:
Preface. 1 - Marion Alfter, Winfried Hochstättler:
On Pseudomodular Matroids and Adjoints. 3-11 - Fred S. Annexstein, John V. Franco:
Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram. 13-23 - Ansuman Bagchi, Brigitte Servatius, Weigeng Shi:
2-satisfiability and Diagnosing Faulty Processors in Massively Parallel Computing Systems. 25-37 - Jean-Pierre Barthélemy, Olivier Hudry, Garth Isaak, Fred S. Roberts, Barry A. Tesman:
The Reversing Number of a Digraph. 39-76 - Kenneth A. Berman, John V. Franco, John S. Schlipf:
Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. 77-91 - Kenneth P. Bogart, Joseph E. Bonin, Jutta Mitas:
Interval orders Based on Weak orders. 93-98 - Kenneth P. Bogart, Peter C. Fishburn, Garth Isaak, Larry J. Langley:
Proper and Unit Tolerance Graphs. 99-117 - Charles J. Colbourn, J. Scott Provan, Dirk Vertigan:
A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs. 119-129 - Ding-Zhu Du:
on Component-size Bounded Steiner Trees. 131-140 - Paul Erdös, Peter C. Fishburn:
Multiplicities of Interpoint Distances in Finite Planar Sets. 141-147 - Paul Erdös, Peter C. Fishburn:
Intervertex Distances in Convex Polygons. 149-158 - Giorgio Gallo, Daniele Pretolani:
A New Algorithm for the Propositional Satisfiability Problem. 159-179 - Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão:
Boole's Conditions of Possible Experience and Reasoning under Uncertainty. 181-193 - Alain Hertz:
Polynomially Solvable Cases for the Maximum Stable Set Problem. 195-210 - Kathy Williamson Hoke:
Extending Shelling orders and a Hierarchy of Functions of Unimodal Simple Polytopes. 211-217 - Frank K. Hwang:
The Time Complexity of Deterministic Broadcast Radio Networks. 219-222 - Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
Permuting Matrices to Avoid Forbidden Submatrices. 223-248 - Alexander Kogan:
on the Essential Test Sets of Discrete Matrices. 249-255 - Larry J. Langley:
A Recognition Algorithm for orders of Interval Dimension Two. 257-266 - Larry J. Langley:
Irreflexive and Reflexive Dimension. 267-273 - Felix Lazebnik, Vasiliy A. Ustimenko:
Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size. 275-284 - Xiaoyun Lu:
A Note on Biased and Non-biased Games. 285-291 - Zeev Nutov, Michal Penn:
on the Integral Dicycle Packings and Covers and the Linear ordering Polytope. 293-309 - Uri N. Peled, Feng Sun:
Enumeration of Difference Graphs. 311-318 - Stephen G. Penrice:
on-line Algorithms for ordered Sets and Comparability Graphs. 319-329 - Christophe Picouleau:
New Complexity Results on Scheduling with Small Communication Delays. 331-342 - Sanjay Rajpal:
on Paving Matroids and a Generalization of MDS Codes. 343-347 - Maciej M. Syslo:
on Some New Types of Greedy Chains and Greedy Linear Extensions of Partially ordered Sets. 349-358 - Ann N. Trenk:
Generalized Perfect Graphs: Characterizations and Inversion. 359-387
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-02-25 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
