Discrete Applied Mathematics, Volume 56

Volume 56, Number 1, 1995

• Martin Cohn:
  on the Channel Capacity of Read/write Isolated Memory. 1-8
  Electronic Edition (link) BibTeX
• Matteo Fischetti:
  Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope. 9-18
  Electronic Edition (link) BibTeX
• Steven B. Horton, R. Gary Parker:
  on Halin Subgraphs and Supergraphs. 19-35
  Electronic Edition (link) BibTeX
• Rajeev Kohli, Ramesh Krishnamurti:
  Joint Performance of Greedy Heuristics for the Integer Knapsack Problem. 37-48
  Electronic Edition (link) BibTeX
• Alain Leblanc:
  Finding Degeneracies Among Sets of Lines. 49-60
  Electronic Edition (link) BibTeX
• Nancy Norris:
  Universal Covers of Graphs: Isomorphism to Depth N-1 Implies Isomorphism to All Depths. 61-74
  Electronic Edition (link) BibTeX
• Jennifer Ryan:
  The Depth and Width of Local Minima in Discrete Solution Spaces. 75-82
  Electronic Edition (link) BibTeX
• David Blokh, Gregory Gutin:
  Maximizing Traveling Salesman Problem for Special Matrices. 83-86
  Electronic Edition (link) BibTeX
• David C. Fisher, Jennifer Ryan:
  Probabilities Within optimal Strategies for Tournament Games. 87-91
  Electronic Edition (link) BibTeX
• Erich Prisner:
  Clique Covering and Clique Partition in Generalizations of Line Graphs. 93-98
  Electronic Edition (link) BibTeX

Volume 56, Number 2-3, 1995

• Komei Fukuda, Toshihide Ibaraki:
  Preface. 99-100
  Electronic Edition (link) BibTeX
• Yasukazu Aoki:
  Probing the Arrangement of Hyperplanes. 101-125
  Electronic Edition (link) BibTeX
• Dominique Barth, Johny Bond, André Raspaud:
  Compatible Eulerian Circuits in K_n**. 127-136
  Electronic Edition (link) BibTeX
• Peng Cheng, Shigeru Masuyama:
  A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs. 137-155
  Electronic Edition (link) BibTeX
• Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl:
  Bipolar orientations Revisited. 157-179
  Electronic Edition (link) BibTeX
• Michel Deza, Viatcheslav P. Grishukhin:
  L-polytopes and Equiangular Lines. 181-214
  Electronic Edition (link) BibTeX
• Michel Deza, Monique Laurent:
  Hypercube Embedding of Generalized Bipartite Metrics. 215-230
  Electronic Edition (link) BibTeX
• Komei Fukuda, Makoto Namiki:
  Finding All Common Bases in Two Matroids. 231-243
  Electronic Edition (link) BibTeX
• Masazumi Hanazawa, Hiroshi Narushima, Nobuhiro Minaka:
  Generating Most Parsimonious Reconstructions on a Tree: A Generalization of the Farris-Swofford-Maddison Method. 245-265
  Electronic Edition (link) BibTeX
• Alexander V. Karzanov:
  Half-integral Flows in a Planar Graph with Four Holes. 267-295
  Electronic Edition (link) BibTeX
• Yannis Manoussakis:
  Alternating Paths in Edge-colored Complete Graphs. 297-309
  Electronic Edition (link) BibTeX
• Tomomi Matsui, Sunao Tamura:
  Adjacency on Combinatorial Polyhedra. 311-321
  Electronic Edition (link) BibTeX
• Seiya Negami, Kenichi Kawagoe:
  Polynomial Invariants of Graphs with State Models. 323-331
  Electronic Edition (link) BibTeX
• Maiko Shigeno, Yasufumi Saruwatari, Tomomi Matsui:
  An Algorithm for Fractional Assignment Problems. 333-343
  Electronic Edition (link) BibTeX