Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Discrete Appl.~Math. AND Volume=56
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the channel capacity of read/write isolated memory
Martin Cohn
Discrete Applied Mathematics
56
, 1995, pp. 1-8
Clique tree inequalities define facets of the asymmmetric traveling salesman polytope
Matteo Fischetti
Discrete Applied Mathematics
56
, 1995, pp. 9-18
On Halin subgraphs and supergraphs
S.B. Horton
,
R. Gary Parker
Discrete Applied Mathematics
56
, 1995, pp. 19-35
Joint performance of greedy heuristics for the integer knapsack problem
Rajeev Kohli
,
Ramesh Krishnamurti
Discrete Applied Mathematics
56
, 1995, pp. 37-48
Finding degeneracies among sets of lines
Alain Leblanc
Discrete Applied Mathematics
56
, 1995, pp. 49-60
Universal covers of graphs: Isomorphism to depth
n-1
implies isomorphism to all depths
N. Norris
Discrete Applied Mathematics
56
, 1995, pp. 61-74
The depth and width of local minima in discrete solution spaces
Jennifer Ryan
Discrete Applied Mathematics
56
, 1995, pp. 75-82
Maximizing traveling salesman problem for special matrices
D. Blokh
,
G. Gutin
Discrete Applied Mathematics
56
, 1995, pp. 83-86
Probabilities within optimal strategies for tournament games
David C. Fisher
,
Jennifer Ryan
Discrete Applied Mathematics
56
, 1995, pp. 87-91
Clique covering and clique partition in generalizations of line graphs
Erich Prisner
Discrete Applied Mathematics
56
, 1995, pp. 93-98
Probing the arrangement of hyperplanes
Yasukazu Aoki
Discrete Applied Mathematics
56
, 1995, pp. 101-125
Compatible eulerian circuits in
K_n^{**}
D. Barth
,
J. Bond
,
A. Raspaud
Discrete Applied Mathematics
56
, 1995, pp. 127-136
A lower bound of the expected maximum number of edge-disjoint
s-t
paths on probabilistic graphs
Peng Cheng
,
Shigery Masuyama
Discrete Applied Mathematics
56
, 1995, pp. 137-155
Bipolar orientations revisited
Hubert de Fraysseix
,
Patrice Ossona de Mendez
,
Pierre Rosenstiehl
Discrete Applied Mathematics
56
, 1995, pp. 157-179
L
-polytopes and equiangular lines
M. Deza
,
V.P. Grishukhin
Discrete Applied Mathematics
56
, 1995, pp. 181-214
Hypercube embedding of generalized bipartite metrics
Michel Deza
,
Monique Laurent
Discrete Applied Mathematics
56
, 1995, pp. 215-230
Finding all common bases in two matroids
Komei Fukuda
,
Makoto Namiki
Discrete Applied Mathematics
56
, 1995, pp. 231-243
Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method
Masazumi Hanazawa
,
Hiroshi Narushima
,
Nobuhiro Minaka
Discrete Applied Mathematics
56
, 1995, pp. 245-265
Half-integral flows in a planar graph with four holes
Alexander V. Karzanov
Discrete Applied Mathematics
56
, 1995, pp. 267-295
Alternating paths in edge-colored complete graphs
Y. Manoussakis
Discrete Applied Mathematics
56
, 1995, pp. 297-309
Adjacency on combinatorial polyhedra
Tomomi Matsui
,
Sunao Tamura
Discrete Applied Mathematics
56
, 1995, pp. 311-321
Polynomial invariants of graphs with state models
Seiya Negami
,
Kenichi Kawagoe
Discrete Applied Mathematics
56
, 1995, pp. 323-331
An algorithm for fractional assignment problems
Maiko Shigeno
,
Yasufumi Saruwatari
,
Tomomi Matsui
Discrete Applied Mathematics
56
, 1995, pp. 333-343