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 YEAR=1993
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting bichromatic evolutionary trees
Péter L. Erdös
,
L.A. Székely
Discrete Applied Mathematics
47
, 1993, pp. 1-8
On the maximum capacity augmentation algorithm for the maximum flow problem
Donald Goldfarb
,
Jianxiu Hao
Discrete Applied Mathematics
47
, 1993, pp. 9-16
On the complexity of two circle connecting problems
Nen-Fu Huang
Discrete Applied Mathematics
47
, 1993, pp. 17-32
Counting representable sets on simple graphs
Peter G. Jeavons
Discrete Applied Mathematics
47
, 1993, pp. 33-46
Consensus functions on trees that satisfy an independence axiom
F.R. McMorris
,
R.C. Powers
Discrete Applied Mathematics
47
, 1993, pp. 47-55
An
O(n)
algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
Jack A.A. van der Veen
Discrete Applied Mathematics
47
, 1993, pp. 57-75
A fast algorithm for maximum integral two-commodity flow in planar graphs
Ephraim Korach
,
Michael Penn
Discrete Applied Mathematics
47
, 1993, pp. 77-83
The complexity of one-machine batching problems
Susanne Albers
,
Peter Brucker
Discrete Applied Mathematics
47
, 1993, pp. 87-107
Directed Steiner problems with connectivity constraints
Geir Dahl
Discrete Applied Mathematics
47
, 1993, pp. 109-128
A note on generalizing the maximum lateness criterion for scheduling
Leslie A. Hall
Discrete Applied Mathematics
47
, 1993, pp. 129-137
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
H.G. Kahlbacher
,
T.C.E. Cheng
Discrete Applied Mathematics
47
, 1993, pp. 139-164
On the Euclidean two paths problem
Hans Kellerer
,
Gerhard Woeginger
Discrete Applied Mathematics
47
, 1993, pp. 165-173
Efficient labelling algorithms for the maximum noncrossing matching problem
Federico Malucelli
,
Thomas Ottmann
,
Daniele Pretolani
Discrete Applied Mathematics
47
, 1993, pp. 175-179
On the complexity of a special basis problem in LP
Katta G. Murty
Discrete Applied Mathematics
47
, 1993, pp. 181-185
Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
Pawel Winter
Discrete Applied Mathematics
47
, 1993, pp. 187-206
A result of Vapnik with applications
Martin Anthony
,
John Shawe-Taylor
Discrete Applied Mathematics
47
, 1993, pp. 207-217
A new class of nonbinary codes meeting the Griesmer bound
Noboru Hamada
,
Tor Helleseth
,
Øyvind Ytrehus
Discrete Applied Mathematics
47
, 1993, pp. 219-226
Adjacency of the best and second best valued solutions in combinatorial optimization problems
Yoshiko Ikebe
,
Tomomi Matsui
,
Akihisa Tamura
Discrete Applied Mathematics
47
, 1993, pp. 227-232
Trace-orthogonal normal bases
Dieter Jungnickel
Discrete Applied Mathematics
47
, 1993, pp. 233-249
Locating service centers with precedence constraints
Y. Kaufman
,
A. Tamir
Discrete Applied Mathematics
47
, 1993, pp. 251-261
Coset correlation of LR
m
-arrays
Mulan Liu
,
Zunquan Li
Discrete Applied Mathematics
47
, 1993, pp. 263-273
A unifying location model on tree graphs based on submodularity properties
Arie Tamir
Discrete Applied Mathematics
47
, 1993, pp. 275-283
Hexagonal systems with fixed bonds
Fuji Zhang
,
Xueliang Li
Discrete Applied Mathematics
47
, 1993, pp. 285-296
Cross-correlations of linearly and quadratically related geometric sequences and GMW sequences
A. Klapper
,
A.H. Chan
,
M. Goresky
Discrete Applied Mathematics
46
(1), 1993, pp. 1-20
New results in the worst-case analysis for flow-shop scheduling
Eugeniusz Nowicki
,
Czesƚaw Smutnicki
Discrete Applied Mathematics
46
(1), 1993, pp. 21-41
Seiten 1
2
3
4
5
6
>