default search action
Discrete Applied Mathematics, Volume 56
Volume 56, Number 1, 1995
- Martin Cohn:
on the Channel Capacity of Read/write Isolated Memory. 1-8 - Matteo Fischetti:
Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope. 9-18 - Steven B. Horton, R. Gary Parker:
on Halin Subgraphs and Supergraphs. 19-35 - Rajeev Kohli, Ramesh Krishnamurti:
Joint Performance of Greedy Heuristics for the Integer Knapsack Problem. 37-48 - Alain Leblanc:
Finding Degeneracies Among Sets of Lines. 49-60 - Nancy Norris:
Universal Covers of Graphs: Isomorphism to Depth N-1 Implies Isomorphism to All Depths. 61-74 - Jennifer Ryan:
The Depth and Width of Local Minima in Discrete Solution Spaces. 75-82 - David Blokh, Gregory Z. Gutin:
Maximizing Traveling Salesman Problem for Special Matrices. 83-86 - David C. Fisher, Jennifer Ryan:
Probabilities Within optimal Strategies for Tournament Games. 87-91 - Erich Prisner:
Clique Covering and Clique Partition in Generalizations of Line Graphs. 93-98
Volume 56, Number 2-3, 1995
- Komei Fukuda, Toshihide Ibaraki:
Preface. 99-100 - Yasukazu Aoki:
Probing the Arrangement of Hyperplanes. 101-125 - Dominique Barth, Johny Bond, André Raspaud:
Compatible Eulerian Circuits in Kn**. 127-136 - Peng Cheng, Shigeru Masuyama:
A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs. 137-155 - Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl:
Bipolar orientations Revisited. 157-179 - Michel Deza, Viatcheslav P. Grishukhin:
L-polytopes and Equiangular Lines. 181-214 - Michel Deza, Monique Laurent:
Hypercube Embedding of Generalized Bipartite Metrics. 215-230 - Komei Fukuda, Makoto Namiki:
Finding All Common Bases in Two Matroids. 231-243 - Masazumi Hanazawa, Hiroshi Narushima, Nobuhiro Minaka:
Generating Most Parsimonious Reconstructions on a Tree: A Generalization of the Farris-Swofford-Maddison Method. 245-265 - Alexander V. Karzanov:
Half-integral Flows in a Planar Graph with Four Holes. 267-295 - Yannis Manoussakis:
Alternating Paths in Edge-colored Complete Graphs. 297-309 - Tomomi Matsui, Sunao Tamura:
Adjacency on Combinatorial Polyhedra. 311-321 - Seiya Negami, Kenichi Kawagoe:
Polynomial Invariants of Graphs with State Models. 323-331 - Maiko Shigeno, Yasufumi Saruwatari, Tomomi Matsui:
An Algorithm for Fractional Assignment Problems. 333-343
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.